./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/bitvector-loops/verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_23d19910-f525-4576-9d76-0b66d10bfe83/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_23d19910-f525-4576-9d76-0b66d10bfe83/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_23d19910-f525-4576-9d76-0b66d10bfe83/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_23d19910-f525-4576-9d76-0b66d10bfe83/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/bitvector-loops/verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_23d19910-f525-4576-9d76-0b66d10bfe83/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_23d19910-f525-4576-9d76-0b66d10bfe83/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eda42c9201fdedd9f50669e53ef2af5b1d7cb675 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 11:45:59,089 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:45:59,091 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:45:59,099 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:45:59,099 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:45:59,100 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:45:59,101 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:45:59,102 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:45:59,103 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:45:59,104 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:45:59,104 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:45:59,105 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:45:59,105 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:45:59,106 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:45:59,107 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:45:59,108 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:45:59,108 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:45:59,109 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:45:59,111 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:45:59,112 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:45:59,113 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:45:59,114 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:45:59,116 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:45:59,116 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:45:59,116 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:45:59,117 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:45:59,118 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:45:59,118 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:45:59,119 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:45:59,120 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:45:59,120 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:45:59,120 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:45:59,121 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:45:59,121 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:45:59,122 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:45:59,122 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:45:59,122 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_23d19910-f525-4576-9d76-0b66d10bfe83/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 11:45:59,133 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:45:59,134 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:45:59,135 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 11:45:59,135 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 11:45:59,135 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 11:45:59,135 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 11:45:59,135 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 11:45:59,136 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 11:45:59,136 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 11:45:59,136 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 11:45:59,136 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 11:45:59,136 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:45:59,136 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 11:45:59,136 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 11:45:59,137 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:45:59,137 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 11:45:59,137 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:45:59,137 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 11:45:59,137 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 11:45:59,137 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 11:45:59,137 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 11:45:59,138 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:45:59,138 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 11:45:59,138 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 11:45:59,138 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:45:59,138 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:45:59,138 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 11:45:59,138 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:45:59,139 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 11:45:59,139 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 11:45:59,140 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 11:45:59,140 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_23d19910-f525-4576-9d76-0b66d10bfe83/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eda42c9201fdedd9f50669e53ef2af5b1d7cb675 [2018-11-10 11:45:59,162 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:45:59,171 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:45:59,174 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:45:59,175 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:45:59,176 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:45:59,176 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_23d19910-f525-4576-9d76-0b66d10bfe83/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector-loops/verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i [2018-11-10 11:45:59,222 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_23d19910-f525-4576-9d76-0b66d10bfe83/bin-2019/uautomizer/data/7837558fe/b4bea01b80424d86bcf9f60d47398dbc/FLAG37c353d8f [2018-11-10 11:45:59,621 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:45:59,621 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_23d19910-f525-4576-9d76-0b66d10bfe83/sv-benchmarks/c/bitvector-loops/verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i [2018-11-10 11:45:59,625 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_23d19910-f525-4576-9d76-0b66d10bfe83/bin-2019/uautomizer/data/7837558fe/b4bea01b80424d86bcf9f60d47398dbc/FLAG37c353d8f [2018-11-10 11:45:59,635 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_23d19910-f525-4576-9d76-0b66d10bfe83/bin-2019/uautomizer/data/7837558fe/b4bea01b80424d86bcf9f60d47398dbc [2018-11-10 11:45:59,637 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:45:59,637 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:45:59,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:45:59,638 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:45:59,641 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:45:59,642 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:45:59" (1/1) ... [2018-11-10 11:45:59,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@305850f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:45:59, skipping insertion in model container [2018-11-10 11:45:59,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:45:59" (1/1) ... [2018-11-10 11:45:59,650 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:45:59,663 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:45:59,766 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:45:59,768 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:45:59,780 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:45:59,792 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:45:59,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:45:59 WrapperNode [2018-11-10 11:45:59,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:45:59,793 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:45:59,793 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:45:59,793 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:45:59,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:45:59" (1/1) ... [2018-11-10 11:45:59,807 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:45:59" (1/1) ... [2018-11-10 11:45:59,824 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:45:59,824 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:45:59,824 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:45:59,824 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:45:59,832 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:45:59" (1/1) ... [2018-11-10 11:45:59,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:45:59" (1/1) ... [2018-11-10 11:45:59,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:45:59" (1/1) ... [2018-11-10 11:45:59,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:45:59" (1/1) ... [2018-11-10 11:45:59,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:45:59" (1/1) ... [2018-11-10 11:45:59,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:45:59" (1/1) ... [2018-11-10 11:45:59,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:45:59" (1/1) ... [2018-11-10 11:45:59,844 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:45:59,844 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:45:59,845 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:45:59,845 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:45:59,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:45:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_23d19910-f525-4576-9d76-0b66d10bfe83/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:45:59,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 11:45:59,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:45:59,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:45:59,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 11:46:00,099 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:46:00,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:46:00 BoogieIcfgContainer [2018-11-10 11:46:00,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:46:00,100 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 11:46:00,100 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 11:46:00,103 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 11:46:00,104 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:46:00,104 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:45:59" (1/3) ... [2018-11-10 11:46:00,105 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68911593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:46:00, skipping insertion in model container [2018-11-10 11:46:00,105 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:46:00,105 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:45:59" (2/3) ... [2018-11-10 11:46:00,106 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68911593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:46:00, skipping insertion in model container [2018-11-10 11:46:00,106 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:46:00,106 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:46:00" (3/3) ... [2018-11-10 11:46:00,107 INFO L375 chiAutomizerObserver]: Analyzing ICFG verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i [2018-11-10 11:46:00,156 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 11:46:00,157 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 11:46:00,157 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 11:46:00,157 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 11:46:00,157 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:46:00,157 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:46:00,158 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 11:46:00,158 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:46:00,158 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 11:46:00,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-10 11:46:00,182 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-10 11:46:00,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:46:00,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:46:00,187 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 11:46:00,187 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 11:46:00,188 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 11:46:00,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-10 11:46:00,189 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-10 11:46:00,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:46:00,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:46:00,190 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 11:46:00,190 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 11:46:00,195 INFO L793 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 11;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 3#L19-4true [2018-11-10 11:46:00,195 INFO L795 eck$LassoCheckResult]: Loop: 3#L19-4true assume true; 7#L19-1true assume !!(main_~i~0 < 11); 10#L20true SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 8#L20-1true havoc main_#t~nondet1; 4#L19-3true main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 3#L19-4true [2018-11-10 11:46:00,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:00,199 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 11:46:00,201 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:00,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:00,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:00,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:00,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:00,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:00,272 INFO L82 PathProgramCache]: Analyzing trace with hash 34509928, now seen corresponding path program 1 times [2018-11-10 11:46:00,272 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:00,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:00,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:00,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:00,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:00,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:00,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1805949414, now seen corresponding path program 1 times [2018-11-10 11:46:00,289 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:00,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:00,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:00,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:00,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:00,450 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:46:00,451 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:46:00,451 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:46:00,451 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:46:00,451 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:46:00,452 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:46:00,452 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:46:00,452 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:46:00,452 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-10 11:46:00,452 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:46:00,452 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:46:00,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:46:00,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:46:00,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:46:00,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:46:00,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:46:00,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:46:00,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:46:00,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:46:00,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:46:00,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:46:00,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:46:00,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:46:00,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:46:00,776 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:46:00,779 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:46:00,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:46:00,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:46:00,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:46:00,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:46:00,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:46:00,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:46:00,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:46:00,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:46:00,786 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:46:00,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:46:00,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:46:00,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:46:00,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:46:00,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:46:00,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:46:00,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:46:00,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:46:00,789 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:46:00,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:46:00,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:46:00,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:46:00,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:46:00,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:46:00,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:46:00,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:46:00,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:46:00,791 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:46:00,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:46:00,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:46:00,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:46:00,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:46:00,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:46:00,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:46:00,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:46:00,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:46:00,794 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:46:00,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:46:00,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:46:00,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:46:00,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:46:00,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:46:00,797 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:46:00,797 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:46:00,801 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:46:00,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:46:00,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:46:00,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:46:00,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:46:00,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:46:00,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:46:00,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:46:00,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:46:00,804 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:46:00,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:46:00,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:46:00,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:46:00,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:46:00,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:46:00,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:46:00,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:46:00,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:46:00,807 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:46:00,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:46:00,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:46:00,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:46:00,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:46:00,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:46:00,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:46:00,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:46:00,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:46:00,809 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:46:00,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:46:00,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:46:00,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:46:00,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:46:00,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:46:00,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:46:00,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:46:00,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:46:00,813 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:46:00,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:46:00,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:46:00,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:46:00,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:46:00,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:46:00,816 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:46:00,816 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:46:00,824 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:46:00,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:46:00,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:46:00,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:46:00,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:46:00,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:46:00,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:46:00,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:46:00,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:46:00,827 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:46:00,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:46:00,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:46:00,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:46:00,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:46:00,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:46:00,831 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:46:00,831 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:46:00,837 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:46:00,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:46:00,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:46:00,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:46:00,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:46:00,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:46:00,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:46:00,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:46:00,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:46:00,840 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:46:00,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:46:00,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:46:00,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:46:00,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:46:00,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:46:00,845 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:46:00,845 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:46:00,883 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:46:00,919 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 11:46:00,919 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 11:46:00,921 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:46:00,922 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 11:46:00,922 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:46:00,923 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 21 Supporting invariants [] [2018-11-10 11:46:00,945 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 11:46:00,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:00,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:46:00,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:00,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:46:00,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:46:00,998 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 11:46:00,999 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 4 states. [2018-11-10 11:46:01,031 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 4 states. Result 44 states and 52 transitions. Complement of second has 8 states. [2018-11-10 11:46:01,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 11:46:01,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 11:46:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-10 11:46:01,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 2 letters. Loop has 5 letters. [2018-11-10 11:46:01,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:46:01,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-10 11:46:01,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:46:01,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-10 11:46:01,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:46:01,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 52 transitions. [2018-11-10 11:46:01,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 11:46:01,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 17 states and 19 transitions. [2018-11-10 11:46:01,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-10 11:46:01,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-10 11:46:01,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2018-11-10 11:46:01,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:46:01,042 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-10 11:46:01,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2018-11-10 11:46:01,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-10 11:46:01,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-10 11:46:01,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-10 11:46:01,058 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-10 11:46:01,058 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-10 11:46:01,058 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 11:46:01,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2018-11-10 11:46:01,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 11:46:01,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:46:01,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:46:01,059 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:01,059 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 11:46:01,059 INFO L793 eck$LassoCheckResult]: Stem: 141#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 137#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 11;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 127#L19-4 assume true; 129#L19-1 assume !(main_~i~0 < 11); 132#L19-5 SUMMARY for call write~int(0, main_~#in~0.base, main_~#in~0.offset + 10, 1); srcloc: L19-5 139#L21 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; 140#L25 SUMMARY for call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0 * 1, 1); srcloc: L25 143#L25-1 main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 136#L26-3 [2018-11-10 11:46:01,059 INFO L795 eck$LassoCheckResult]: Loop: 136#L26-3 assume true; 142#L26-1 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 else (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := main_#t~post3 + 1;havoc main_#t~post3; 138#L31 SUMMARY for call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0 * 1, 1); srcloc: L31 135#L31-1 main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 136#L26-3 [2018-11-10 11:46:01,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:01,060 INFO L82 PathProgramCache]: Analyzing trace with hash 148225416, now seen corresponding path program 1 times [2018-11-10 11:46:01,060 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:01,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:01,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:01,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:01,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:01,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:46:01,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:46:01,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:46:01,088 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:46:01,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:01,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1729896, now seen corresponding path program 1 times [2018-11-10 11:46:01,089 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:01,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:01,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:01,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:01,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:01,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:46:01,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:46:01,251 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-10 11:46:01,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:01,269 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-10 11:46:01,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:46:01,270 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 25 transitions. [2018-11-10 11:46:01,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 11:46:01,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 23 states and 24 transitions. [2018-11-10 11:46:01,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 11:46:01,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-10 11:46:01,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2018-11-10 11:46:01,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:46:01,272 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-10 11:46:01,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2018-11-10 11:46:01,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2018-11-10 11:46:01,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-10 11:46:01,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-10 11:46:01,273 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-10 11:46:01,273 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-10 11:46:01,273 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 11:46:01,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2018-11-10 11:46:01,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 11:46:01,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:46:01,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:46:01,276 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:01,276 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 11:46:01,276 INFO L793 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 185#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 11;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 174#L19-4 assume true; 175#L19-1 assume !!(main_~i~0 < 11); 180#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 181#L20-1 havoc main_#t~nondet1; 178#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 176#L19-4 assume true; 177#L19-1 assume !(main_~i~0 < 11); 179#L19-5 SUMMARY for call write~int(0, main_~#in~0.base, main_~#in~0.offset + 10, 1); srcloc: L19-5 186#L21 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; 187#L25 SUMMARY for call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0 * 1, 1); srcloc: L25 190#L25-1 main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 183#L26-3 [2018-11-10 11:46:01,276 INFO L795 eck$LassoCheckResult]: Loop: 183#L26-3 assume true; 189#L26-1 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 else (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := main_#t~post3 + 1;havoc main_#t~post3; 184#L31 SUMMARY for call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0 * 1, 1); srcloc: L31 182#L31-1 main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 183#L26-3 [2018-11-10 11:46:01,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:01,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1269558635, now seen corresponding path program 1 times [2018-11-10 11:46:01,277 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:01,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:01,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:01,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:01,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:01,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:46:01,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:46:01,299 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_23d19910-f525-4576-9d76-0b66d10bfe83/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:46:01,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:01,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:46:01,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:46:01,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:46:01,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-10 11:46:01,349 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:46:01,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:01,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1729896, now seen corresponding path program 2 times [2018-11-10 11:46:01,350 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:01,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:01,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:01,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:01,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:01,557 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-10 11:46:01,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:46:01,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:46:01,558 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-11-10 11:46:01,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:01,574 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-10 11:46:01,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:46:01,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 30 transitions. [2018-11-10 11:46:01,576 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 11:46:01,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 29 transitions. [2018-11-10 11:46:01,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 11:46:01,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-10 11:46:01,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 29 transitions. [2018-11-10 11:46:01,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:46:01,577 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-10 11:46:01,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 29 transitions. [2018-11-10 11:46:01,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2018-11-10 11:46:01,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-10 11:46:01,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-10 11:46:01,579 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-10 11:46:01,579 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-10 11:46:01,579 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 11:46:01,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 23 transitions. [2018-11-10 11:46:01,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 11:46:01,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:46:01,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:46:01,580 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:01,581 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 11:46:01,581 INFO L793 eck$LassoCheckResult]: Stem: 280#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 277#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 11;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 264#L19-4 assume true; 265#L19-1 assume !!(main_~i~0 < 11); 285#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 284#L20-1 havoc main_#t~nondet1; 268#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 266#L19-4 assume true; 267#L19-1 assume !!(main_~i~0 < 11); 271#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 272#L20-1 havoc main_#t~nondet1; 273#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 283#L19-4 assume true; 269#L19-1 assume !(main_~i~0 < 11); 270#L19-5 SUMMARY for call write~int(0, main_~#in~0.base, main_~#in~0.offset + 10, 1); srcloc: L19-5 278#L21 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; 279#L25 SUMMARY for call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0 * 1, 1); srcloc: L25 282#L25-1 main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 275#L26-3 [2018-11-10 11:46:01,581 INFO L795 eck$LassoCheckResult]: Loop: 275#L26-3 assume true; 281#L26-1 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 else (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := main_#t~post3 + 1;havoc main_#t~post3; 276#L31 SUMMARY for call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0 * 1, 1); srcloc: L31 274#L31-1 main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 275#L26-3 [2018-11-10 11:46:01,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:01,581 INFO L82 PathProgramCache]: Analyzing trace with hash 364327784, now seen corresponding path program 2 times [2018-11-10 11:46:01,581 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:01,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:01,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:01,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:46:01,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:01,624 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:46:01,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:46:01,625 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_23d19910-f525-4576-9d76-0b66d10bfe83/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:46:01,630 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 11:46:01,640 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 11:46:01,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:46:01,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:46:01,650 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:46:01,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:46:01,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-10 11:46:01,666 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:46:01,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:01,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1729896, now seen corresponding path program 3 times [2018-11-10 11:46:01,667 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:01,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:01,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:01,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:46:01,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:01,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:46:01,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:46:01,782 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. cyclomatic complexity: 3 Second operand 6 states. [2018-11-10 11:46:01,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:01,807 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-10 11:46:01,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 11:46:01,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 35 transitions. [2018-11-10 11:46:01,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 11:46:01,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 34 transitions. [2018-11-10 11:46:01,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 11:46:01,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-10 11:46:01,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 34 transitions. [2018-11-10 11:46:01,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:46:01,810 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-10 11:46:01,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 34 transitions. [2018-11-10 11:46:01,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-11-10 11:46:01,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-10 11:46:01,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-10 11:46:01,812 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-10 11:46:01,813 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-10 11:46:01,813 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 11:46:01,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2018-11-10 11:46:01,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 11:46:01,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:46:01,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:46:01,814 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:01,814 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 11:46:01,814 INFO L793 eck$LassoCheckResult]: Stem: 396#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 392#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 11;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 380#L19-4 assume true; 381#L19-1 assume !!(main_~i~0 < 11); 406#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 405#L20-1 havoc main_#t~nondet1; 404#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 382#L19-4 assume true; 383#L19-1 assume !!(main_~i~0 < 11); 388#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 389#L20-1 havoc main_#t~nondet1; 384#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 385#L19-4 assume true; 400#L19-1 assume !!(main_~i~0 < 11); 403#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 402#L20-1 havoc main_#t~nondet1; 401#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 399#L19-4 assume true; 386#L19-1 assume !(main_~i~0 < 11); 387#L19-5 SUMMARY for call write~int(0, main_~#in~0.base, main_~#in~0.offset + 10, 1); srcloc: L19-5 394#L21 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; 395#L25 SUMMARY for call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0 * 1, 1); srcloc: L25 398#L25-1 main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 391#L26-3 [2018-11-10 11:46:01,814 INFO L795 eck$LassoCheckResult]: Loop: 391#L26-3 assume true; 397#L26-1 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 else (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := main_#t~post3 + 1;havoc main_#t~post3; 393#L31 SUMMARY for call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0 * 1, 1); srcloc: L31 390#L31-1 main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 391#L26-3 [2018-11-10 11:46:01,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:01,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1219044235, now seen corresponding path program 3 times [2018-11-10 11:46:01,815 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:01,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:01,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:01,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:46:01,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:01,854 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:46:01,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:46:01,854 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_23d19910-f525-4576-9d76-0b66d10bfe83/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:46:01,863 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 11:46:01,879 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 11:46:01,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:46:01,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:46:01,890 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:46:01,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:46:01,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-10 11:46:01,915 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:46:01,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:01,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1729896, now seen corresponding path program 4 times [2018-11-10 11:46:01,915 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:01,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:01,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:01,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:46:01,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:02,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 11:46:02,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 11:46:02,013 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. cyclomatic complexity: 3 Second operand 7 states. [2018-11-10 11:46:02,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:02,036 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-10 11:46:02,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:46:02,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 40 transitions. [2018-11-10 11:46:02,037 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 11:46:02,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 38 states and 39 transitions. [2018-11-10 11:46:02,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 11:46:02,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-10 11:46:02,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 39 transitions. [2018-11-10 11:46:02,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:46:02,038 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-11-10 11:46:02,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 39 transitions. [2018-11-10 11:46:02,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2018-11-10 11:46:02,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-10 11:46:02,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-11-10 11:46:02,040 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-11-10 11:46:02,040 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-11-10 11:46:02,040 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 11:46:02,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 33 transitions. [2018-11-10 11:46:02,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 11:46:02,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:46:02,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:46:02,042 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:02,042 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 11:46:02,042 INFO L793 eck$LassoCheckResult]: Stem: 538#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 535#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 11;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 522#L19-4 assume true; 523#L19-1 assume !!(main_~i~0 < 11); 553#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 552#L20-1 havoc main_#t~nondet1; 551#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 524#L19-4 assume true; 525#L19-1 assume !!(main_~i~0 < 11); 530#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 531#L20-1 havoc main_#t~nondet1; 526#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 527#L19-4 assume true; 550#L19-1 assume !!(main_~i~0 < 11); 549#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 548#L20-1 havoc main_#t~nondet1; 547#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 546#L19-4 assume true; 542#L19-1 assume !!(main_~i~0 < 11); 545#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 544#L20-1 havoc main_#t~nondet1; 543#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 541#L19-4 assume true; 528#L19-1 assume !(main_~i~0 < 11); 529#L19-5 SUMMARY for call write~int(0, main_~#in~0.base, main_~#in~0.offset + 10, 1); srcloc: L19-5 536#L21 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; 537#L25 SUMMARY for call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0 * 1, 1); srcloc: L25 540#L25-1 main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 533#L26-3 [2018-11-10 11:46:02,042 INFO L795 eck$LassoCheckResult]: Loop: 533#L26-3 assume true; 539#L26-1 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 else (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := main_#t~post3 + 1;havoc main_#t~post3; 534#L31 SUMMARY for call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0 * 1, 1); srcloc: L31 532#L31-1 main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 533#L26-3 [2018-11-10 11:46:02,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:02,042 INFO L82 PathProgramCache]: Analyzing trace with hash 187093320, now seen corresponding path program 4 times [2018-11-10 11:46:02,042 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:02,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:02,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:02,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:46:02,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:02,095 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:46:02,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:46:02,095 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_23d19910-f525-4576-9d76-0b66d10bfe83/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:46:02,109 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 11:46:02,123 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 11:46:02,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:46:02,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:46:02,137 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:46:02,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:46:02,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-10 11:46:02,153 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:46:02,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:02,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1729896, now seen corresponding path program 5 times [2018-11-10 11:46:02,154 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:02,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:02,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:02,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:46:02,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:02,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 11:46:02,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-10 11:46:02,247 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. cyclomatic complexity: 3 Second operand 8 states. [2018-11-10 11:46:02,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:02,268 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-11-10 11:46:02,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:46:02,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 45 transitions. [2018-11-10 11:46:02,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 11:46:02,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 43 states and 44 transitions. [2018-11-10 11:46:02,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 11:46:02,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-10 11:46:02,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 44 transitions. [2018-11-10 11:46:02,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:46:02,270 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-11-10 11:46:02,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 44 transitions. [2018-11-10 11:46:02,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2018-11-10 11:46:02,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-10 11:46:02,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-10 11:46:02,273 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-10 11:46:02,273 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-10 11:46:02,273 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 11:46:02,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 38 transitions. [2018-11-10 11:46:02,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 11:46:02,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:46:02,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:46:02,274 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:02,274 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 11:46:02,275 INFO L793 eck$LassoCheckResult]: Stem: 706#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 702#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 11;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 690#L19-4 assume true; 691#L19-1 assume !!(main_~i~0 < 11); 726#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 725#L20-1 havoc main_#t~nondet1; 724#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 692#L19-4 assume true; 693#L19-1 assume !!(main_~i~0 < 11); 698#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 699#L20-1 havoc main_#t~nondet1; 694#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 695#L19-4 assume true; 723#L19-1 assume !!(main_~i~0 < 11); 722#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 721#L20-1 havoc main_#t~nondet1; 720#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 719#L19-4 assume true; 718#L19-1 assume !!(main_~i~0 < 11); 717#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 716#L20-1 havoc main_#t~nondet1; 715#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 714#L19-4 assume true; 710#L19-1 assume !!(main_~i~0 < 11); 713#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 712#L20-1 havoc main_#t~nondet1; 711#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 709#L19-4 assume true; 696#L19-1 assume !(main_~i~0 < 11); 697#L19-5 SUMMARY for call write~int(0, main_~#in~0.base, main_~#in~0.offset + 10, 1); srcloc: L19-5 704#L21 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; 705#L25 SUMMARY for call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0 * 1, 1); srcloc: L25 708#L25-1 main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 701#L26-3 [2018-11-10 11:46:02,275 INFO L795 eck$LassoCheckResult]: Loop: 701#L26-3 assume true; 707#L26-1 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 else (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := main_#t~post3 + 1;havoc main_#t~post3; 703#L31 SUMMARY for call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0 * 1, 1); srcloc: L31 700#L31-1 main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 701#L26-3 [2018-11-10 11:46:02,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:02,275 INFO L82 PathProgramCache]: Analyzing trace with hash -944688725, now seen corresponding path program 5 times [2018-11-10 11:46:02,275 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:02,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:02,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:02,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:46:02,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:02,334 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:46:02,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:46:02,334 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_23d19910-f525-4576-9d76-0b66d10bfe83/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:46:02,342 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 11:46:02,369 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-10 11:46:02,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:46:02,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:46:02,380 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:46:02,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:46:02,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-10 11:46:02,406 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:46:02,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:02,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1729896, now seen corresponding path program 6 times [2018-11-10 11:46:02,407 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:02,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:02,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:02,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:46:02,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:02,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 11:46:02,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:46:02,512 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. cyclomatic complexity: 3 Second operand 9 states. [2018-11-10 11:46:02,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:02,547 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-10 11:46:02,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 11:46:02,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 50 transitions. [2018-11-10 11:46:02,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 11:46:02,549 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 48 states and 49 transitions. [2018-11-10 11:46:02,549 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 11:46:02,549 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-10 11:46:02,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 49 transitions. [2018-11-10 11:46:02,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:46:02,549 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-11-10 11:46:02,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 49 transitions. [2018-11-10 11:46:02,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2018-11-10 11:46:02,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-10 11:46:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-11-10 11:46:02,551 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-10 11:46:02,551 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-10 11:46:02,551 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 11:46:02,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 43 transitions. [2018-11-10 11:46:02,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 11:46:02,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:46:02,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:46:02,554 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:02,554 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 11:46:02,554 INFO L793 eck$LassoCheckResult]: Stem: 900#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 896#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 11;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 884#L19-4 assume true; 885#L19-1 assume !!(main_~i~0 < 11); 925#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 924#L20-1 havoc main_#t~nondet1; 923#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 886#L19-4 assume true; 887#L19-1 assume !!(main_~i~0 < 11); 892#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 893#L20-1 havoc main_#t~nondet1; 888#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 889#L19-4 assume true; 922#L19-1 assume !!(main_~i~0 < 11); 921#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 920#L20-1 havoc main_#t~nondet1; 919#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 918#L19-4 assume true; 917#L19-1 assume !!(main_~i~0 < 11); 916#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 915#L20-1 havoc main_#t~nondet1; 914#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 913#L19-4 assume true; 912#L19-1 assume !!(main_~i~0 < 11); 911#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 910#L20-1 havoc main_#t~nondet1; 909#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 908#L19-4 assume true; 904#L19-1 assume !!(main_~i~0 < 11); 907#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 906#L20-1 havoc main_#t~nondet1; 905#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 903#L19-4 assume true; 890#L19-1 assume !(main_~i~0 < 11); 891#L19-5 SUMMARY for call write~int(0, main_~#in~0.base, main_~#in~0.offset + 10, 1); srcloc: L19-5 898#L21 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; 899#L25 SUMMARY for call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0 * 1, 1); srcloc: L25 902#L25-1 main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 895#L26-3 [2018-11-10 11:46:02,554 INFO L795 eck$LassoCheckResult]: Loop: 895#L26-3 assume true; 901#L26-1 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 else (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := main_#t~post3 + 1;havoc main_#t~post3; 897#L31 SUMMARY for call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0 * 1, 1); srcloc: L31 894#L31-1 main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 895#L26-3 [2018-11-10 11:46:02,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:02,554 INFO L82 PathProgramCache]: Analyzing trace with hash -879585496, now seen corresponding path program 6 times [2018-11-10 11:46:02,554 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:02,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:02,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:02,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:46:02,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:02,632 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:46:02,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:46:02,632 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_23d19910-f525-4576-9d76-0b66d10bfe83/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:46:02,641 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 11:46:02,668 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-10 11:46:02,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:46:02,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:46:02,677 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:46:02,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:46:02,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-10 11:46:02,693 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:46:02,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:02,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1729896, now seen corresponding path program 7 times [2018-11-10 11:46:02,693 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:02,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:02,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:02,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:46:02,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:02,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 11:46:02,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-10 11:46:02,771 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. cyclomatic complexity: 3 Second operand 10 states. [2018-11-10 11:46:02,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:02,803 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-11-10 11:46:02,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 11:46:02,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 55 transitions. [2018-11-10 11:46:02,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 11:46:02,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 53 states and 54 transitions. [2018-11-10 11:46:02,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 11:46:02,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-10 11:46:02,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 54 transitions. [2018-11-10 11:46:02,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:46:02,805 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-11-10 11:46:02,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 54 transitions. [2018-11-10 11:46:02,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2018-11-10 11:46:02,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-10 11:46:02,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-11-10 11:46:02,807 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-11-10 11:46:02,807 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-11-10 11:46:02,807 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 11:46:02,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 48 transitions. [2018-11-10 11:46:02,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 11:46:02,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:46:02,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:46:02,809 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:02,809 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 11:46:02,809 INFO L793 eck$LassoCheckResult]: Stem: 1120#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1116#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 11;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 1104#L19-4 assume true; 1105#L19-1 assume !!(main_~i~0 < 11); 1150#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1149#L20-1 havoc main_#t~nondet1; 1148#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1106#L19-4 assume true; 1107#L19-1 assume !!(main_~i~0 < 11); 1112#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1113#L20-1 havoc main_#t~nondet1; 1108#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1109#L19-4 assume true; 1147#L19-1 assume !!(main_~i~0 < 11); 1146#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1145#L20-1 havoc main_#t~nondet1; 1144#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1143#L19-4 assume true; 1142#L19-1 assume !!(main_~i~0 < 11); 1141#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1140#L20-1 havoc main_#t~nondet1; 1139#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1138#L19-4 assume true; 1137#L19-1 assume !!(main_~i~0 < 11); 1136#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1135#L20-1 havoc main_#t~nondet1; 1134#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1133#L19-4 assume true; 1132#L19-1 assume !!(main_~i~0 < 11); 1131#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1130#L20-1 havoc main_#t~nondet1; 1129#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1128#L19-4 assume true; 1124#L19-1 assume !!(main_~i~0 < 11); 1127#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1126#L20-1 havoc main_#t~nondet1; 1125#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1123#L19-4 assume true; 1110#L19-1 assume !(main_~i~0 < 11); 1111#L19-5 SUMMARY for call write~int(0, main_~#in~0.base, main_~#in~0.offset + 10, 1); srcloc: L19-5 1118#L21 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; 1119#L25 SUMMARY for call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0 * 1, 1); srcloc: L25 1122#L25-1 main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 1115#L26-3 [2018-11-10 11:46:02,809 INFO L795 eck$LassoCheckResult]: Loop: 1115#L26-3 assume true; 1121#L26-1 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 else (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := main_#t~post3 + 1;havoc main_#t~post3; 1117#L31 SUMMARY for call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0 * 1, 1); srcloc: L31 1114#L31-1 main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 1115#L26-3 [2018-11-10 11:46:02,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:02,809 INFO L82 PathProgramCache]: Analyzing trace with hash 991303627, now seen corresponding path program 7 times [2018-11-10 11:46:02,809 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:02,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:02,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:02,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:02,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:02,866 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:46:02,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:46:02,866 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_23d19910-f525-4576-9d76-0b66d10bfe83/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:46:02,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:02,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:46:02,891 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:46:02,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:46:02,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-10 11:46:02,907 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:46:02,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:02,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1729896, now seen corresponding path program 8 times [2018-11-10 11:46:02,907 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:02,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:02,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:02,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:46:02,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:02,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 11:46:02,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-10 11:46:02,990 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. cyclomatic complexity: 3 Second operand 11 states. [2018-11-10 11:46:03,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:03,025 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-11-10 11:46:03,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 11:46:03,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 60 transitions. [2018-11-10 11:46:03,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 11:46:03,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 58 states and 59 transitions. [2018-11-10 11:46:03,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 11:46:03,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-10 11:46:03,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 59 transitions. [2018-11-10 11:46:03,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:46:03,026 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-11-10 11:46:03,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 59 transitions. [2018-11-10 11:46:03,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2018-11-10 11:46:03,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-10 11:46:03,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-11-10 11:46:03,029 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-11-10 11:46:03,029 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-11-10 11:46:03,029 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 11:46:03,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 53 transitions. [2018-11-10 11:46:03,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 11:46:03,030 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:46:03,030 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:46:03,030 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:03,030 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 11:46:03,031 INFO L793 eck$LassoCheckResult]: Stem: 1366#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1362#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 11;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 1350#L19-4 assume true; 1351#L19-1 assume !!(main_~i~0 < 11); 1401#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1400#L20-1 havoc main_#t~nondet1; 1399#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1352#L19-4 assume true; 1353#L19-1 assume !!(main_~i~0 < 11); 1358#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1359#L20-1 havoc main_#t~nondet1; 1354#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1355#L19-4 assume true; 1398#L19-1 assume !!(main_~i~0 < 11); 1397#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1396#L20-1 havoc main_#t~nondet1; 1395#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1394#L19-4 assume true; 1393#L19-1 assume !!(main_~i~0 < 11); 1392#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1391#L20-1 havoc main_#t~nondet1; 1390#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1389#L19-4 assume true; 1388#L19-1 assume !!(main_~i~0 < 11); 1387#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1386#L20-1 havoc main_#t~nondet1; 1385#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1384#L19-4 assume true; 1383#L19-1 assume !!(main_~i~0 < 11); 1382#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1381#L20-1 havoc main_#t~nondet1; 1380#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1379#L19-4 assume true; 1378#L19-1 assume !!(main_~i~0 < 11); 1377#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1376#L20-1 havoc main_#t~nondet1; 1375#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1374#L19-4 assume true; 1370#L19-1 assume !!(main_~i~0 < 11); 1373#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1372#L20-1 havoc main_#t~nondet1; 1371#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1369#L19-4 assume true; 1356#L19-1 assume !(main_~i~0 < 11); 1357#L19-5 SUMMARY for call write~int(0, main_~#in~0.base, main_~#in~0.offset + 10, 1); srcloc: L19-5 1364#L21 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; 1365#L25 SUMMARY for call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0 * 1, 1); srcloc: L25 1368#L25-1 main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 1361#L26-3 [2018-11-10 11:46:03,031 INFO L795 eck$LassoCheckResult]: Loop: 1361#L26-3 assume true; 1367#L26-1 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 else (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := main_#t~post3 + 1;havoc main_#t~post3; 1363#L31 SUMMARY for call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0 * 1, 1); srcloc: L31 1360#L31-1 main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 1361#L26-3 [2018-11-10 11:46:03,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:03,031 INFO L82 PathProgramCache]: Analyzing trace with hash -2014804728, now seen corresponding path program 8 times [2018-11-10 11:46:03,031 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:03,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:03,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:03,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:46:03,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:03,100 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:46:03,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:46:03,101 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_23d19910-f525-4576-9d76-0b66d10bfe83/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:46:03,106 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 11:46:03,119 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 11:46:03,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:46:03,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:46:03,133 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:46:03,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:46:03,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-10 11:46:03,149 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:46:03,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:03,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1729896, now seen corresponding path program 9 times [2018-11-10 11:46:03,149 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:03,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:03,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:03,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:46:03,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:03,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 11:46:03,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-10 11:46:03,239 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. cyclomatic complexity: 3 Second operand 12 states. [2018-11-10 11:46:03,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:03,277 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-11-10 11:46:03,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 11:46:03,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 65 transitions. [2018-11-10 11:46:03,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 11:46:03,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 63 states and 64 transitions. [2018-11-10 11:46:03,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 11:46:03,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-10 11:46:03,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 64 transitions. [2018-11-10 11:46:03,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:46:03,278 INFO L705 BuchiCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-11-10 11:46:03,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 64 transitions. [2018-11-10 11:46:03,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2018-11-10 11:46:03,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-10 11:46:03,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-11-10 11:46:03,281 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-10 11:46:03,281 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-10 11:46:03,281 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 11:46:03,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 58 transitions. [2018-11-10 11:46:03,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 11:46:03,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:46:03,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:46:03,282 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:03,282 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 11:46:03,282 INFO L793 eck$LassoCheckResult]: Stem: 1638#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1634#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 11;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 1622#L19-4 assume true; 1623#L19-1 assume !!(main_~i~0 < 11); 1678#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1677#L20-1 havoc main_#t~nondet1; 1676#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1624#L19-4 assume true; 1625#L19-1 assume !!(main_~i~0 < 11); 1630#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1631#L20-1 havoc main_#t~nondet1; 1626#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1627#L19-4 assume true; 1675#L19-1 assume !!(main_~i~0 < 11); 1674#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1673#L20-1 havoc main_#t~nondet1; 1672#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1671#L19-4 assume true; 1670#L19-1 assume !!(main_~i~0 < 11); 1669#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1668#L20-1 havoc main_#t~nondet1; 1667#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1666#L19-4 assume true; 1665#L19-1 assume !!(main_~i~0 < 11); 1664#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1663#L20-1 havoc main_#t~nondet1; 1662#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1661#L19-4 assume true; 1660#L19-1 assume !!(main_~i~0 < 11); 1659#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1658#L20-1 havoc main_#t~nondet1; 1657#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1656#L19-4 assume true; 1655#L19-1 assume !!(main_~i~0 < 11); 1654#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1653#L20-1 havoc main_#t~nondet1; 1652#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1651#L19-4 assume true; 1650#L19-1 assume !!(main_~i~0 < 11); 1649#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1648#L20-1 havoc main_#t~nondet1; 1647#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1646#L19-4 assume true; 1642#L19-1 assume !!(main_~i~0 < 11); 1645#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1644#L20-1 havoc main_#t~nondet1; 1643#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1641#L19-4 assume true; 1628#L19-1 assume !(main_~i~0 < 11); 1629#L19-5 SUMMARY for call write~int(0, main_~#in~0.base, main_~#in~0.offset + 10, 1); srcloc: L19-5 1636#L21 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; 1637#L25 SUMMARY for call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0 * 1, 1); srcloc: L25 1640#L25-1 main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 1633#L26-3 [2018-11-10 11:46:03,282 INFO L795 eck$LassoCheckResult]: Loop: 1633#L26-3 assume true; 1639#L26-1 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 else (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := main_#t~post3 + 1;havoc main_#t~post3; 1635#L31 SUMMARY for call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0 * 1, 1); srcloc: L31 1632#L31-1 main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 1633#L26-3 [2018-11-10 11:46:03,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:03,283 INFO L82 PathProgramCache]: Analyzing trace with hash -693512725, now seen corresponding path program 9 times [2018-11-10 11:46:03,283 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:03,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:03,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:03,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:46:03,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:03,384 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:46:03,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:46:03,384 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_23d19910-f525-4576-9d76-0b66d10bfe83/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:46:03,399 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 11:46:03,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-10 11:46:03,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:46:03,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:46:03,472 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:46:03,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:46:03,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-10 11:46:03,499 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:46:03,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:03,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1729896, now seen corresponding path program 10 times [2018-11-10 11:46:03,499 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:03,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:03,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:03,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:46:03,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:03,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 11:46:03,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 11:46:03,629 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. cyclomatic complexity: 3 Second operand 13 states. [2018-11-10 11:46:03,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:03,679 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2018-11-10 11:46:03,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 11:46:03,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 74 transitions. [2018-11-10 11:46:03,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 11:46:03,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 72 states and 73 transitions. [2018-11-10 11:46:03,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-10 11:46:03,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-10 11:46:03,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 73 transitions. [2018-11-10 11:46:03,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:46:03,681 INFO L705 BuchiCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-11-10 11:46:03,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 73 transitions. [2018-11-10 11:46:03,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2018-11-10 11:46:03,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-10 11:46:03,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2018-11-10 11:46:03,682 INFO L728 BuchiCegarLoop]: Abstraction has 62 states and 63 transitions. [2018-11-10 11:46:03,683 INFO L608 BuchiCegarLoop]: Abstraction has 62 states and 63 transitions. [2018-11-10 11:46:03,683 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 11:46:03,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 63 transitions. [2018-11-10 11:46:03,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 11:46:03,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:46:03,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:46:03,683 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:03,683 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 11:46:03,683 INFO L793 eck$LassoCheckResult]: Stem: 1941#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1938#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 11;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 1924#L19-4 assume true; 1925#L19-1 assume !!(main_~i~0 < 11); 1932#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1933#L20-1 havoc main_#t~nondet1; 1934#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1926#L19-4 assume true; 1927#L19-1 assume !!(main_~i~0 < 11); 1985#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1984#L20-1 havoc main_#t~nondet1; 1928#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1929#L19-4 assume true; 1983#L19-1 assume !!(main_~i~0 < 11); 1982#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1981#L20-1 havoc main_#t~nondet1; 1980#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1979#L19-4 assume true; 1978#L19-1 assume !!(main_~i~0 < 11); 1977#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1976#L20-1 havoc main_#t~nondet1; 1975#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1974#L19-4 assume true; 1973#L19-1 assume !!(main_~i~0 < 11); 1972#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1971#L20-1 havoc main_#t~nondet1; 1970#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1969#L19-4 assume true; 1968#L19-1 assume !!(main_~i~0 < 11); 1967#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1966#L20-1 havoc main_#t~nondet1; 1965#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1964#L19-4 assume true; 1963#L19-1 assume !!(main_~i~0 < 11); 1962#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1961#L20-1 havoc main_#t~nondet1; 1960#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1959#L19-4 assume true; 1958#L19-1 assume !!(main_~i~0 < 11); 1957#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1956#L20-1 havoc main_#t~nondet1; 1955#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1954#L19-4 assume true; 1953#L19-1 assume !!(main_~i~0 < 11); 1952#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1951#L20-1 havoc main_#t~nondet1; 1950#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1949#L19-4 assume true; 1945#L19-1 assume !!(main_~i~0 < 11); 1948#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 1947#L20-1 havoc main_#t~nondet1; 1946#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 1944#L19-4 assume true; 1930#L19-1 assume !(main_~i~0 < 11); 1931#L19-5 SUMMARY for call write~int(0, main_~#in~0.base, main_~#in~0.offset + 10, 1); srcloc: L19-5 1939#L21 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; 1940#L25 SUMMARY for call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0 * 1, 1); srcloc: L25 1943#L25-1 main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 1936#L26-3 [2018-11-10 11:46:03,684 INFO L795 eck$LassoCheckResult]: Loop: 1936#L26-3 assume true; 1942#L26-1 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 else (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := main_#t~post3 + 1;havoc main_#t~post3; 1937#L31 SUMMARY for call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0 * 1, 1); srcloc: L31 1935#L31-1 main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 1936#L26-3 [2018-11-10 11:46:03,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:03,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1617519896, now seen corresponding path program 10 times [2018-11-10 11:46:03,684 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:03,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:03,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:03,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:46:03,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:03,768 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:46:03,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:46:03,768 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_23d19910-f525-4576-9d76-0b66d10bfe83/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:46:03,774 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 11:46:03,798 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 11:46:03,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:46:03,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:46:03,817 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:46:03,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:46:03,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-10 11:46:03,835 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:46:03,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:03,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1729896, now seen corresponding path program 11 times [2018-11-10 11:46:03,836 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:03,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:03,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:03,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:46:03,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:03,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 11:46:03,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-10 11:46:03,923 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. cyclomatic complexity: 3 Second operand 14 states. [2018-11-10 11:46:03,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:46:03,998 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2018-11-10 11:46:03,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 11:46:03,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 76 transitions. [2018-11-10 11:46:03,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 11:46:03,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 74 states and 75 transitions. [2018-11-10 11:46:03,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-10 11:46:03,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-10 11:46:03,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 75 transitions. [2018-11-10 11:46:04,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:46:04,000 INFO L705 BuchiCegarLoop]: Abstraction has 74 states and 75 transitions. [2018-11-10 11:46:04,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 75 transitions. [2018-11-10 11:46:04,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2018-11-10 11:46:04,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-10 11:46:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-11-10 11:46:04,002 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-11-10 11:46:04,002 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-11-10 11:46:04,003 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 11:46:04,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 68 transitions. [2018-11-10 11:46:04,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 11:46:04,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:46:04,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:46:04,004 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:46:04,004 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 11:46:04,004 INFO L793 eck$LassoCheckResult]: Stem: 2266#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2263#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 11;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;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; 2249#L19-4 assume true; 2250#L19-1 assume !!(main_~i~0 < 11); 2256#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 2257#L20-1 havoc main_#t~nondet1; 2253#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 2251#L19-4 assume true; 2252#L19-1 assume !!(main_~i~0 < 11); 2260#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 2261#L20-1 havoc main_#t~nondet1; 2315#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 2314#L19-4 assume true; 2313#L19-1 assume !!(main_~i~0 < 11); 2312#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 2311#L20-1 havoc main_#t~nondet1; 2310#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 2309#L19-4 assume true; 2308#L19-1 assume !!(main_~i~0 < 11); 2307#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 2306#L20-1 havoc main_#t~nondet1; 2305#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 2304#L19-4 assume true; 2303#L19-1 assume !!(main_~i~0 < 11); 2302#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 2301#L20-1 havoc main_#t~nondet1; 2300#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 2299#L19-4 assume true; 2298#L19-1 assume !!(main_~i~0 < 11); 2297#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 2296#L20-1 havoc main_#t~nondet1; 2295#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 2294#L19-4 assume true; 2293#L19-1 assume !!(main_~i~0 < 11); 2292#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 2291#L20-1 havoc main_#t~nondet1; 2290#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 2289#L19-4 assume true; 2288#L19-1 assume !!(main_~i~0 < 11); 2287#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 2286#L20-1 havoc main_#t~nondet1; 2285#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 2284#L19-4 assume true; 2283#L19-1 assume !!(main_~i~0 < 11); 2282#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 2281#L20-1 havoc main_#t~nondet1; 2280#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 2279#L19-4 assume true; 2278#L19-1 assume !!(main_~i~0 < 11); 2277#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 2276#L20-1 havoc main_#t~nondet1; 2275#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 2274#L19-4 assume true; 2270#L19-1 assume !!(main_~i~0 < 11); 2273#L20 SUMMARY for call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0 * 1, 1); srcloc: L20 2272#L20-1 havoc main_#t~nondet1; 2271#L19-3 main_#t~post0 := main_~i~0;main_~i~0 := main_#t~post0 + 1;havoc main_#t~post0; 2269#L19-4 assume true; 2254#L19-1 assume !(main_~i~0 < 11); 2255#L19-5 SUMMARY for call write~int(0, main_~#in~0.base, main_~#in~0.offset + 10, 1); srcloc: L19-5 2264#L21 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; 2265#L25 SUMMARY for call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0 * 1, 1); srcloc: L25 2268#L25-1 main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 2259#L26-3 [2018-11-10 11:46:04,004 INFO L795 eck$LassoCheckResult]: Loop: 2259#L26-3 assume true; 2267#L26-1 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 else (main_~i~0 * 10 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := main_#t~post3 + 1;havoc main_#t~post3; 2262#L31 SUMMARY for call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0 * 1, 1); srcloc: L31 2258#L31-1 main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 2259#L26-3 [2018-11-10 11:46:04,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:04,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1346474997, now seen corresponding path program 11 times [2018-11-10 11:46:04,005 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:04,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:04,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:04,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:46:04,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:04,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:04,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1729896, now seen corresponding path program 12 times [2018-11-10 11:46:04,030 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:04,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:04,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:04,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:46:04,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:04,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:04,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1823490958, now seen corresponding path program 1 times [2018-11-10 11:46:04,036 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:46:04,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:46:04,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:04,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:46:04,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:46:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:46:13,117 WARN L179 SmtUtils]: Spent 8.96 s on a formula simplification. DAG size of input: 226 DAG size of output: 174 [2018-11-10 11:46:13,236 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-11-10 11:46:13,238 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:46:13,238 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:46:13,238 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:46:13,238 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:46:13,238 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:46:13,238 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:46:13,238 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:46:13,238 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:46:13,238 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i_Iteration13_Lasso [2018-11-10 11:46:13,239 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:46:13,239 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:46:13,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:46:13,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:46:13,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:46:13,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:46:13,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:46:13,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:46:13,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:46:13,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:46:13,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:46:13,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:46:13,694 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2018-11-10 11:46:13,700 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:46:13,700 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:46:13,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:46:13,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:46:13,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:46:13,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:46:13,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:46:13,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:46:13,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:46:13,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:46:13,702 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:46:13,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:46:13,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:46:13,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:46:13,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:46:13,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:46:13,705 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:46:13,705 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:46:13,706 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:46:13,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:46:13,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:46:13,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:46:13,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:46:13,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:46:13,708 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:46:13,708 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:46:13,709 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:46:13,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:46:13,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:46:13,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:46:13,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:46:13,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:46:13,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:46:13,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:46:13,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:46:13,710 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:46:13,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:46:13,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:46:13,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:46:13,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:46:13,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:46:13,712 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:46:13,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:46:13,713 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:46:13,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:46:13,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:46:13,714 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 11:46:13,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:46:13,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:46:13,715 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:46:13,716 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:46:13,719 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:46:13,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:46:13,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:46:13,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:46:13,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:46:13,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:46:13,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:46:13,721 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:46:13,722 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:46:13,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:46:13,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:46:13,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:46:13,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:46:13,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:46:13,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:46:13,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:46:13,727 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:46:13,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:46:13,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:46:13,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:46:13,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:46:13,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:46:13,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:46:13,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:46:13,730 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:46:13,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:46:13,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:46:13,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:46:13,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:46:13,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:46:13,733 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:46:13,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:46:13,745 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:46:13,756 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-10 11:46:13,756 INFO L444 ModelExtractionUtils]: 12 out of 22 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-10 11:46:13,756 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:46:13,757 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 11:46:13,757 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:46:13,757 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#in~0.offset, ULTIMATE.start_main_~idx_in~0, v_rep(select #length ULTIMATE.start_main_~#in~0.base)_2) = -1*ULTIMATE.start_main_~#in~0.offset - 1*ULTIMATE.start_main_~idx_in~0 + 1*v_rep(select #length ULTIMATE.start_main_~#in~0.base)_2 Supporting invariants [] [2018-11-10 11:46:13,781 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 11:46:13,783 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 11:46:13,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:46:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:13,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:46:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:46:13,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:46:13,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:46:13,886 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 11:46:13,886 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 68 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-11-10 11:46:13,897 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 68 transitions. cyclomatic complexity: 3. Second operand 5 states. Result 72 states and 74 transitions. Complement of second has 6 states. [2018-11-10 11:46:13,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 11:46:13,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 11:46:13,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-10 11:46:13,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 63 letters. Loop has 4 letters. [2018-11-10 11:46:13,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:46:13,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 67 letters. Loop has 4 letters. [2018-11-10 11:46:13,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:46:13,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 63 letters. Loop has 8 letters. [2018-11-10 11:46:13,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:46:13,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 74 transitions. [2018-11-10 11:46:13,899 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:46:13,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 0 states and 0 transitions. [2018-11-10 11:46:13,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 11:46:13,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 11:46:13,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 11:46:13,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:46:13,900 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:46:13,900 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:46:13,900 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:46:13,900 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 11:46:13,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 11:46:13,900 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:46:13,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 11:46:13,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 11:46:13 BoogieIcfgContainer [2018-11-10 11:46:13,904 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 11:46:13,904 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:46:13,904 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:46:13,905 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:46:13,905 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:46:00" (3/4) ... [2018-11-10 11:46:13,907 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 11:46:13,907 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:46:13,908 INFO L168 Benchmark]: Toolchain (without parser) took 14271.05 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.0 MB). Free memory was 961.9 MB in the beginning and 1.1 GB in the end (delta: -93.4 MB). Peak memory consumption was 220.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:46:13,908 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:46:13,909 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.39 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:46:13,909 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.46 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 11:46:13,909 INFO L168 Benchmark]: Boogie Preprocessor took 19.88 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:46:13,909 INFO L168 Benchmark]: RCFGBuilder took 255.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -174.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-11-10 11:46:13,910 INFO L168 Benchmark]: BuchiAutomizer took 13804.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 64.5 MB). Peak memory consumption was 234.9 MB. Max. memory is 11.5 GB. [2018-11-10 11:46:13,910 INFO L168 Benchmark]: Witness Printer took 3.14 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:46:13,912 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 154.39 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.46 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.88 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 255.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -174.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13804.24 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 64.5 MB). Peak memory consumption was 234.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.14 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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 + -1 * idx_in + unknown-#length-unknown[in] and consists of 4 locations. 11 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.7s and 14 iterations. TraceHistogramMax:12. Analysis of lassos took 13.0s. Construction of modules took 0.2s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 12. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 71 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 67 states and ocurred in iteration 12. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 152 SDtfs, 283 SDslu, 448 SDs, 0 SdLazy, 385 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU11 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital194 mio100 ax100 hnf99 lsp93 ukn78 mio100 lsp45 div144 bol100 ite100 ukn100 eq167 hnf72 smp97 dnf202 smp75 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...