./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/working_dir_a3aeb144-4c74-4be7-9eba-a00ee96c4aee/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a3aeb144-4c74-4be7-9eba-a00ee96c4aee/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a3aeb144-4c74-4be7-9eba-a00ee96c4aee/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a3aeb144-4c74-4be7-9eba-a00ee96c4aee/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a3aeb144-4c74-4be7-9eba-a00ee96c4aee/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a3aeb144-4c74-4be7-9eba-a00ee96c4aee/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 32bit --witnessprinter.graph.data.programhash 860b8b475b7671f4fb04d10fe02f66a14a39a96b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:55:05,255 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:55:05,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:55:05,265 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:55:05,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:55:05,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:55:05,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:55:05,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:55:05,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:55:05,271 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:55:05,272 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:55:05,272 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:55:05,273 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:55:05,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:55:05,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:55:05,280 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:55:05,283 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:55:05,285 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:55:05,286 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:55:05,287 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:55:05,288 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:55:05,289 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:55:05,292 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:55:05,295 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:55:05,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:55:05,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:55:05,299 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:55:05,299 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:55:05,300 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:55:05,300 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:55:05,301 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:55:05,301 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:55:05,302 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:55:05,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:55:05,303 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:55:05,303 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:55:05,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:55:05,304 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:55:05,304 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:55:05,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:55:05,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:55:05,305 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a3aeb144-4c74-4be7-9eba-a00ee96c4aee/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:55:05,320 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:55:05,320 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:55:05,322 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:55:05,329 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:55:05,330 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:55:05,330 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:55:05,330 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:55:05,330 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:55:05,331 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:55:05,331 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:55:05,331 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:55:05,331 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:55:05,331 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:55:05,331 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:55:05,332 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:55:05,332 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:55:05,332 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:55:05,332 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:55:05,332 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:55:05,333 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:55:05,333 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:55:05,333 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:55:05,333 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:55:05,333 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:55:05,333 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:55:05,334 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:55:05,334 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:55:05,334 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:55:05,334 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:55:05,334 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:55:05,335 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:55:05,335 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:55:05,336 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/working_dir_a3aeb144-4c74-4be7-9eba-a00ee96c4aee/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 860b8b475b7671f4fb04d10fe02f66a14a39a96b [2019-10-22 08:55:05,371 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:55:05,381 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:55:05,384 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:55:05,385 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:55:05,386 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:55:05,386 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a3aeb144-4c74-4be7-9eba-a00ee96c4aee/bin/uautomizer/../../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2019-10-22 08:55:05,433 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a3aeb144-4c74-4be7-9eba-a00ee96c4aee/bin/uautomizer/data/2ec9614c0/4a2ef70e7eaa4c10bf2f48ea88fccc1e/FLAGf02624f8a [2019-10-22 08:55:05,814 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:55:05,815 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a3aeb144-4c74-4be7-9eba-a00ee96c4aee/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2019-10-22 08:55:05,820 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a3aeb144-4c74-4be7-9eba-a00ee96c4aee/bin/uautomizer/data/2ec9614c0/4a2ef70e7eaa4c10bf2f48ea88fccc1e/FLAGf02624f8a [2019-10-22 08:55:05,832 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a3aeb144-4c74-4be7-9eba-a00ee96c4aee/bin/uautomizer/data/2ec9614c0/4a2ef70e7eaa4c10bf2f48ea88fccc1e [2019-10-22 08:55:05,834 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:55:05,835 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:55:05,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:05,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:55:05,840 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:55:05,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:05" (1/1) ... [2019-10-22 08:55:05,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55162313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:05, skipping insertion in model container [2019-10-22 08:55:05,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:05" (1/1) ... [2019-10-22 08:55:05,852 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:55:05,868 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:55:06,067 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:06,074 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:55:06,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:06,225 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:55:06,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:06 WrapperNode [2019-10-22 08:55:06,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:06,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:06,226 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:55:06,227 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:55:06,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:06" (1/1) ... [2019-10-22 08:55:06,245 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:06" (1/1) ... [2019-10-22 08:55:06,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:06,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:55:06,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:55:06,268 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:55:06,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:06" (1/1) ... [2019-10-22 08:55:06,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:06" (1/1) ... [2019-10-22 08:55:06,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:06" (1/1) ... [2019-10-22 08:55:06,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:06" (1/1) ... [2019-10-22 08:55:06,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:06" (1/1) ... [2019-10-22 08:55:06,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:06" (1/1) ... [2019-10-22 08:55:06,291 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:06" (1/1) ... [2019-10-22 08:55:06,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:55:06,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:55:06,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:55:06,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:55:06,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3aeb144-4c74-4be7-9eba-a00ee96c4aee/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-10-22 08:55:06,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:55:06,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:55:06,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:55:06,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:55:06,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:55:06,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:55:06,612 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:55:06,612 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:55:06,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:06 BoogieIcfgContainer [2019-10-22 08:55:06,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:55:06,614 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:55:06,614 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:55:06,618 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:55:06,619 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:06,619 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:55:05" (1/3) ... [2019-10-22 08:55:06,620 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78a2f9b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:55:06, skipping insertion in model container [2019-10-22 08:55:06,620 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:06,620 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:06" (2/3) ... [2019-10-22 08:55:06,621 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78a2f9b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:55:06, skipping insertion in model container [2019-10-22 08:55:06,621 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:55:06,621 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:06" (3/3) ... [2019-10-22 08:55:06,623 INFO L371 chiAutomizerObserver]: Analyzing ICFG verisec_sendmail_tTflag_arr_one_loop.c [2019-10-22 08:55:06,664 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:55:06,665 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:55:06,665 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:55:06,665 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:55:06,665 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:55:06,665 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:55:06,665 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:55:06,665 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:55:06,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-10-22 08:55:06,698 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-10-22 08:55:06,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:06,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:06,705 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:55:06,706 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:55:06,706 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:55:06,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-10-22 08:55:06,707 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-10-22 08:55:06,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:06,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:06,708 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:55:06,708 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:55:06,715 INFO L791 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 4#L19-3true [2019-10-22 08:55:06,716 INFO L793 eck$LassoCheckResult]: Loop: 4#L19-3true assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 6#L19-2true main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 4#L19-3true [2019-10-22 08:55:06,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:06,722 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-10-22 08:55:06,729 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:06,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140227106] [2019-10-22 08:55:06,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:06,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:06,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:06,827 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:06,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:06,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-10-22 08:55:06,829 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:06,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305123477] [2019-10-22 08:55:06,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:06,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:06,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:06,850 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:06,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:06,852 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-10-22 08:55:06,853 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:06,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468385610] [2019-10-22 08:55:06,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:06,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:06,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:06,900 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:07,110 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:07,111 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:07,111 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:07,111 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:07,111 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:07,111 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:07,111 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:07,112 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:07,112 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail_tTflag_arr_one_loop.c_Iteration1_Lasso [2019-10-22 08:55:07,112 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:07,112 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:07,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:07,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:07,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:07,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:07,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:07,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:07,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:07,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:07,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:07,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:07,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:07,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:07,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:07,361 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:07,366 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:07,368 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-10-22 08:55:07,370 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:07,370 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:07,371 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:07,371 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:07,371 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:07,373 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:07,373 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:07,375 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:07,375 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-10-22 08:55:07,376 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:07,376 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:07,376 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:07,376 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:07,377 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:07,377 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:07,378 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:07,379 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:07,379 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-10-22 08:55:07,380 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:07,380 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:07,380 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:07,380 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:07,383 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:07,383 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:07,394 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:07,394 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-10-22 08:55:07,395 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:07,395 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:07,396 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:07,396 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:07,396 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:07,396 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:07,396 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:07,402 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:07,402 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-10-22 08:55:07,403 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:07,403 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:07,403 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:07,403 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:07,405 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:07,405 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:07,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:07,412 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-10-22 08:55:07,418 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:07,418 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:07,418 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:07,419 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:07,422 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:07,422 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:07,470 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:07,508 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:55:07,508 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:55:07,516 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:07,518 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:55:07,518 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:07,519 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 21 Supporting invariants [] [2019-10-22 08:55:07,530 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 08:55:07,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:07,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:07,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:07,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:55:07,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:07,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:07,608 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-10-22 08:55:07,609 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 3 states. [2019-10-22 08:55:07,652 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 3 states. Result 25 states and 35 transitions. Complement of second has 8 states. [2019-10-22 08:55:07,653 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-10-22 08:55:07,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:55:07,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-10-22 08:55:07,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 2 letters. Loop has 2 letters. [2019-10-22 08:55:07,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:07,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 4 letters. Loop has 2 letters. [2019-10-22 08:55:07,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:07,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 2 letters. Loop has 4 letters. [2019-10-22 08:55:07,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:07,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 35 transitions. [2019-10-22 08:55:07,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:07,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 7 states and 9 transitions. [2019-10-22 08:55:07,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-10-22 08:55:07,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-10-22 08:55:07,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2019-10-22 08:55:07,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:07,668 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-10-22 08:55:07,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2019-10-22 08:55:07,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-10-22 08:55:07,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:55:07,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-10-22 08:55:07,686 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-10-22 08:55:07,686 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-10-22 08:55:07,686 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:55:07,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-10-22 08:55:07,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:07,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:07,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:07,687 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:55:07,687 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:55:07,688 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~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 85#L19-3 assume !(main_~i~0 < 11); 82#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 83#L26-2 [2019-10-22 08:55:07,688 INFO L793 eck$LassoCheckResult]: Loop: 83#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 83#L26-2 [2019-10-22 08:55:07,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:07,688 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-10-22 08:55:07,688 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:07,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042486298] [2019-10-22 08:55:07,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:07,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:07,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:07,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:07,722 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042486298] [2019-10-22 08:55:07,723 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:07,723 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:07,723 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182269461] [2019-10-22 08:55:07,725 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:07,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:07,725 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 1 times [2019-10-22 08:55:07,726 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:07,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144040780] [2019-10-22 08:55:07,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:07,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:07,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:07,752 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:07,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:07,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:07,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:07,818 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-10-22 08:55:07,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:07,833 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-10-22 08:55:07,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:07,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-10-22 08:55:07,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:07,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2019-10-22 08:55:07,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-10-22 08:55:07,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-10-22 08:55:07,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2019-10-22 08:55:07,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:07,837 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-10-22 08:55:07,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2019-10-22 08:55:07,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2019-10-22 08:55:07,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:55:07,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-10-22 08:55:07,838 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-10-22 08:55:07,838 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-10-22 08:55:07,838 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:55:07,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2019-10-22 08:55:07,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:07,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:07,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:07,840 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:55:07,840 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:55:07,840 INFO L791 eck$LassoCheckResult]: Stem: 110#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 104#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 105#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 108#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 109#L19-3 assume !(main_~i~0 < 11); 106#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 107#L26-2 [2019-10-22 08:55:07,840 INFO L793 eck$LassoCheckResult]: Loop: 107#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 107#L26-2 [2019-10-22 08:55:07,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:07,840 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2019-10-22 08:55:07,841 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:07,841 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980669301] [2019-10-22 08:55:07,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:07,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:07,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:07,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:07,888 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980669301] [2019-10-22 08:55:07,888 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898911758] [2019-10-22 08:55:07,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3aeb144-4c74-4be7-9eba-a00ee96c4aee/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-10-22 08:55:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:07,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:55:07,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:07,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:07,944 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:55:07,944 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-22 08:55:07,944 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459014242] [2019-10-22 08:55:07,945 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:07,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:07,947 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 2 times [2019-10-22 08:55:07,947 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:07,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132895267] [2019-10-22 08:55:07,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:07,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:07,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:07,970 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:08,033 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:08,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:55:08,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:08,033 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 3 Second operand 5 states. [2019-10-22 08:55:08,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:08,057 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-10-22 08:55:08,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:55:08,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2019-10-22 08:55:08,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:08,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2019-10-22 08:55:08,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-10-22 08:55:08,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-10-22 08:55:08,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2019-10-22 08:55:08,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:08,059 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-10-22 08:55:08,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2019-10-22 08:55:08,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-10-22 08:55:08,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-10-22 08:55:08,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-10-22 08:55:08,060 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-10-22 08:55:08,060 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-10-22 08:55:08,060 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:55:08,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2019-10-22 08:55:08,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:08,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:08,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:08,063 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-10-22 08:55:08,063 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:55:08,064 INFO L791 eck$LassoCheckResult]: Stem: 149#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 145#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 146#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 150#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 151#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 152#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 153#L19-3 assume !(main_~i~0 < 11); 147#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 148#L26-2 [2019-10-22 08:55:08,064 INFO L793 eck$LassoCheckResult]: Loop: 148#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 148#L26-2 [2019-10-22 08:55:08,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:08,064 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2019-10-22 08:55:08,064 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:08,065 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722349057] [2019-10-22 08:55:08,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:08,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:08,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:08,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:08,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722349057] [2019-10-22 08:55:08,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493320331] [2019-10-22 08:55:08,105 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3aeb144-4c74-4be7-9eba-a00ee96c4aee/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-10-22 08:55:08,154 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:55:08,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:55:08,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:55:08,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:08,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:08,166 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:55:08,166 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-22 08:55:08,167 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129305917] [2019-10-22 08:55:08,167 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:08,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:08,167 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 3 times [2019-10-22 08:55:08,167 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:08,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24365635] [2019-10-22 08:55:08,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:08,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:08,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:08,186 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:08,244 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:08,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:55:08,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:55:08,244 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand 6 states. [2019-10-22 08:55:08,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:08,274 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-10-22 08:55:08,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:55:08,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2019-10-22 08:55:08,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:08,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2019-10-22 08:55:08,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-10-22 08:55:08,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-10-22 08:55:08,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2019-10-22 08:55:08,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:08,277 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-10-22 08:55:08,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2019-10-22 08:55:08,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-10-22 08:55:08,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 08:55:08,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-10-22 08:55:08,279 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-10-22 08:55:08,279 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-10-22 08:55:08,279 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:55:08,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2019-10-22 08:55:08,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:08,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:08,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:08,280 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2019-10-22 08:55:08,280 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:55:08,280 INFO L791 eck$LassoCheckResult]: Stem: 204#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 199#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 200#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 201#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 207#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 205#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 202#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 203#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 206#L19-3 assume !(main_~i~0 < 11); 197#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 198#L26-2 [2019-10-22 08:55:08,281 INFO L793 eck$LassoCheckResult]: Loop: 198#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 198#L26-2 [2019-10-22 08:55:08,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:08,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2019-10-22 08:55:08,281 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:08,281 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318855218] [2019-10-22 08:55:08,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:08,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:08,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:08,336 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:08,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318855218] [2019-10-22 08:55:08,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886080582] [2019-10-22 08:55:08,337 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3aeb144-4c74-4be7-9eba-a00ee96c4aee/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-10-22 08:55:08,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-22 08:55:08,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:55:08,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:55:08,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:08,396 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:08,396 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:55:08,397 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-22 08:55:08,397 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38970808] [2019-10-22 08:55:08,397 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:08,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:08,398 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 4 times [2019-10-22 08:55:08,398 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:08,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12590338] [2019-10-22 08:55:08,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:08,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:08,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:08,422 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:08,491 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:08,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:55:08,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:55:08,491 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand 7 states. [2019-10-22 08:55:08,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:08,532 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-10-22 08:55:08,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:55:08,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2019-10-22 08:55:08,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:08,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2019-10-22 08:55:08,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-10-22 08:55:08,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-10-22 08:55:08,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2019-10-22 08:55:08,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:08,534 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-10-22 08:55:08,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2019-10-22 08:55:08,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2019-10-22 08:55:08,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 08:55:08,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-10-22 08:55:08,536 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-10-22 08:55:08,536 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-10-22 08:55:08,536 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:55:08,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2019-10-22 08:55:08,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:08,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:08,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:08,540 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2019-10-22 08:55:08,540 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:55:08,540 INFO L791 eck$LassoCheckResult]: Stem: 264#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 262#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 263#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 265#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 266#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 267#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 268#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 272#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 271#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 270#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 269#L19-3 assume !(main_~i~0 < 11); 260#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 261#L26-2 [2019-10-22 08:55:08,540 INFO L793 eck$LassoCheckResult]: Loop: 261#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 261#L26-2 [2019-10-22 08:55:08,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:08,541 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2019-10-22 08:55:08,541 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:08,541 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212367114] [2019-10-22 08:55:08,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:08,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:08,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:08,603 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:08,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212367114] [2019-10-22 08:55:08,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224296894] [2019-10-22 08:55:08,603 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3aeb144-4c74-4be7-9eba-a00ee96c4aee/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-10-22 08:55:08,652 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-22 08:55:08,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:55:08,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:55:08,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:08,664 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:08,666 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:55:08,666 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-22 08:55:08,667 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126673518] [2019-10-22 08:55:08,667 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:08,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:08,667 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 5 times [2019-10-22 08:55:08,668 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:08,668 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423761856] [2019-10-22 08:55:08,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:08,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:08,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:08,685 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:08,741 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:08,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 08:55:08,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:55:08,741 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 3 Second operand 8 states. [2019-10-22 08:55:08,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:08,774 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-10-22 08:55:08,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:55:08,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2019-10-22 08:55:08,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:08,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2019-10-22 08:55:08,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-10-22 08:55:08,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-10-22 08:55:08,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2019-10-22 08:55:08,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:08,776 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-10-22 08:55:08,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2019-10-22 08:55:08,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2019-10-22 08:55:08,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 08:55:08,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-10-22 08:55:08,778 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-10-22 08:55:08,778 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-10-22 08:55:08,778 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:55:08,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2019-10-22 08:55:08,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:08,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:08,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:08,779 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2019-10-22 08:55:08,779 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:55:08,779 INFO L791 eck$LassoCheckResult]: Stem: 341#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 336#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 337#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 338#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 339#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 340#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 342#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 348#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 347#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 346#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 345#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 344#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 343#L19-3 assume !(main_~i~0 < 11); 334#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 335#L26-2 [2019-10-22 08:55:08,780 INFO L793 eck$LassoCheckResult]: Loop: 335#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 335#L26-2 [2019-10-22 08:55:08,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:08,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2019-10-22 08:55:08,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:08,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467816842] [2019-10-22 08:55:08,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:08,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:08,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:08,825 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:08,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467816842] [2019-10-22 08:55:08,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476257225] [2019-10-22 08:55:08,826 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3aeb144-4c74-4be7-9eba-a00ee96c4aee/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-10-22 08:55:08,874 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-22 08:55:08,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:55:08,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 08:55:08,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:08,888 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:08,888 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:55:08,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-22 08:55:08,889 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627123641] [2019-10-22 08:55:08,889 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:08,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:08,889 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 6 times [2019-10-22 08:55:08,889 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:08,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117606227] [2019-10-22 08:55:08,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:08,890 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:08,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:08,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:08,910 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:08,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:08,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 08:55:08,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:55:08,981 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 9 states. [2019-10-22 08:55:09,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:09,014 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-10-22 08:55:09,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:55:09,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 20 transitions. [2019-10-22 08:55:09,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:09,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 20 transitions. [2019-10-22 08:55:09,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-10-22 08:55:09,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-10-22 08:55:09,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 20 transitions. [2019-10-22 08:55:09,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:09,016 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-10-22 08:55:09,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 20 transitions. [2019-10-22 08:55:09,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-10-22 08:55:09,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 08:55:09,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-10-22 08:55:09,018 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-10-22 08:55:09,018 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-10-22 08:55:09,019 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:55:09,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2019-10-22 08:55:09,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:09,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:09,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:09,020 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2019-10-22 08:55:09,020 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:55:09,020 INFO L791 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 419#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 420#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 424#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 425#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 426#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 435#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 434#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 433#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 432#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 431#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 430#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 429#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 428#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 427#L19-3 assume !(main_~i~0 < 11); 421#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 422#L26-2 [2019-10-22 08:55:09,020 INFO L793 eck$LassoCheckResult]: Loop: 422#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 422#L26-2 [2019-10-22 08:55:09,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:09,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2019-10-22 08:55:09,021 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:09,021 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839897556] [2019-10-22 08:55:09,021 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,021 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:09,083 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:09,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839897556] [2019-10-22 08:55:09,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300240555] [2019-10-22 08:55:09,084 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3aeb144-4c74-4be7-9eba-a00ee96c4aee/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-10-22 08:55:09,128 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-22 08:55:09,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:55:09,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:55:09,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:09,140 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:09,140 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:55:09,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-22 08:55:09,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054159078] [2019-10-22 08:55:09,141 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:09,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:09,142 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 7 times [2019-10-22 08:55:09,142 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:09,142 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799343455] [2019-10-22 08:55:09,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:09,162 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:09,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:09,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 08:55:09,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:55:09,216 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand 10 states. [2019-10-22 08:55:09,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:09,257 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-10-22 08:55:09,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:55:09,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2019-10-22 08:55:09,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:09,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 22 transitions. [2019-10-22 08:55:09,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-10-22 08:55:09,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-10-22 08:55:09,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions. [2019-10-22 08:55:09,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:09,260 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-10-22 08:55:09,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions. [2019-10-22 08:55:09,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-10-22 08:55:09,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-22 08:55:09,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-10-22 08:55:09,261 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-10-22 08:55:09,262 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-10-22 08:55:09,262 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 08:55:09,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2019-10-22 08:55:09,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:09,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:09,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:09,263 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2019-10-22 08:55:09,263 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:55:09,263 INFO L791 eck$LassoCheckResult]: Stem: 519#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 515#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 516#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 520#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 521#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 522#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 533#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 532#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 531#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 530#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 529#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 528#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 527#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 526#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 525#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 524#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 523#L19-3 assume !(main_~i~0 < 11); 517#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 518#L26-2 [2019-10-22 08:55:09,263 INFO L793 eck$LassoCheckResult]: Loop: 518#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 518#L26-2 [2019-10-22 08:55:09,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:09,264 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2019-10-22 08:55:09,264 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:09,264 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335203024] [2019-10-22 08:55:09,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:09,364 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:09,364 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335203024] [2019-10-22 08:55:09,365 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729422446] [2019-10-22 08:55:09,365 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3aeb144-4c74-4be7-9eba-a00ee96c4aee/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-10-22 08:55:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:09,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:55:09,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:09,416 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:09,417 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:55:09,417 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-22 08:55:09,417 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037997114] [2019-10-22 08:55:09,417 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:09,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:09,420 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 8 times [2019-10-22 08:55:09,420 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:09,420 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590977075] [2019-10-22 08:55:09,420 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:09,431 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:09,482 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:09,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 08:55:09,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-22 08:55:09,483 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 3 Second operand 11 states. [2019-10-22 08:55:09,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:09,523 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-10-22 08:55:09,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 08:55:09,523 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2019-10-22 08:55:09,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:09,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 24 transitions. [2019-10-22 08:55:09,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-10-22 08:55:09,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-10-22 08:55:09,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2019-10-22 08:55:09,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:09,525 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-10-22 08:55:09,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2019-10-22 08:55:09,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2019-10-22 08:55:09,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-22 08:55:09,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-10-22 08:55:09,527 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-10-22 08:55:09,527 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-10-22 08:55:09,527 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 08:55:09,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2019-10-22 08:55:09,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:09,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:09,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:09,528 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2019-10-22 08:55:09,528 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:55:09,528 INFO L791 eck$LassoCheckResult]: Stem: 629#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 624#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 625#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 626#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 627#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 628#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 630#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 642#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 641#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 640#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 639#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 638#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 637#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 636#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 635#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 634#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 633#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 632#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 631#L19-3 assume !(main_~i~0 < 11); 622#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 623#L26-2 [2019-10-22 08:55:09,528 INFO L793 eck$LassoCheckResult]: Loop: 623#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 623#L26-2 [2019-10-22 08:55:09,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:09,529 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2019-10-22 08:55:09,529 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:09,529 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231927038] [2019-10-22 08:55:09,529 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,529 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:09,623 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:09,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231927038] [2019-10-22 08:55:09,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646376824] [2019-10-22 08:55:09,624 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3aeb144-4c74-4be7-9eba-a00ee96c4aee/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-10-22 08:55:09,664 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:55:09,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:55:09,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 08:55:09,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:09,688 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:09,689 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:55:09,691 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-22 08:55:09,691 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992736808] [2019-10-22 08:55:09,692 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:09,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:09,692 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 9 times [2019-10-22 08:55:09,693 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:09,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738675859] [2019-10-22 08:55:09,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:09,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:09,702 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:09,756 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:09,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 08:55:09,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:55:09,757 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 3 Second operand 12 states. [2019-10-22 08:55:09,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:09,817 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-10-22 08:55:09,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 08:55:09,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2019-10-22 08:55:09,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:09,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2019-10-22 08:55:09,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-10-22 08:55:09,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-10-22 08:55:09,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2019-10-22 08:55:09,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:09,820 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-10-22 08:55:09,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2019-10-22 08:55:09,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-10-22 08:55:09,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-22 08:55:09,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-10-22 08:55:09,824 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-10-22 08:55:09,824 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-10-22 08:55:09,824 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 08:55:09,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2019-10-22 08:55:09,824 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:09,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:09,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:09,825 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2019-10-22 08:55:09,825 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:55:09,825 INFO L791 eck$LassoCheckResult]: Stem: 744#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 740#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 741#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 745#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 746#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 747#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 762#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 761#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 760#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 759#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 758#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 757#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 756#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 755#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 754#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 753#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 752#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 751#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 750#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 749#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 748#L19-3 assume !(main_~i~0 < 11); 742#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 743#L26-2 [2019-10-22 08:55:09,826 INFO L793 eck$LassoCheckResult]: Loop: 743#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 743#L26-2 [2019-10-22 08:55:09,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:09,826 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2019-10-22 08:55:09,826 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:09,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995728696] [2019-10-22 08:55:09,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:09,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:09,926 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:09,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995728696] [2019-10-22 08:55:09,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933958756] [2019-10-22 08:55:09,927 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3aeb144-4c74-4be7-9eba-a00ee96c4aee/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-10-22 08:55:10,014 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-10-22 08:55:10,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:55:10,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 08:55:10,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:10,031 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:10,031 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:55:10,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-10-22 08:55:10,032 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902222317] [2019-10-22 08:55:10,032 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:10,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:10,032 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 10 times [2019-10-22 08:55:10,032 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:10,033 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591457074] [2019-10-22 08:55:10,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:10,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:10,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:10,042 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:10,094 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:10,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-22 08:55:10,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-22 08:55:10,094 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. cyclomatic complexity: 3 Second operand 13 states. [2019-10-22 08:55:10,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:10,144 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-10-22 08:55:10,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 08:55:10,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2019-10-22 08:55:10,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:10,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 29 transitions. [2019-10-22 08:55:10,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-10-22 08:55:10,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-10-22 08:55:10,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 29 transitions. [2019-10-22 08:55:10,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:10,147 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-10-22 08:55:10,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 29 transitions. [2019-10-22 08:55:10,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-10-22 08:55:10,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-22 08:55:10,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-10-22 08:55:10,149 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-10-22 08:55:10,149 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-10-22 08:55:10,149 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-10-22 08:55:10,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2019-10-22 08:55:10,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:10,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:10,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:10,151 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2019-10-22 08:55:10,151 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:55:10,151 INFO L791 eck$LassoCheckResult]: Stem: 874#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 870#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 871#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 875#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 876#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 877#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 894#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 893#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 892#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 891#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 890#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 889#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 888#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 887#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 886#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 885#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 884#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 883#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 882#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 881#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 880#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 879#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 878#L19-3 assume !(main_~i~0 < 11); 872#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 873#L26-2 [2019-10-22 08:55:10,151 INFO L793 eck$LassoCheckResult]: Loop: 873#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 873#L26-2 [2019-10-22 08:55:10,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:10,152 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2019-10-22 08:55:10,152 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:10,152 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732016778] [2019-10-22 08:55:10,152 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:10,152 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:10,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:10,254 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:10,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732016778] [2019-10-22 08:55:10,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476827079] [2019-10-22 08:55:10,255 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a3aeb144-4c74-4be7-9eba-a00ee96c4aee/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:55:10,298 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-22 08:55:10,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:55:10,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:55:10,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:10,313 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:10,313 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:55:10,313 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-22 08:55:10,313 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21407029] [2019-10-22 08:55:10,314 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:55:10,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:10,314 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 11 times [2019-10-22 08:55:10,314 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:10,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756000783] [2019-10-22 08:55:10,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:10,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:10,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:10,322 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:10,375 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:10,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 08:55:10,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-22 08:55:10,376 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 3 Second operand 14 states. [2019-10-22 08:55:10,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:10,451 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-10-22 08:55:10,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 08:55:10,452 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 30 transitions. [2019-10-22 08:55:10,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:10,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 30 transitions. [2019-10-22 08:55:10,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-10-22 08:55:10,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-10-22 08:55:10,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 30 transitions. [2019-10-22 08:55:10,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:10,453 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-10-22 08:55:10,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 30 transitions. [2019-10-22 08:55:10,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-10-22 08:55:10,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-22 08:55:10,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-10-22 08:55:10,455 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-10-22 08:55:10,455 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-10-22 08:55:10,455 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-10-22 08:55:10,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2019-10-22 08:55:10,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 08:55:10,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:55:10,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:55:10,457 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 1, 1, 1, 1] [2019-10-22 08:55:10,457 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:55:10,457 INFO L791 eck$LassoCheckResult]: Stem: 1014#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1010#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.allocOnStack(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 1011#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1015#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1016#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1017#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1036#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1035#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1034#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1033#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1032#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1031#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1030#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1029#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1028#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1027#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1026#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1025#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1024#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1023#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1022#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1021#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1020#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1019#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1018#L19-3 assume !(main_~i~0 < 11); 1012#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 1013#L26-2 [2019-10-22 08:55:10,457 INFO L793 eck$LassoCheckResult]: Loop: 1013#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 1013#L26-2 [2019-10-22 08:55:10,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:10,457 INFO L82 PathProgramCache]: Analyzing trace with hash -95647583, now seen corresponding path program 11 times [2019-10-22 08:55:10,457 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:10,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991223095] [2019-10-22 08:55:10,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:10,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:10,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:10,517 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:10,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:10,521 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 12 times [2019-10-22 08:55:10,521 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:10,521 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682020856] [2019-10-22 08:55:10,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:10,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:10,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:10,531 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:10,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:10,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1329892248, now seen corresponding path program 1 times [2019-10-22 08:55:10,533 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:10,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36739652] [2019-10-22 08:55:10,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:10,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:10,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:55:10,595 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:55:22,702 WARN L191 SmtUtils]: Spent 12.07 s on a formula simplification that was a NOOP. DAG size: 47 [2019-10-22 08:55:31,162 WARN L191 SmtUtils]: Spent 8.46 s on a formula simplification. DAG size of input: 216 DAG size of output: 164 [2019-10-22 08:55:31,377 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-10-22 08:55:31,379 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:55:31,379 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:55:31,379 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:55:31,379 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:55:31,379 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:55:31,379 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:55:31,379 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:55:31,379 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:55:31,379 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail_tTflag_arr_one_loop.c_Iteration13_Lasso [2019-10-22 08:55:31,379 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:55:31,380 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:55:31,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:31,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:31,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:31,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:31,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:31,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,492 WARN L191 SmtUtils]: Spent 12.04 s on a formula simplification that was a NOOP. DAG size: 41 [2019-10-22 08:55:43,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:55:43,835 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-10-22 08:55:43,847 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:55:43,847 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:55:43,847 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-10-22 08:55:43,848 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:43,848 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:43,848 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:43,848 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:43,848 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:43,849 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:43,849 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:43,850 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:43,851 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-10-22 08:55:43,851 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:43,851 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:43,851 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:43,852 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:43,852 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:43,852 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:43,852 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:43,853 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:43,853 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-10-22 08:55:43,853 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:43,854 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:43,854 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:43,854 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:43,855 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:43,856 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:43,857 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:43,858 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-10-22 08:55:43,858 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:43,858 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:43,858 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:43,858 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:43,859 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:43,859 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:43,859 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:43,859 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:43,860 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-10-22 08:55:43,860 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:43,860 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:55:43,861 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:43,861 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:43,861 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:43,861 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:55:43,861 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:55:43,862 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:43,863 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-10-22 08:55:43,863 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:43,863 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:55:43,863 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:43,864 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:43,865 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:55:43,866 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:43,869 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:43,869 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-10-22 08:55:43,870 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:43,870 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:43,870 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:43,870 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:43,871 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:43,871 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:43,873 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:55:43,873 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-10-22 08:55:43,873 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:55:43,874 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:55:43,874 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:55:43,874 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:55:43,876 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:55:43,876 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:55:43,884 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:55:43,891 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:55:43,891 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:55:43,892 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:55:43,892 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:55:43,893 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:55:43,893 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#in~0.offset, v_rep(select #length ULTIMATE.start_main_~#in~0.base)_2, ULTIMATE.start_main_~idx_in~0) = -1*ULTIMATE.start_main_~#in~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~#in~0.base)_2 - 1*ULTIMATE.start_main_~idx_in~0 Supporting invariants [] [2019-10-22 08:55:43,903 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 08:55:43,905 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:55:43,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:43,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:43,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:43,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:55:43,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:43,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:43,977 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-10-22 08:55:43,978 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 28 transitions. cyclomatic complexity: 3 Second operand 2 states. [2019-10-22 08:55:43,990 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 28 transitions. cyclomatic complexity: 3. Second operand 2 states. Result 28 states and 29 transitions. Complement of second has 2 states. [2019-10-22 08:55:43,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2019-10-22 08:55:43,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-10-22 08:55:43,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 7 transitions. [2019-10-22 08:55:43,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 26 letters. Loop has 1 letters. [2019-10-22 08:55:43,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:43,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 27 letters. Loop has 1 letters. [2019-10-22 08:55:43,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:43,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 7 transitions. Stem has 26 letters. Loop has 2 letters. [2019-10-22 08:55:43,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:55:43,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2019-10-22 08:55:43,994 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:55:43,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2019-10-22 08:55:43,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:55:43,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:55:43,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:55:43,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:55:43,994 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:43,995 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:43,995 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:43,995 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-10-22 08:55:43,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:55:43,995 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:55:43,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:55:44,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:55:44 BoogieIcfgContainer [2019-10-22 08:55:44,000 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:55:44,001 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:55:44,001 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:55:44,001 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:55:44,002 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:06" (3/4) ... [2019-10-22 08:55:44,005 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:55:44,005 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:55:44,007 INFO L168 Benchmark]: Toolchain (without parser) took 38171.36 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 335.0 MB). Free memory was 943.2 MB in the beginning and 1.3 GB in the end (delta: -382.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:44,007 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:44,008 INFO L168 Benchmark]: CACSL2BoogieTranslator took 389.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.2 MB). Free memory was 943.2 MB in the beginning and 1.2 GB in the end (delta: -222.7 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:44,008 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:44,009 INFO L168 Benchmark]: Boogie Preprocessor took 26.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:44,009 INFO L168 Benchmark]: RCFGBuilder took 319.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:44,010 INFO L168 Benchmark]: BuchiAutomizer took 37386.31 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 158.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -184.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:44,010 INFO L168 Benchmark]: Witness Printer took 4.43 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:44,013 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 389.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.2 MB). Free memory was 943.2 MB in the beginning and 1.2 GB in the end (delta: -222.7 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 319.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 37386.31 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 158.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -184.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.43 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (11 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 21 and consists of 5 locations. One deterministic module has affine ranking function -1 * in + unknown-#length-unknown[in] + -1 * idx_in and consists of 2 locations. 11 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 37.3s and 14 iterations. TraceHistogramMax:11. Analysis of lassos took 36.5s. Construction of modules took 0.3s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 13. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 23 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 12. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 53 SDtfs, 73 SDslu, 57 SDs, 0 SdLazy, 298 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU11 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital153 mio100 ax100 hnf100 lsp95 ukn55 mio100 lsp57 div155 bol100 ite103 ukn100 eq156 hnf73 smp97 dnf130 smp98 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 3 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...