./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.cil.c --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_93174c7f-cae9-4e99-b358-738fd41e74f6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/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 253410f53553d69ef02e4dba1b07bb26de7bec75 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:49:26,191 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:49:26,193 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:49:26,200 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:49:26,200 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:49:26,201 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:49:26,202 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:49:26,203 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:49:26,204 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:49:26,204 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:49:26,205 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:49:26,205 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:49:26,205 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:49:26,206 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:49:26,207 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:49:26,207 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:49:26,208 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:49:26,209 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:49:26,210 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:49:26,211 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:49:26,212 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:49:26,213 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:49:26,214 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:49:26,215 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:49:26,215 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:49:26,215 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:49:26,216 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:49:26,217 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:49:26,217 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:49:26,218 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:49:26,218 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:49:26,219 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:49:26,219 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:49:26,219 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:49:26,219 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:49:26,220 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:49:26,220 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 12:49:26,231 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:49:26,231 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:49:26,232 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:49:26,232 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:49:26,232 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:49:26,233 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 12:49:26,233 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 12:49:26,233 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 12:49:26,233 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 12:49:26,233 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 12:49:26,233 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 12:49:26,233 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:49:26,233 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:49:26,234 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:49:26,234 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:49:26,234 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:49:26,234 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:49:26,234 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 12:49:26,234 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 12:49:26,234 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 12:49:26,234 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:49:26,235 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:49:26,235 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 12:49:26,235 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 12:49:26,235 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:49:26,235 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:49:26,235 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 12:49:26,235 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:49:26,235 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:49:26,235 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 12:49:26,236 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 12:49:26,236 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_93174c7f-cae9-4e99-b358-738fd41e74f6/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 -> 253410f53553d69ef02e4dba1b07bb26de7bec75 [2018-11-10 12:49:26,259 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:49:26,267 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:49:26,268 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:49:26,269 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:49:26,270 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:49:26,270 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/bin-2019/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.cil.c [2018-11-10 12:49:26,306 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/bin-2019/uautomizer/data/c30235338/7dad6ecf018d4363a05a08591e8a5fcc/FLAG091934053 [2018-11-10 12:49:26,720 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:49:26,721 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/sv-benchmarks/c/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.cil.c [2018-11-10 12:49:26,727 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/bin-2019/uautomizer/data/c30235338/7dad6ecf018d4363a05a08591e8a5fcc/FLAG091934053 [2018-11-10 12:49:26,738 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/bin-2019/uautomizer/data/c30235338/7dad6ecf018d4363a05a08591e8a5fcc [2018-11-10 12:49:26,740 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:49:26,741 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:49:26,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:49:26,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:49:26,745 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:49:26,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:49:26" (1/1) ... [2018-11-10 12:49:26,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7106f25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:26, skipping insertion in model container [2018-11-10 12:49:26,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:49:26" (1/1) ... [2018-11-10 12:49:26,756 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:49:26,777 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:49:26,881 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:49:26,883 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:49:26,899 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:49:26,906 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:49:26,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:26 WrapperNode [2018-11-10 12:49:26,907 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:49:26,907 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:49:26,908 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:49:26,908 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:49:26,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:26" (1/1) ... [2018-11-10 12:49:26,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:26" (1/1) ... [2018-11-10 12:49:26,928 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:49:26,929 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:49:26,929 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:49:26,929 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:49:26,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:26" (1/1) ... [2018-11-10 12:49:26,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:26" (1/1) ... [2018-11-10 12:49:26,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:26" (1/1) ... [2018-11-10 12:49:26,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:26" (1/1) ... [2018-11-10 12:49:26,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:26" (1/1) ... [2018-11-10 12:49:26,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:26" (1/1) ... [2018-11-10 12:49:26,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:26" (1/1) ... [2018-11-10 12:49:26,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:49:26,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:49:26,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:49:26,941 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:49:26,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/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 12:49:27,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:49:27,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:49:27,184 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:49:27,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:49:27 BoogieIcfgContainer [2018-11-10 12:49:27,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:49:27,185 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 12:49:27,185 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 12:49:27,188 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 12:49:27,188 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:49:27,189 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:49:26" (1/3) ... [2018-11-10 12:49:27,189 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ba7b59b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:49:27, skipping insertion in model container [2018-11-10 12:49:27,189 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:49:27,189 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:26" (2/3) ... [2018-11-10 12:49:27,190 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ba7b59b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:49:27, skipping insertion in model container [2018-11-10 12:49:27,190 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:49:27,190 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:49:27" (3/3) ... [2018-11-10 12:49:27,191 INFO L375 chiAutomizerObserver]: Analyzing ICFG s3_srvr_1a_true-unreach-call_false-termination.cil.c [2018-11-10 12:49:27,241 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:49:27,241 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 12:49:27,241 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 12:49:27,242 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 12:49:27,242 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:49:27,242 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:49:27,242 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 12:49:27,242 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:49:27,242 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 12:49:27,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. [2018-11-10 12:49:27,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2018-11-10 12:49:27,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:49:27,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:49:27,273 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:49:27,273 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 12:49:27,273 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 12:49:27,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. [2018-11-10 12:49:27,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2018-11-10 12:49:27,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:49:27,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:49:27,276 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:49:27,276 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 12:49:27,280 INFO L793 eck$LassoCheckResult]: Stem: 37#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 6#L177true [2018-11-10 12:49:27,281 INFO L795 eck$LassoCheckResult]: Loop: 6#L177true assume true; 16#L23-1true assume !false; 43#L24true assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 30#L30true assume main_~s__state~0 == 8466; 32#L31true assume main_~blastFlag~0 == 0;main_~blastFlag~0 := 1; 45#L79-1true main_~s__state~0 := 8496; 6#L177true [2018-11-10 12:49:27,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:27,284 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 12:49:27,285 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:27,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:27,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:27,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:27,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:27,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:27,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1070889102, now seen corresponding path program 1 times [2018-11-10 12:49:27,350 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:27,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:27,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:27,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:27,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:27,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:27,359 INFO L82 PathProgramCache]: Analyzing trace with hash 150938320, now seen corresponding path program 1 times [2018-11-10 12:49:27,359 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:27,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:27,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:27,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:27,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:27,420 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:49:27,421 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:49:27,421 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:49:27,421 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:49:27,422 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:49:27,422 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:27,422 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:49:27,422 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:49:27,422 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration1_Loop [2018-11-10 12:49:27,422 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:49:27,423 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:49:27,440 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 12:49:27,454 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 12:49:27,531 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:49:27,531 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/bin-2019/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:27,535 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:49:27,535 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/bin-2019/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:27,559 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:49:27,559 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:49:27,563 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:49:27,585 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:49:27,585 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:49:27,585 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:49:27,585 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:49:27,585 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:49:27,586 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:27,586 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:49:27,586 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:49:27,586 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration1_Loop [2018-11-10 12:49:27,586 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:49:27,586 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:49:27,586 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 12:49:27,590 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 12:49:27,622 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:49:27,627 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:49:27,628 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 12:49:27,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:27,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:27,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:27,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:27,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:27,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:27,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:27,639 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:49:27,644 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:49:27,645 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 12:49:27,646 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:49:27,646 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:49:27,647 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:49:27,647 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~blastFlag~0) = -2*ULTIMATE.start_main_~blastFlag~0 + 1 Supporting invariants [] [2018-11-10 12:49:27,648 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:49:27,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:27,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:49:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:27,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:49:27,707 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 12:49:27,720 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 12:49:27,721 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states. Second operand 4 states. [2018-11-10 12:49:27,790 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states.. Second operand 4 states. Result 98 states and 154 transitions. Complement of second has 5 states. [2018-11-10 12:49:27,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 12:49:27,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:49:27,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2018-11-10 12:49:27,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-10 12:49:27,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:27,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-10 12:49:27,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:27,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 2 letters. Loop has 12 letters. [2018-11-10 12:49:27,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:27,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 154 transitions. [2018-11-10 12:49:27,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2018-11-10 12:49:27,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 84 states and 131 transitions. [2018-11-10 12:49:27,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-10 12:49:27,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-11-10 12:49:27,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 131 transitions. [2018-11-10 12:49:27,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:49:27,802 INFO L705 BuchiCegarLoop]: Abstraction has 84 states and 131 transitions. [2018-11-10 12:49:27,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 131 transitions. [2018-11-10 12:49:27,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-11-10 12:49:27,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-10 12:49:27,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 129 transitions. [2018-11-10 12:49:27,821 INFO L728 BuchiCegarLoop]: Abstraction has 82 states and 129 transitions. [2018-11-10 12:49:27,821 INFO L608 BuchiCegarLoop]: Abstraction has 82 states and 129 transitions. [2018-11-10 12:49:27,821 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 12:49:27,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 129 transitions. [2018-11-10 12:49:27,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2018-11-10 12:49:27,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:49:27,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:49:27,822 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 12:49:27,822 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 12:49:27,823 INFO L793 eck$LassoCheckResult]: Stem: 271#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 224#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 225#L177 assume true; 216#L23-1 [2018-11-10 12:49:27,823 INFO L795 eck$LassoCheckResult]: Loop: 216#L23-1 assume !false; 230#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 256#L30 assume main_~s__state~0 == 8466; 257#L31 assume !(main_~blastFlag~0 == 0); 264#L79-1 main_~s__state~0 := 8496; 193#L177 assume true; 216#L23-1 [2018-11-10 12:49:27,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:27,823 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2018-11-10 12:49:27,823 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:27,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:27,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:27,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:27,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:27,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:27,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1247431574, now seen corresponding path program 1 times [2018-11-10 12:49:27,827 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:27,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:27,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:27,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:27,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:27,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:27,832 INFO L82 PathProgramCache]: Analyzing trace with hash 384122552, now seen corresponding path program 1 times [2018-11-10 12:49:27,832 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:27,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:27,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:27,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:27,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:27,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:49:27,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:49:27,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:49:27,871 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:49:27,872 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:49:27,872 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:49:27,872 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:49:27,872 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:49:27,872 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:27,872 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:49:27,872 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:49:27,872 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration2_Loop [2018-11-10 12:49:27,872 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:49:27,872 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:49:27,873 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 12:49:27,878 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 12:49:27,914 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:49:27,914 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/bin-2019/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:27,926 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:49:27,927 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/bin-2019/uautomizer/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:27,955 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:49:27,955 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:49:27,984 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:49:27,985 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:49:27,985 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:49:27,985 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:49:27,985 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:49:27,985 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:49:27,986 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:27,986 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:49:27,986 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:49:27,986 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration2_Loop [2018-11-10 12:49:27,986 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:49:27,986 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:49:27,987 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 12:49:27,994 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 12:49:28,042 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:49:28,042 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:49:28,042 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 12:49:28,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:28,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:28,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:28,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:28,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:28,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:28,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:28,051 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:49:28,055 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:49:28,055 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 12:49:28,055 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:49:28,055 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:49:28,055 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:49:28,056 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8481 Supporting invariants [] [2018-11-10 12:49:28,056 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:49:28,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:28,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:49:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:28,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:49:28,112 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 12:49:28,112 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 12:49:28,113 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 129 transitions. cyclomatic complexity: 49 Second operand 5 states. [2018-11-10 12:49:28,217 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 129 transitions. cyclomatic complexity: 49. Second operand 5 states. Result 242 states and 350 transitions. Complement of second has 7 states. [2018-11-10 12:49:28,218 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 12:49:28,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 12:49:28,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2018-11-10 12:49:28,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-10 12:49:28,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:28,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-10 12:49:28,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:28,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 3 letters. Loop has 12 letters. [2018-11-10 12:49:28,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:28,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 242 states and 350 transitions. [2018-11-10 12:49:28,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2018-11-10 12:49:28,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 242 states to 171 states and 267 transitions. [2018-11-10 12:49:28,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2018-11-10 12:49:28,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 81 [2018-11-10 12:49:28,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 267 transitions. [2018-11-10 12:49:28,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:49:28,229 INFO L705 BuchiCegarLoop]: Abstraction has 171 states and 267 transitions. [2018-11-10 12:49:28,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 267 transitions. [2018-11-10 12:49:28,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 104. [2018-11-10 12:49:28,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-10 12:49:28,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 158 transitions. [2018-11-10 12:49:28,236 INFO L728 BuchiCegarLoop]: Abstraction has 104 states and 158 transitions. [2018-11-10 12:49:28,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:49:28,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:49:28,239 INFO L87 Difference]: Start difference. First operand 104 states and 158 transitions. Second operand 3 states. [2018-11-10 12:49:28,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:49:28,272 INFO L93 Difference]: Finished difference Result 190 states and 278 transitions. [2018-11-10 12:49:28,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:49:28,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190 states and 278 transitions. [2018-11-10 12:49:28,275 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 76 [2018-11-10 12:49:28,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190 states to 186 states and 274 transitions. [2018-11-10 12:49:28,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2018-11-10 12:49:28,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2018-11-10 12:49:28,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 274 transitions. [2018-11-10 12:49:28,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:49:28,278 INFO L705 BuchiCegarLoop]: Abstraction has 186 states and 274 transitions. [2018-11-10 12:49:28,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 274 transitions. [2018-11-10 12:49:28,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2018-11-10 12:49:28,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-10 12:49:28,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 271 transitions. [2018-11-10 12:49:28,286 INFO L728 BuchiCegarLoop]: Abstraction has 183 states and 271 transitions. [2018-11-10 12:49:28,286 INFO L608 BuchiCegarLoop]: Abstraction has 183 states and 271 transitions. [2018-11-10 12:49:28,286 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 12:49:28,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 183 states and 271 transitions. [2018-11-10 12:49:28,287 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 76 [2018-11-10 12:49:28,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:49:28,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:49:28,288 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 12:49:28,289 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:28,289 INFO L793 eck$LassoCheckResult]: Stem: 949#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 899#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 900#L177 assume true; 876#L23-1 [2018-11-10 12:49:28,289 INFO L795 eck$LassoCheckResult]: Loop: 876#L23-1 assume !false; 907#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 934#L30 assume !(main_~s__state~0 == 8466); 935#L33 assume main_~s__state~0 == 8496; 918#L34 assume !(main_~blastFlag~0 == 1); 919#L86-1 assume !(main_~s__hit~0 != 0);main_~s__state~0 := 8512; 865#L177 assume true; 876#L23-1 [2018-11-10 12:49:28,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:28,289 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 2 times [2018-11-10 12:49:28,289 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:28,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:28,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:28,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:28,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:28,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:28,297 INFO L82 PathProgramCache]: Analyzing trace with hash 15800887, now seen corresponding path program 1 times [2018-11-10 12:49:28,297 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:28,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:28,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:28,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:49:28,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:28,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:28,305 INFO L82 PathProgramCache]: Analyzing trace with hash -976975019, now seen corresponding path program 1 times [2018-11-10 12:49:28,305 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:28,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:28,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:28,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:28,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:28,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:49:28,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:49:28,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:49:28,351 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:49:28,351 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:49:28,351 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:49:28,351 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:49:28,351 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:49:28,352 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:28,352 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:49:28,352 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:49:28,352 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration3_Loop [2018-11-10 12:49:28,352 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:49:28,352 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:49:28,353 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 12:49:28,358 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 12:49:28,361 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 12:49:28,409 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:49:28,409 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/bin-2019/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:28,411 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:49:28,411 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:49:28,414 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:49:28,414 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~blastFlag~0=-8} Honda state: {ULTIMATE.start_main_~blastFlag~0=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/bin-2019/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:28,431 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:49:28,431 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/bin-2019/uautomizer/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:28,449 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:49:28,450 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:49:28,478 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:49:28,479 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:49:28,479 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:49:28,480 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:49:28,480 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:49:28,480 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:49:28,480 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:28,480 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:49:28,480 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:49:28,480 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration3_Loop [2018-11-10 12:49:28,480 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:49:28,480 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:49:28,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 12:49:28,498 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 12:49:28,502 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 12:49:28,549 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:49:28,549 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:49:28,549 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 12:49:28,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:28,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:28,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:28,551 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:49:28,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:28,551 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:49:28,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:28,555 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:28,555 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 12:49:28,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:28,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:28,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:28,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:28,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:28,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:28,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:28,560 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:49:28,563 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:49:28,563 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 12:49:28,563 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:49:28,563 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:49:28,564 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:49:28,564 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8504 Supporting invariants [] [2018-11-10 12:49:28,564 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:49:28,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:28,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:49:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:28,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:49:28,588 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 12:49:28,588 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 12:49:28,589 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 183 states and 271 transitions. cyclomatic complexity: 94 Second operand 5 states. [2018-11-10 12:49:28,685 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 183 states and 271 transitions. cyclomatic complexity: 94. Second operand 5 states. Result 602 states and 850 transitions. Complement of second has 7 states. [2018-11-10 12:49:28,686 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 12:49:28,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 12:49:28,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2018-11-10 12:49:28,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 3 letters. Loop has 7 letters. [2018-11-10 12:49:28,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:28,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 10 letters. Loop has 7 letters. [2018-11-10 12:49:28,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:28,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 3 letters. Loop has 14 letters. [2018-11-10 12:49:28,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:28,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 602 states and 850 transitions. [2018-11-10 12:49:28,693 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 82 [2018-11-10 12:49:28,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 602 states to 429 states and 637 transitions. [2018-11-10 12:49:28,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 154 [2018-11-10 12:49:28,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2018-11-10 12:49:28,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 429 states and 637 transitions. [2018-11-10 12:49:28,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:49:28,699 INFO L705 BuchiCegarLoop]: Abstraction has 429 states and 637 transitions. [2018-11-10 12:49:28,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states and 637 transitions. [2018-11-10 12:49:28,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 261. [2018-11-10 12:49:28,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-11-10 12:49:28,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 375 transitions. [2018-11-10 12:49:28,709 INFO L728 BuchiCegarLoop]: Abstraction has 261 states and 375 transitions. [2018-11-10 12:49:28,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:49:28,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:49:28,710 INFO L87 Difference]: Start difference. First operand 261 states and 375 transitions. Second operand 3 states. [2018-11-10 12:49:28,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:49:28,741 INFO L93 Difference]: Finished difference Result 174 states and 243 transitions. [2018-11-10 12:49:28,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:49:28,741 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 243 transitions. [2018-11-10 12:49:28,742 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2018-11-10 12:49:28,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 165 states and 234 transitions. [2018-11-10 12:49:28,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2018-11-10 12:49:28,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2018-11-10 12:49:28,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 165 states and 234 transitions. [2018-11-10 12:49:28,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:49:28,744 INFO L705 BuchiCegarLoop]: Abstraction has 165 states and 234 transitions. [2018-11-10 12:49:28,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states and 234 transitions. [2018-11-10 12:49:28,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-11-10 12:49:28,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-10 12:49:28,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 234 transitions. [2018-11-10 12:49:28,748 INFO L728 BuchiCegarLoop]: Abstraction has 165 states and 234 transitions. [2018-11-10 12:49:28,748 INFO L608 BuchiCegarLoop]: Abstraction has 165 states and 234 transitions. [2018-11-10 12:49:28,748 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 12:49:28,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 234 transitions. [2018-11-10 12:49:28,749 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2018-11-10 12:49:28,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:49:28,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:49:28,749 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:28,750 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:28,750 INFO L793 eck$LassoCheckResult]: Stem: 2223#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2176#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 2159#L177 assume true; 2160#L23-1 assume !false; 2305#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 2213#L30 assume main_~s__state~0 == 8466; 2214#L31 assume main_~blastFlag~0 == 0;main_~blastFlag~0 := 1; 2218#L79-1 main_~s__state~0 := 8496; 2296#L177 assume true; 2162#L23-1 assume !false; 2293#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 2266#L30 assume !(main_~s__state~0 == 8466); 2259#L33 assume !(main_~s__state~0 == 8496); 2201#L37 [2018-11-10 12:49:28,750 INFO L795 eck$LassoCheckResult]: Loop: 2201#L37 assume main_~s__state~0 == 8512; 2151#L38 main_~s__state~0 := 8528; 2142#L177 assume true; 2237#L23-1 assume !false; 2236#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 2234#L30 assume !(main_~s__state~0 == 8466); 2233#L33 assume !(main_~s__state~0 == 8496); 2201#L37 [2018-11-10 12:49:28,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:28,750 INFO L82 PathProgramCache]: Analyzing trace with hash 644899648, now seen corresponding path program 1 times [2018-11-10 12:49:28,750 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:28,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:28,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:28,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:28,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:28,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:49:28,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:49:28,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:49:28,779 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:49:28,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:28,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1171980457, now seen corresponding path program 1 times [2018-11-10 12:49:28,779 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:28,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:28,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:28,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:28,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:28,792 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:49:28,792 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:49:28,792 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:49:28,792 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:49:28,792 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:49:28,792 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:28,792 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:49:28,792 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:49:28,792 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration4_Loop [2018-11-10 12:49:28,792 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:49:28,792 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:49:28,793 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 12:49:28,820 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:49:28,820 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/bin-2019/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:28,826 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:49:28,826 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/bin-2019/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:28,859 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:49:28,859 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:49:28,886 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:49:28,888 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:49:28,888 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:49:28,888 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:49:28,888 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:49:28,888 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:49:28,888 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:28,888 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:49:28,889 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:49:28,889 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration4_Loop [2018-11-10 12:49:28,889 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:49:28,889 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:49:28,889 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 12:49:28,904 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:49:28,904 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:49:28,904 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 12:49:28,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:28,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:28,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:28,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:28,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:28,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:28,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:28,911 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:49:28,913 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:49:28,913 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 12:49:28,914 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:49:28,914 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:49:28,914 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:49:28,914 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8520 Supporting invariants [] [2018-11-10 12:49:28,914 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:49:28,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:28,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:49:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:28,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:49:28,950 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 12:49:28,950 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 12:49:28,953 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 165 states and 234 transitions. cyclomatic complexity: 77 Second operand 4 states. [2018-11-10 12:49:29,180 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 165 states and 234 transitions. cyclomatic complexity: 77. Second operand 4 states. Result 489 states and 716 transitions. Complement of second has 9 states. [2018-11-10 12:49:29,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 12:49:29,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:49:29,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2018-11-10 12:49:29,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 134 transitions. Stem has 13 letters. Loop has 7 letters. [2018-11-10 12:49:29,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:29,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 134 transitions. Stem has 20 letters. Loop has 7 letters. [2018-11-10 12:49:29,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:29,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 134 transitions. Stem has 13 letters. Loop has 14 letters. [2018-11-10 12:49:29,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:29,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 489 states and 716 transitions. [2018-11-10 12:49:29,185 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 67 [2018-11-10 12:49:29,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 489 states to 390 states and 584 transitions. [2018-11-10 12:49:29,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 110 [2018-11-10 12:49:29,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 146 [2018-11-10 12:49:29,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 390 states and 584 transitions. [2018-11-10 12:49:29,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:49:29,188 INFO L705 BuchiCegarLoop]: Abstraction has 390 states and 584 transitions. [2018-11-10 12:49:29,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states and 584 transitions. [2018-11-10 12:49:29,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 231. [2018-11-10 12:49:29,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-11-10 12:49:29,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 329 transitions. [2018-11-10 12:49:29,196 INFO L728 BuchiCegarLoop]: Abstraction has 231 states and 329 transitions. [2018-11-10 12:49:29,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:49:29,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:49:29,197 INFO L87 Difference]: Start difference. First operand 231 states and 329 transitions. Second operand 3 states. [2018-11-10 12:49:29,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:49:29,256 INFO L93 Difference]: Finished difference Result 256 states and 344 transitions. [2018-11-10 12:49:29,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:49:29,257 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 256 states and 344 transitions. [2018-11-10 12:49:29,259 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 62 [2018-11-10 12:49:29,260 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 256 states to 237 states and 323 transitions. [2018-11-10 12:49:29,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2018-11-10 12:49:29,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2018-11-10 12:49:29,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 237 states and 323 transitions. [2018-11-10 12:49:29,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:49:29,260 INFO L705 BuchiCegarLoop]: Abstraction has 237 states and 323 transitions. [2018-11-10 12:49:29,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states and 323 transitions. [2018-11-10 12:49:29,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 224. [2018-11-10 12:49:29,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-11-10 12:49:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 309 transitions. [2018-11-10 12:49:29,266 INFO L728 BuchiCegarLoop]: Abstraction has 224 states and 309 transitions. [2018-11-10 12:49:29,266 INFO L608 BuchiCegarLoop]: Abstraction has 224 states and 309 transitions. [2018-11-10 12:49:29,266 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 12:49:29,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 224 states and 309 transitions. [2018-11-10 12:49:29,267 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2018-11-10 12:49:29,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:49:29,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:49:29,268 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:29,268 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:29,268 INFO L793 eck$LassoCheckResult]: Stem: 3454#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3403#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 3404#L177 assume true; 3591#L23-1 assume !false; 3589#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 3440#L30 assume main_~s__state~0 == 8466; 3441#L31 assume main_~blastFlag~0 == 0;main_~blastFlag~0 := 1; 3447#L79-1 main_~s__state~0 := 8496; 3382#L177 assume true; 3383#L23-1 assume !false; 3411#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 3523#L30 assume !(main_~s__state~0 == 8466); 3520#L33 assume main_~s__state~0 == 8496; 3517#L34 assume !(main_~blastFlag~0 == 1); 3514#L86-1 assume main_~s__hit~0 != 0;main_~s__state~0 := 8656; 3512#L177 assume true; 3511#L23-1 assume !false; 3503#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 3504#L30 assume !(main_~s__state~0 == 8466); 3455#L33 assume !(main_~s__state~0 == 8496); 3456#L37 assume !(main_~s__state~0 == 8512); 3429#L41 [2018-11-10 12:49:29,268 INFO L795 eck$LassoCheckResult]: Loop: 3429#L41 assume main_~s__state~0 == 8528; 3442#L42 main_~s__state~0 := 8544; 3371#L177 assume true; 3478#L23-1 assume !false; 3475#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 3472#L30 assume !(main_~s__state~0 == 8466); 3470#L33 assume !(main_~s__state~0 == 8496); 3468#L37 assume !(main_~s__state~0 == 8512); 3429#L41 [2018-11-10 12:49:29,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:29,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1353092174, now seen corresponding path program 1 times [2018-11-10 12:49:29,269 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:29,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:29,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:29,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:29,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:49:29,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:49:29,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:49:29,291 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:49:29,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:29,292 INFO L82 PathProgramCache]: Analyzing trace with hash -424187020, now seen corresponding path program 1 times [2018-11-10 12:49:29,292 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:29,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:29,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:29,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:29,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:29,310 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:49:29,310 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:49:29,310 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:49:29,310 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:49:29,310 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:49:29,310 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:29,310 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:49:29,310 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:49:29,310 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration5_Loop [2018-11-10 12:49:29,311 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:49:29,311 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:49:29,311 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 12:49:29,322 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:49:29,322 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/bin-2019/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:29,324 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:49:29,324 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/bin-2019/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:29,342 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:49:29,342 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:49:29,359 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:49:29,360 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:49:29,360 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:49:29,360 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:49:29,360 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:49:29,360 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:49:29,360 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:29,360 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:49:29,361 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:49:29,361 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration5_Loop [2018-11-10 12:49:29,361 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:49:29,361 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:49:29,361 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 12:49:29,371 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:49:29,371 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:49:29,372 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 12:49:29,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:29,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:29,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:29,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:29,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:29,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:29,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:29,375 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:49:29,376 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:49:29,376 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 12:49:29,376 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:49:29,377 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:49:29,377 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:49:29,377 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8536 Supporting invariants [] [2018-11-10 12:49:29,377 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:49:29,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:29,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:49:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:29,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:49:29,407 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 12:49:29,408 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 12:49:29,408 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 224 states and 309 transitions. cyclomatic complexity: 93 Second operand 4 states. [2018-11-10 12:49:29,519 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 224 states and 309 transitions. cyclomatic complexity: 93. Second operand 4 states. Result 570 states and 819 transitions. Complement of second has 9 states. [2018-11-10 12:49:29,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 12:49:29,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:49:29,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2018-11-10 12:49:29,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 139 transitions. Stem has 21 letters. Loop has 8 letters. [2018-11-10 12:49:29,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:29,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 139 transitions. Stem has 29 letters. Loop has 8 letters. [2018-11-10 12:49:29,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:29,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 139 transitions. Stem has 21 letters. Loop has 16 letters. [2018-11-10 12:49:29,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:29,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 570 states and 819 transitions. [2018-11-10 12:49:29,523 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 88 [2018-11-10 12:49:29,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 570 states to 479 states and 695 transitions. [2018-11-10 12:49:29,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2018-11-10 12:49:29,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 169 [2018-11-10 12:49:29,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 479 states and 695 transitions. [2018-11-10 12:49:29,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:49:29,526 INFO L705 BuchiCegarLoop]: Abstraction has 479 states and 695 transitions. [2018-11-10 12:49:29,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states and 695 transitions. [2018-11-10 12:49:29,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 322. [2018-11-10 12:49:29,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-11-10 12:49:29,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 444 transitions. [2018-11-10 12:49:29,532 INFO L728 BuchiCegarLoop]: Abstraction has 322 states and 444 transitions. [2018-11-10 12:49:29,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:49:29,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:49:29,532 INFO L87 Difference]: Start difference. First operand 322 states and 444 transitions. Second operand 3 states. [2018-11-10 12:49:29,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:49:29,550 INFO L93 Difference]: Finished difference Result 391 states and 513 transitions. [2018-11-10 12:49:29,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:49:29,551 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 391 states and 513 transitions. [2018-11-10 12:49:29,552 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 77 [2018-11-10 12:49:29,554 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 391 states to 391 states and 513 transitions. [2018-11-10 12:49:29,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 118 [2018-11-10 12:49:29,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 118 [2018-11-10 12:49:29,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 391 states and 513 transitions. [2018-11-10 12:49:29,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:49:29,554 INFO L705 BuchiCegarLoop]: Abstraction has 391 states and 513 transitions. [2018-11-10 12:49:29,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states and 513 transitions. [2018-11-10 12:49:29,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2018-11-10 12:49:29,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-11-10 12:49:29,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 513 transitions. [2018-11-10 12:49:29,559 INFO L728 BuchiCegarLoop]: Abstraction has 391 states and 513 transitions. [2018-11-10 12:49:29,559 INFO L608 BuchiCegarLoop]: Abstraction has 391 states and 513 transitions. [2018-11-10 12:49:29,559 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 12:49:29,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 391 states and 513 transitions. [2018-11-10 12:49:29,561 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 77 [2018-11-10 12:49:29,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:49:29,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:49:29,561 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:29,562 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:29,562 INFO L793 eck$LassoCheckResult]: Stem: 5080#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5028#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 5006#L177 assume true; 5007#L23-1 assume !false; 5377#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 5063#L30 assume main_~s__state~0 == 8466; 5064#L31 assume main_~blastFlag~0 == 0;main_~blastFlag~0 := 1; 5353#L79-1 main_~s__state~0 := 8496; 5352#L177 assume true; 5350#L23-1 assume !false; 5348#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 5347#L30 assume !(main_~s__state~0 == 8466); 5345#L33 assume main_~s__state~0 == 8496; 5342#L34 assume main_~blastFlag~0 == 1;main_~blastFlag~0 := 2; 5340#L86-1 assume main_~s__hit~0 != 0;main_~s__state~0 := 8656; 5337#L177 assume true; 5335#L23-1 assume !false; 5333#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 5280#L30 assume !(main_~s__state~0 == 8466); 5281#L33 assume !(main_~s__state~0 == 8496); 5282#L37 assume !(main_~s__state~0 == 8512); 5116#L41 assume !(main_~s__state~0 == 8528); 5048#L45 [2018-11-10 12:49:29,562 INFO L795 eck$LassoCheckResult]: Loop: 5048#L45 assume main_~s__state~0 == 8544; 5049#L46 assume !(main_~s__verify_mode~0 + 1 != 0);main_~s__state~0 := 8560; 4993#L177 assume true; 5173#L23-1 assume !false; 5171#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 5166#L30 assume !(main_~s__state~0 == 8466); 5162#L33 assume !(main_~s__state~0 == 8496); 5158#L37 assume !(main_~s__state~0 == 8512); 5157#L41 assume !(main_~s__state~0 == 8528); 5048#L45 [2018-11-10 12:49:29,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:29,562 INFO L82 PathProgramCache]: Analyzing trace with hash 323757233, now seen corresponding path program 1 times [2018-11-10 12:49:29,562 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:29,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:29,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:29,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:29,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:29,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:29,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:29,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1775279415, now seen corresponding path program 1 times [2018-11-10 12:49:29,575 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:29,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:29,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:29,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:29,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:29,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:29,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1838498169, now seen corresponding path program 1 times [2018-11-10 12:49:29,580 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:29,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:29,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:29,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:29,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:29,604 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 12:49:29,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:49:29,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:49:29,627 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:49:29,627 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:49:29,627 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:49:29,627 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:49:29,627 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:49:29,627 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:29,627 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:49:29,627 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:49:29,627 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration6_Loop [2018-11-10 12:49:29,627 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:49:29,627 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:49:29,628 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 12:49:29,631 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 12:49:29,649 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:49:29,649 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/bin-2019/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:29,654 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:49:29,655 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:49:29,657 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:49:29,657 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~s__verify_mode~0=-1} Honda state: {ULTIMATE.start_main_~s__verify_mode~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/bin-2019/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:29,674 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:49:29,674 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/bin-2019/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:29,693 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:49:29,693 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:49:29,710 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:49:29,713 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:49:29,714 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:49:29,714 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:49:29,714 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:49:29,714 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:49:29,714 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:29,714 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:49:29,714 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:49:29,714 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration6_Loop [2018-11-10 12:49:29,714 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:49:29,714 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:49:29,714 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 12:49:29,718 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 12:49:29,732 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:49:29,732 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:49:29,732 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 12:49:29,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:29,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:29,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:29,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:29,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:29,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:29,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:29,734 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:49:29,735 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 12:49:29,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:29,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:29,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:29,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:29,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:29,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:29,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:29,738 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:49:29,739 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:49:29,740 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 12:49:29,740 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:49:29,740 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:49:29,740 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:49:29,740 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8552 Supporting invariants [] [2018-11-10 12:49:29,740 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:49:29,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:29,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:49:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:29,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:49:29,777 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 12:49:29,778 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 12:49:29,778 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 391 states and 513 transitions. cyclomatic complexity: 134 Second operand 4 states. [2018-11-10 12:49:29,895 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 391 states and 513 transitions. cyclomatic complexity: 134. Second operand 4 states. Result 761 states and 1049 transitions. Complement of second has 9 states. [2018-11-10 12:49:29,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 12:49:29,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:49:29,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2018-11-10 12:49:29,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 146 transitions. Stem has 22 letters. Loop has 9 letters. [2018-11-10 12:49:29,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:29,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 146 transitions. Stem has 31 letters. Loop has 9 letters. [2018-11-10 12:49:29,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:29,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 146 transitions. Stem has 22 letters. Loop has 18 letters. [2018-11-10 12:49:29,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:29,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 761 states and 1049 transitions. [2018-11-10 12:49:29,901 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 108 [2018-11-10 12:49:29,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 761 states to 678 states and 934 transitions. [2018-11-10 12:49:29,903 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 182 [2018-11-10 12:49:29,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 211 [2018-11-10 12:49:29,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 678 states and 934 transitions. [2018-11-10 12:49:29,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:49:29,904 INFO L705 BuchiCegarLoop]: Abstraction has 678 states and 934 transitions. [2018-11-10 12:49:29,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states and 934 transitions. [2018-11-10 12:49:29,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 534. [2018-11-10 12:49:29,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2018-11-10 12:49:29,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 711 transitions. [2018-11-10 12:49:29,912 INFO L728 BuchiCegarLoop]: Abstraction has 534 states and 711 transitions. [2018-11-10 12:49:29,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:49:29,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:49:29,913 INFO L87 Difference]: Start difference. First operand 534 states and 711 transitions. Second operand 3 states. [2018-11-10 12:49:29,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:49:29,959 INFO L93 Difference]: Finished difference Result 666 states and 845 transitions. [2018-11-10 12:49:29,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:49:29,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 666 states and 845 transitions. [2018-11-10 12:49:29,962 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 110 [2018-11-10 12:49:29,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 666 states to 622 states and 801 transitions. [2018-11-10 12:49:29,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 191 [2018-11-10 12:49:29,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 195 [2018-11-10 12:49:29,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 622 states and 801 transitions. [2018-11-10 12:49:29,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:49:29,964 INFO L705 BuchiCegarLoop]: Abstraction has 622 states and 801 transitions. [2018-11-10 12:49:29,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states and 801 transitions. [2018-11-10 12:49:29,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 560. [2018-11-10 12:49:29,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2018-11-10 12:49:29,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 737 transitions. [2018-11-10 12:49:29,971 INFO L728 BuchiCegarLoop]: Abstraction has 560 states and 737 transitions. [2018-11-10 12:49:29,971 INFO L608 BuchiCegarLoop]: Abstraction has 560 states and 737 transitions. [2018-11-10 12:49:29,971 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 12:49:29,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 560 states and 737 transitions. [2018-11-10 12:49:29,972 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 108 [2018-11-10 12:49:29,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:49:29,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:49:29,973 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:29,973 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:29,973 INFO L793 eck$LassoCheckResult]: Stem: 7558#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 7504#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 7505#L177 assume true; 7821#L23-1 assume !false; 7820#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7819#L30 assume main_~s__state~0 == 8466; 7818#L31 assume main_~blastFlag~0 == 0;main_~blastFlag~0 := 1; 7809#L79-1 main_~s__state~0 := 8496; 7817#L177 assume true; 7895#L23-1 assume !false; 7894#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7893#L30 assume !(main_~s__state~0 == 8466); 7891#L33 assume main_~s__state~0 == 8496; 7878#L34 assume main_~blastFlag~0 == 1;main_~blastFlag~0 := 2; 7875#L86-1 assume main_~s__hit~0 != 0;main_~s__state~0 := 8656; 7481#L177 [2018-11-10 12:49:29,973 INFO L795 eck$LassoCheckResult]: Loop: 7481#L177 assume true; 7482#L23-1 assume !false; 7511#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7537#L30 assume !(main_~s__state~0 == 8466); 7538#L33 assume !(main_~s__state~0 == 8496); 7526#L37 assume !(main_~s__state~0 == 8512); 7527#L41 assume !(main_~s__state~0 == 8528); 7541#L45 assume !(main_~s__state~0 == 8544); 7583#L49 assume !(main_~s__state~0 == 8560); 7580#L53 assume !(main_~s__state~0 == 8576); 7568#L57 assume !(main_~s__state~0 == 8592); 7533#L61 assume !(main_~s__state~0 == 8608); 7517#L65 assume !(main_~s__state~0 == 8640); 7471#L69 assume main_~s__state~0 == 8656; 7472#L70 assume main_~blastFlag~0 == 2;main_~blastFlag~0 := 3; 7530#L163-1 main_~s__state~0 := 8672; 7481#L177 [2018-11-10 12:49:29,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:29,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1273272036, now seen corresponding path program 1 times [2018-11-10 12:49:29,974 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:29,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:29,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:29,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:29,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:29,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:29,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1821500761, now seen corresponding path program 1 times [2018-11-10 12:49:29,980 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:29,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:29,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:29,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:29,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:29,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:29,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1509520502, now seen corresponding path program 1 times [2018-11-10 12:49:29,989 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:29,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:29,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:29,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:29,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:30,041 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:49:30,041 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:49:30,041 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:49:30,041 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:49:30,041 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:49:30,041 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:30,041 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:49:30,042 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:49:30,042 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration7_Loop [2018-11-10 12:49:30,042 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:49:30,042 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:49:30,042 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 12:49:30,046 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 12:49:30,072 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:49:30,072 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/bin-2019/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:30,079 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:49:30,079 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/bin-2019/uautomizer/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:30,109 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:49:30,109 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:49:30,126 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:49:30,127 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:49:30,128 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:49:30,128 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:49:30,128 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:49:30,128 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:49:30,128 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:30,128 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:49:30,128 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:49:30,128 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration7_Loop [2018-11-10 12:49:30,128 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:49:30,128 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:49:30,128 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 12:49:30,131 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 12:49:30,167 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:49:30,167 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:49:30,168 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 12:49:30,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:30,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:30,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:30,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:30,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:30,169 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:30,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:30,171 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:49:30,173 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:49:30,173 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 12:49:30,173 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:49:30,173 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:49:30,173 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:49:30,173 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8664 Supporting invariants [] [2018-11-10 12:49:30,173 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:49:30,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:30,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:49:30,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:30,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:49:30,205 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 12:49:30,205 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 12:49:30,205 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 560 states and 737 transitions. cyclomatic complexity: 193 Second operand 4 states. [2018-11-10 12:49:30,235 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 560 states and 737 transitions. cyclomatic complexity: 193. Second operand 4 states. Result 774 states and 1008 transitions. Complement of second has 7 states. [2018-11-10 12:49:30,235 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 12:49:30,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:49:30,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2018-11-10 12:49:30,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 15 letters. Loop has 16 letters. [2018-11-10 12:49:30,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:30,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 31 letters. Loop has 16 letters. [2018-11-10 12:49:30,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:30,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 15 letters. Loop has 32 letters. [2018-11-10 12:49:30,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:30,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 774 states and 1008 transitions. [2018-11-10 12:49:30,240 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 169 [2018-11-10 12:49:30,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 774 states to 762 states and 992 transitions. [2018-11-10 12:49:30,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 248 [2018-11-10 12:49:30,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 249 [2018-11-10 12:49:30,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 762 states and 992 transitions. [2018-11-10 12:49:30,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:49:30,242 INFO L705 BuchiCegarLoop]: Abstraction has 762 states and 992 transitions. [2018-11-10 12:49:30,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states and 992 transitions. [2018-11-10 12:49:30,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 754. [2018-11-10 12:49:30,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2018-11-10 12:49:30,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 982 transitions. [2018-11-10 12:49:30,249 INFO L728 BuchiCegarLoop]: Abstraction has 754 states and 982 transitions. [2018-11-10 12:49:30,249 INFO L608 BuchiCegarLoop]: Abstraction has 754 states and 982 transitions. [2018-11-10 12:49:30,249 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 12:49:30,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 754 states and 982 transitions. [2018-11-10 12:49:30,251 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 169 [2018-11-10 12:49:30,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:49:30,251 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:49:30,252 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:30,252 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:30,252 INFO L793 eck$LassoCheckResult]: Stem: 9016#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 8953#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 8954#L177 assume true; 9336#L23-1 assume !false; 9337#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 9322#L30 assume main_~s__state~0 == 8466; 9318#L31 assume main_~blastFlag~0 == 0;main_~blastFlag~0 := 1; 9316#L79-1 main_~s__state~0 := 8496; 9315#L177 assume true; 9314#L23-1 assume !false; 9312#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 9310#L30 assume !(main_~s__state~0 == 8466); 9308#L33 assume main_~s__state~0 == 8496; 9303#L34 assume main_~blastFlag~0 == 1;main_~blastFlag~0 := 2; 9302#L86-1 assume !(main_~s__hit~0 != 0);main_~s__state~0 := 8512; 9294#L177 assume true; 9295#L23-1 assume !false; 9252#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 9253#L30 assume !(main_~s__state~0 == 8466); 9227#L33 assume !(main_~s__state~0 == 8496); 9228#L37 assume !(main_~s__state~0 == 8512); 9188#L41 assume !(main_~s__state~0 == 8528); 9087#L45 assume !(main_~s__state~0 == 8544); 9046#L49 [2018-11-10 12:49:30,252 INFO L795 eck$LassoCheckResult]: Loop: 9046#L49 assume main_~s__state~0 == 8560; 8986#L50 main_~s__state~0 := 8576; 8920#L177 assume true; 9095#L23-1 assume !false; 9093#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 9090#L30 assume !(main_~s__state~0 == 8466); 9060#L33 assume !(main_~s__state~0 == 8496); 9056#L37 assume !(main_~s__state~0 == 8512); 9051#L41 assume !(main_~s__state~0 == 8528); 9045#L45 assume !(main_~s__state~0 == 8544); 9046#L49 [2018-11-10 12:49:30,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:30,252 INFO L82 PathProgramCache]: Analyzing trace with hash 2126598043, now seen corresponding path program 1 times [2018-11-10 12:49:30,252 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:30,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:30,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:30,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:30,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:30,264 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 12:49:30,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:49:30,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:49:30,264 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:49:30,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:30,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1384090737, now seen corresponding path program 1 times [2018-11-10 12:49:30,264 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:30,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:30,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:30,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:30,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:30,287 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:49:30,287 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:49:30,287 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:49:30,287 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:49:30,287 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:49:30,287 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:30,287 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:49:30,287 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:49:30,287 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration8_Loop [2018-11-10 12:49:30,287 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:49:30,287 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:49:30,288 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 12:49:30,304 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:49:30,304 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/bin-2019/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:30,315 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:49:30,315 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/bin-2019/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:30,338 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:49:30,338 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:49:30,355 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:49:30,356 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:49:30,356 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:49:30,356 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:49:30,356 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:49:30,356 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:49:30,356 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:30,356 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:49:30,356 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:49:30,356 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration8_Loop [2018-11-10 12:49:30,357 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:49:30,357 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:49:30,357 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 12:49:30,370 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:49:30,371 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:49:30,371 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 12:49:30,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:30,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:30,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:30,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:30,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:30,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:30,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:30,373 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:49:30,374 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:49:30,374 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 12:49:30,374 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:49:30,374 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:49:30,374 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:49:30,375 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8568 Supporting invariants [] [2018-11-10 12:49:30,375 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:49:30,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:30,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:49:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:30,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:49:30,405 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 12:49:30,406 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 12:49:30,406 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 754 states and 982 transitions. cyclomatic complexity: 248 Second operand 4 states. [2018-11-10 12:49:30,543 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 754 states and 982 transitions. cyclomatic complexity: 248. Second operand 4 states. Result 1318 states and 1755 transitions. Complement of second has 9 states. [2018-11-10 12:49:30,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 12:49:30,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:49:30,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 171 transitions. [2018-11-10 12:49:30,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 171 transitions. Stem has 23 letters. Loop has 10 letters. [2018-11-10 12:49:30,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:30,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 171 transitions. Stem has 33 letters. Loop has 10 letters. [2018-11-10 12:49:30,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:30,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 171 transitions. Stem has 23 letters. Loop has 20 letters. [2018-11-10 12:49:30,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:30,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1318 states and 1755 transitions. [2018-11-10 12:49:30,551 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 212 [2018-11-10 12:49:30,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1318 states to 1178 states and 1576 transitions. [2018-11-10 12:49:30,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 345 [2018-11-10 12:49:30,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 373 [2018-11-10 12:49:30,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1178 states and 1576 transitions. [2018-11-10 12:49:30,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:49:30,556 INFO L705 BuchiCegarLoop]: Abstraction has 1178 states and 1576 transitions. [2018-11-10 12:49:30,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states and 1576 transitions. [2018-11-10 12:49:30,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 917. [2018-11-10 12:49:30,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 917 states. [2018-11-10 12:49:30,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1214 transitions. [2018-11-10 12:49:30,569 INFO L728 BuchiCegarLoop]: Abstraction has 917 states and 1214 transitions. [2018-11-10 12:49:30,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:49:30,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:49:30,570 INFO L87 Difference]: Start difference. First operand 917 states and 1214 transitions. Second operand 3 states. [2018-11-10 12:49:30,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:49:30,617 INFO L93 Difference]: Finished difference Result 1001 states and 1280 transitions. [2018-11-10 12:49:30,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:49:30,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1001 states and 1280 transitions. [2018-11-10 12:49:30,621 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 210 [2018-11-10 12:49:30,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1001 states to 952 states and 1225 transitions. [2018-11-10 12:49:30,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 296 [2018-11-10 12:49:30,625 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 303 [2018-11-10 12:49:30,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 952 states and 1225 transitions. [2018-11-10 12:49:30,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:49:30,625 INFO L705 BuchiCegarLoop]: Abstraction has 952 states and 1225 transitions. [2018-11-10 12:49:30,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states and 1225 transitions. [2018-11-10 12:49:30,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 936. [2018-11-10 12:49:30,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 936 states. [2018-11-10 12:49:30,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1208 transitions. [2018-11-10 12:49:30,636 INFO L728 BuchiCegarLoop]: Abstraction has 936 states and 1208 transitions. [2018-11-10 12:49:30,636 INFO L608 BuchiCegarLoop]: Abstraction has 936 states and 1208 transitions. [2018-11-10 12:49:30,636 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 12:49:30,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 936 states and 1208 transitions. [2018-11-10 12:49:30,639 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 209 [2018-11-10 12:49:30,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:49:30,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:49:30,640 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:30,640 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:30,640 INFO L793 eck$LassoCheckResult]: Stem: 13134#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 13070#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 13071#L177 assume true; 13460#L23-1 assume !false; 13459#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 13458#L30 assume main_~s__state~0 == 8466; 13457#L31 assume main_~blastFlag~0 == 0;main_~blastFlag~0 := 1; 13455#L79-1 main_~s__state~0 := 8496; 13454#L177 assume true; 13453#L23-1 assume !false; 13452#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 13242#L30 assume !(main_~s__state~0 == 8466); 13240#L33 assume main_~s__state~0 == 8496; 13224#L34 assume main_~blastFlag~0 == 1;main_~blastFlag~0 := 2; 13203#L86-1 assume main_~s__hit~0 != 0;main_~s__state~0 := 8656; 13198#L177 assume true; 13197#L23-1 assume !false; 13196#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 13195#L30 assume !(main_~s__state~0 == 8466); 13194#L33 assume !(main_~s__state~0 == 8496); 13193#L37 assume !(main_~s__state~0 == 8512); 13192#L41 assume !(main_~s__state~0 == 8528); 13191#L45 assume !(main_~s__state~0 == 8544); 13189#L49 assume !(main_~s__state~0 == 8560); 13188#L53 assume !(main_~s__state~0 == 8576); 13187#L57 assume !(main_~s__state~0 == 8592); 13186#L61 assume !(main_~s__state~0 == 8608); 13185#L65 assume !(main_~s__state~0 == 8640); 13040#L69 assume !(main_~s__state~0 == 8656); 13041#L73 [2018-11-10 12:49:30,640 INFO L795 eck$LassoCheckResult]: Loop: 13041#L73 assume main_~s__state~0 == 8672; 13072#L74 assume main_~blastFlag~0 == 4;main_~blastFlag~0 := 5; 13068#L170-1 assume main_~s__hit~0 != 0;main_~s__state~0 := 8640; 13037#L177 assume true; 13341#L23-1 assume !false; 13338#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 13335#L30 assume !(main_~s__state~0 == 8466); 13331#L33 assume !(main_~s__state~0 == 8496); 13321#L37 assume !(main_~s__state~0 == 8512); 13313#L41 assume !(main_~s__state~0 == 8528); 13310#L45 assume !(main_~s__state~0 == 8544); 13295#L49 assume !(main_~s__state~0 == 8560); 13296#L53 assume !(main_~s__state~0 == 8576); 13305#L57 assume !(main_~s__state~0 == 8592); 13306#L61 assume !(main_~s__state~0 == 8608); 13308#L65 assume !(main_~s__state~0 == 8640); 13182#L69 assume !(main_~s__state~0 == 8656); 13041#L73 [2018-11-10 12:49:30,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:30,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1562673288, now seen corresponding path program 1 times [2018-11-10 12:49:30,640 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:30,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:30,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:30,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:30,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:30,652 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 12:49:30,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:49:30,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:49:30,653 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:49:30,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:30,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1220787033, now seen corresponding path program 1 times [2018-11-10 12:49:30,653 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:30,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:30,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:30,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:30,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:30,662 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 12:49:30,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:49:30,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:49:30,663 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:49:30,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:49:30,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:49:30,663 INFO L87 Difference]: Start difference. First operand 936 states and 1208 transitions. cyclomatic complexity: 292 Second operand 3 states. [2018-11-10 12:49:30,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:49:30,711 INFO L93 Difference]: Finished difference Result 885 states and 1119 transitions. [2018-11-10 12:49:30,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:49:30,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 885 states and 1119 transitions. [2018-11-10 12:49:30,715 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 187 [2018-11-10 12:49:30,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 885 states to 783 states and 999 transitions. [2018-11-10 12:49:30,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 277 [2018-11-10 12:49:30,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 277 [2018-11-10 12:49:30,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 783 states and 999 transitions. [2018-11-10 12:49:30,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:49:30,720 INFO L705 BuchiCegarLoop]: Abstraction has 783 states and 999 transitions. [2018-11-10 12:49:30,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states and 999 transitions. [2018-11-10 12:49:30,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 748. [2018-11-10 12:49:30,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2018-11-10 12:49:30,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 960 transitions. [2018-11-10 12:49:30,731 INFO L728 BuchiCegarLoop]: Abstraction has 748 states and 960 transitions. [2018-11-10 12:49:30,731 INFO L608 BuchiCegarLoop]: Abstraction has 748 states and 960 transitions. [2018-11-10 12:49:30,731 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 12:49:30,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 748 states and 960 transitions. [2018-11-10 12:49:30,733 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 152 [2018-11-10 12:49:30,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:49:30,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:49:30,734 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:30,734 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:30,734 INFO L793 eck$LassoCheckResult]: Stem: 14950#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 14894#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 14895#L177 assume true; 15131#L23-1 assume !false; 15130#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15128#L30 assume main_~s__state~0 == 8466; 15124#L31 assume main_~blastFlag~0 == 0;main_~blastFlag~0 := 1; 15122#L79-1 main_~s__state~0 := 8496; 15120#L177 assume true; 15118#L23-1 assume !false; 15116#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15112#L30 assume !(main_~s__state~0 == 8466); 15108#L33 assume main_~s__state~0 == 8496; 15055#L34 assume main_~blastFlag~0 == 1;main_~blastFlag~0 := 2; 15025#L86-1 assume main_~s__hit~0 != 0;main_~s__state~0 := 8656; 15021#L177 assume true; 15022#L23-1 assume !false; 15113#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15109#L30 assume !(main_~s__state~0 == 8466); 15105#L33 assume !(main_~s__state~0 == 8496); 15100#L37 assume !(main_~s__state~0 == 8512); 15093#L41 assume !(main_~s__state~0 == 8528); 15088#L45 assume !(main_~s__state~0 == 8544); 15086#L49 assume !(main_~s__state~0 == 8560); 15082#L53 assume !(main_~s__state~0 == 8576); 15079#L57 assume !(main_~s__state~0 == 8592); 15075#L61 assume !(main_~s__state~0 == 8608); 15071#L65 assume !(main_~s__state~0 == 8640); 14868#L69 assume !(main_~s__state~0 == 8656); 14869#L73 [2018-11-10 12:49:30,734 INFO L795 eck$LassoCheckResult]: Loop: 14869#L73 assume main_~s__state~0 == 8672; 14893#L74 assume main_~blastFlag~0 == 4;main_~blastFlag~0 := 5; 14892#L170-1 assume main_~s__hit~0 != 0;main_~s__state~0 := 8640; 14891#L177 assume true; 15381#L23-1 assume !false; 15379#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15376#L30 assume !(main_~s__state~0 == 8466); 15375#L33 assume !(main_~s__state~0 == 8496); 15373#L37 assume !(main_~s__state~0 == 8512); 15370#L41 assume !(main_~s__state~0 == 8528); 15367#L45 assume !(main_~s__state~0 == 8544); 15364#L49 assume !(main_~s__state~0 == 8560); 15362#L53 assume !(main_~s__state~0 == 8576); 15360#L57 assume !(main_~s__state~0 == 8592); 15167#L61 assume !(main_~s__state~0 == 8608); 14906#L65 assume main_~s__state~0 == 8640; 14907#L66 assume main_~blastFlag~0 == 3;main_~blastFlag~0 := 4; 14951#L152-1 assume !(main_~s__hit~0 != 0);main_~s__state~0 := 8656; 14952#L177 assume true; 15503#L23-1 assume !false; 15501#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15499#L30 assume !(main_~s__state~0 == 8466); 15497#L33 assume !(main_~s__state~0 == 8496); 14916#L37 assume !(main_~s__state~0 == 8512); 14917#L41 assume !(main_~s__state~0 == 8528); 14913#L45 assume !(main_~s__state~0 == 8544); 14880#L49 assume !(main_~s__state~0 == 8560); 14881#L53 assume !(main_~s__state~0 == 8576); 14947#L57 assume !(main_~s__state~0 == 8592); 14925#L61 assume !(main_~s__state~0 == 8608); 14926#L65 assume !(main_~s__state~0 == 8640); 15058#L69 assume !(main_~s__state~0 == 8656); 14869#L73 [2018-11-10 12:49:30,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:30,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1562673288, now seen corresponding path program 2 times [2018-11-10 12:49:30,735 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:30,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:30,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:30,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:30,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:30,759 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 12:49:30,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:49:30,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:49:30,760 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:49:30,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:30,760 INFO L82 PathProgramCache]: Analyzing trace with hash -811806087, now seen corresponding path program 1 times [2018-11-10 12:49:30,760 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:30,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:30,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:30,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:49:30,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:30,782 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:49:30,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:49:30,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:49:30,783 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:49:30,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:49:30,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:49:30,783 INFO L87 Difference]: Start difference. First operand 748 states and 960 transitions. cyclomatic complexity: 230 Second operand 3 states. [2018-11-10 12:49:30,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:49:30,824 INFO L93 Difference]: Finished difference Result 789 states and 1001 transitions. [2018-11-10 12:49:30,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:49:30,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 789 states and 1001 transitions. [2018-11-10 12:49:30,827 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 166 [2018-11-10 12:49:30,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 789 states to 776 states and 987 transitions. [2018-11-10 12:49:30,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 256 [2018-11-10 12:49:30,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 256 [2018-11-10 12:49:30,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 776 states and 987 transitions. [2018-11-10 12:49:30,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:49:30,829 INFO L705 BuchiCegarLoop]: Abstraction has 776 states and 987 transitions. [2018-11-10 12:49:30,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states and 987 transitions. [2018-11-10 12:49:30,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 763. [2018-11-10 12:49:30,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2018-11-10 12:49:30,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 974 transitions. [2018-11-10 12:49:30,835 INFO L728 BuchiCegarLoop]: Abstraction has 763 states and 974 transitions. [2018-11-10 12:49:30,835 INFO L608 BuchiCegarLoop]: Abstraction has 763 states and 974 transitions. [2018-11-10 12:49:30,835 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 12:49:30,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 763 states and 974 transitions. [2018-11-10 12:49:30,837 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 166 [2018-11-10 12:49:30,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:49:30,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:49:30,838 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:30,838 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:30,838 INFO L793 eck$LassoCheckResult]: Stem: 16496#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 16440#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 16441#L177 assume true; 16872#L23-1 assume !false; 16870#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 16869#L30 assume main_~s__state~0 == 8466; 16868#L31 assume main_~blastFlag~0 == 0;main_~blastFlag~0 := 1; 16865#L79-1 main_~s__state~0 := 8496; 16863#L177 assume true; 16861#L23-1 assume !false; 16859#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 16857#L30 assume !(main_~s__state~0 == 8466); 16855#L33 assume main_~s__state~0 == 8496; 16853#L34 assume main_~blastFlag~0 == 1;main_~blastFlag~0 := 2; 16852#L86-1 assume !(main_~s__hit~0 != 0);main_~s__state~0 := 8512; 16849#L177 assume true; 16845#L23-1 assume !false; 16842#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 16839#L30 assume !(main_~s__state~0 == 8466); 16836#L33 assume !(main_~s__state~0 == 8496); 16463#L37 assume main_~s__state~0 == 8512; 16464#L38 main_~s__state~0 := 8528; 16850#L177 assume true; 16846#L23-1 assume !false; 16843#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 16840#L30 assume !(main_~s__state~0 == 8466); 16837#L33 assume !(main_~s__state~0 == 8496); 16831#L37 assume !(main_~s__state~0 == 8512); 16832#L41 assume !(main_~s__state~0 == 8528); 16663#L45 assume !(main_~s__state~0 == 8544); 16578#L49 assume !(main_~s__state~0 == 8560); 16522#L53 [2018-11-10 12:49:30,838 INFO L795 eck$LassoCheckResult]: Loop: 16522#L53 assume main_~s__state~0 == 8576; 16449#L54 main_~tmp___1~0 := main_#t~nondet4;havoc main_#t~nondet4; 16450#L136 assume !(main_~tmp___1~0 == 2);main_~s__state~0 := 8592; 16409#L177 assume true; 16550#L23-1 assume !false; 16548#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 16544#L30 assume !(main_~s__state~0 == 8466); 16540#L33 assume !(main_~s__state~0 == 8496); 16536#L37 assume !(main_~s__state~0 == 8512); 16532#L41 assume !(main_~s__state~0 == 8528); 16529#L45 assume !(main_~s__state~0 == 8544); 16524#L49 assume !(main_~s__state~0 == 8560); 16522#L53 [2018-11-10 12:49:30,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:30,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1257662550, now seen corresponding path program 1 times [2018-11-10 12:49:30,838 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:30,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:30,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:30,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:30,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:30,850 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 12:49:30,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:49:30,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:49:30,850 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:49:30,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:30,850 INFO L82 PathProgramCache]: Analyzing trace with hash 705476484, now seen corresponding path program 1 times [2018-11-10 12:49:30,850 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:30,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:30,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:30,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:30,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:30,876 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:49:30,876 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:49:30,876 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:49:30,876 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:49:30,876 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:49:30,876 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:30,876 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:49:30,876 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:49:30,876 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration11_Loop [2018-11-10 12:49:30,876 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:49:30,877 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:49:30,877 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 12:49:30,894 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 12:49:30,917 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:49:30,917 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/bin-2019/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:30,920 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:49:30,920 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/bin-2019/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:30,959 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:49:30,959 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:49:30,978 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:49:30,979 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:49:30,979 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:49:30,979 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:49:30,980 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:49:30,980 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:49:30,980 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:49:30,980 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:49:30,980 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:49:30,980 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration11_Loop [2018-11-10 12:49:30,980 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:49:30,980 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:49:30,981 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 12:49:30,986 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 12:49:31,012 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:49:31,012 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:49:31,013 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 12:49:31,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:49:31,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:49:31,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:49:31,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:49:31,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:49:31,014 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:49:31,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:49:31,016 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:49:31,017 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:49:31,017 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 12:49:31,017 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:49:31,017 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:49:31,018 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:49:31,018 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8584 Supporting invariants [] [2018-11-10 12:49:31,018 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:49:31,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:31,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:49:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:31,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:49:31,056 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 12:49:31,057 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 12:49:31,057 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 763 states and 974 transitions. cyclomatic complexity: 229 Second operand 4 states. [2018-11-10 12:49:31,163 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 763 states and 974 transitions. cyclomatic complexity: 229. Second operand 4 states. Result 1200 states and 1588 transitions. Complement of second has 9 states. [2018-11-10 12:49:31,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 12:49:31,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:49:31,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2018-11-10 12:49:31,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 176 transitions. Stem has 31 letters. Loop has 12 letters. [2018-11-10 12:49:31,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:31,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 176 transitions. Stem has 43 letters. Loop has 12 letters. [2018-11-10 12:49:31,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:31,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 176 transitions. Stem has 31 letters. Loop has 24 letters. [2018-11-10 12:49:31,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:49:31,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1200 states and 1588 transitions. [2018-11-10 12:49:31,168 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 229 [2018-11-10 12:49:31,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1200 states to 1151 states and 1526 transitions. [2018-11-10 12:49:31,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 350 [2018-11-10 12:49:31,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-11-10 12:49:31,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1151 states and 1526 transitions. [2018-11-10 12:49:31,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:49:31,172 INFO L705 BuchiCegarLoop]: Abstraction has 1151 states and 1526 transitions. [2018-11-10 12:49:31,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states and 1526 transitions. [2018-11-10 12:49:31,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 989. [2018-11-10 12:49:31,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 989 states. [2018-11-10 12:49:31,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1289 transitions. [2018-11-10 12:49:31,179 INFO L728 BuchiCegarLoop]: Abstraction has 989 states and 1289 transitions. [2018-11-10 12:49:31,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:49:31,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:49:31,180 INFO L87 Difference]: Start difference. First operand 989 states and 1289 transitions. Second operand 3 states. [2018-11-10 12:49:31,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:49:31,209 INFO L93 Difference]: Finished difference Result 1061 states and 1335 transitions. [2018-11-10 12:49:31,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:49:31,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1061 states and 1335 transitions. [2018-11-10 12:49:31,213 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 213 [2018-11-10 12:49:31,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1061 states to 994 states and 1260 transitions. [2018-11-10 12:49:31,215 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 313 [2018-11-10 12:49:31,215 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 315 [2018-11-10 12:49:31,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 994 states and 1260 transitions. [2018-11-10 12:49:31,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:49:31,215 INFO L705 BuchiCegarLoop]: Abstraction has 994 states and 1260 transitions. [2018-11-10 12:49:31,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states and 1260 transitions. [2018-11-10 12:49:31,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 970. [2018-11-10 12:49:31,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2018-11-10 12:49:31,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1236 transitions. [2018-11-10 12:49:31,223 INFO L728 BuchiCegarLoop]: Abstraction has 970 states and 1236 transitions. [2018-11-10 12:49:31,223 INFO L608 BuchiCegarLoop]: Abstraction has 970 states and 1236 transitions. [2018-11-10 12:49:31,223 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 12:49:31,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 970 states and 1236 transitions. [2018-11-10 12:49:31,225 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 212 [2018-11-10 12:49:31,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:49:31,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:49:31,225 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:31,225 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:31,226 INFO L793 eck$LassoCheckResult]: Stem: 20665#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 20610#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 20611#L177 assume true; 21076#L23-1 assume !false; 21074#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 21072#L30 assume main_~s__state~0 == 8466; 21070#L31 assume main_~blastFlag~0 == 0;main_~blastFlag~0 := 1; 21067#L79-1 main_~s__state~0 := 8496; 21060#L177 assume true; 21059#L23-1 assume !false; 21057#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 21054#L30 assume !(main_~s__state~0 == 8466); 21051#L33 assume main_~s__state~0 == 8496; 21049#L34 assume main_~blastFlag~0 == 1;main_~blastFlag~0 := 2; 20723#L86-1 assume !(main_~s__hit~0 != 0);main_~s__state~0 := 8512; 20590#L177 assume true; 20591#L23-1 assume !false; 21213#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 21212#L30 assume !(main_~s__state~0 == 8466); 21211#L33 assume !(main_~s__state~0 == 8496); 21210#L37 assume main_~s__state~0 == 8512; 20586#L38 main_~s__state~0 := 8528; 20587#L177 assume true; 20615#L23-1 assume !false; 20616#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 20645#L30 assume !(main_~s__state~0 == 8466); 20646#L33 assume !(main_~s__state~0 == 8496); 20633#L37 assume !(main_~s__state~0 == 8512); 20634#L41 assume main_~s__state~0 == 8528; 20649#L42 main_~s__state~0 := 8544; 21135#L177 assume true; 21133#L23-1 assume !false; 21130#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 21123#L30 assume !(main_~s__state~0 == 8466); 21122#L33 assume !(main_~s__state~0 == 8496); 21121#L37 assume !(main_~s__state~0 == 8512); 21096#L41 assume !(main_~s__state~0 == 8528); 21097#L45 assume !(main_~s__state~0 == 8544); 20825#L49 assume !(main_~s__state~0 == 8560); 20755#L53 assume main_~s__state~0 == 8576; 20618#L54 [2018-11-10 12:49:31,226 INFO L795 eck$LassoCheckResult]: Loop: 20618#L54 main_~tmp___1~0 := main_#t~nondet4;havoc main_#t~nondet4; 20619#L136 assume main_~tmp___1~0 == 2;main_~s__state~0 := 8466; 20642#L177 assume true; 20976#L23-1 assume !false; 20974#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 20972#L30 assume main_~s__state~0 == 8466; 20852#L31 assume !(main_~blastFlag~0 == 0); 20969#L79-1 main_~s__state~0 := 8496; 20967#L177 assume true; 20966#L23-1 assume !false; 20964#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 20962#L30 assume !(main_~s__state~0 == 8466); 20960#L33 assume main_~s__state~0 == 8496; 20823#L34 assume main_~blastFlag~0 == 1;main_~blastFlag~0 := 2; 20957#L86-1 assume !(main_~s__hit~0 != 0);main_~s__state~0 := 8512; 20953#L177 assume true; 20928#L23-1 assume !false; 20921#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 20918#L30 assume !(main_~s__state~0 == 8466); 20915#L33 assume !(main_~s__state~0 == 8496); 20912#L37 assume main_~s__state~0 == 8512; 20816#L38 main_~s__state~0 := 8528; 20909#L177 assume true; 20904#L23-1 assume !false; 20901#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 20897#L30 assume !(main_~s__state~0 == 8466); 20892#L33 assume !(main_~s__state~0 == 8496); 20887#L37 assume !(main_~s__state~0 == 8512); 20882#L41 assume main_~s__state~0 == 8528; 20810#L42 main_~s__state~0 := 8544; 20864#L177 assume true; 20860#L23-1 assume !false; 20856#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 20851#L30 assume !(main_~s__state~0 == 8466); 20822#L33 assume !(main_~s__state~0 == 8496); 20815#L37 assume !(main_~s__state~0 == 8512); 20809#L41 assume !(main_~s__state~0 == 8528); 20803#L45 assume !(main_~s__state~0 == 8544); 20798#L49 assume !(main_~s__state~0 == 8560); 20661#L53 assume main_~s__state~0 == 8576; 20618#L54 [2018-11-10 12:49:31,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:31,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1159567173, now seen corresponding path program 1 times [2018-11-10 12:49:31,226 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:31,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:31,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:31,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:31,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:31,246 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 12:49:31,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:49:31,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:49:31,247 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:49:31,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:31,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1321994618, now seen corresponding path program 1 times [2018-11-10 12:49:31,247 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:31,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:31,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:31,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:31,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:31,262 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 12:49:31,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:49:31,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:49:31,263 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:49:31,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:49:31,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:49:31,263 INFO L87 Difference]: Start difference. First operand 970 states and 1236 transitions. cyclomatic complexity: 284 Second operand 3 states. [2018-11-10 12:49:31,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:49:31,309 INFO L93 Difference]: Finished difference Result 1016 states and 1250 transitions. [2018-11-10 12:49:31,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:49:31,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1016 states and 1250 transitions. [2018-11-10 12:49:31,313 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 206 [2018-11-10 12:49:31,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1016 states to 929 states and 1153 transitions. [2018-11-10 12:49:31,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 301 [2018-11-10 12:49:31,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 303 [2018-11-10 12:49:31,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 929 states and 1153 transitions. [2018-11-10 12:49:31,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:49:31,316 INFO L705 BuchiCegarLoop]: Abstraction has 929 states and 1153 transitions. [2018-11-10 12:49:31,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states and 1153 transitions. [2018-11-10 12:49:31,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 896. [2018-11-10 12:49:31,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-11-10 12:49:31,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1120 transitions. [2018-11-10 12:49:31,324 INFO L728 BuchiCegarLoop]: Abstraction has 896 states and 1120 transitions. [2018-11-10 12:49:31,324 INFO L608 BuchiCegarLoop]: Abstraction has 896 states and 1120 transitions. [2018-11-10 12:49:31,324 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 12:49:31,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 896 states and 1120 transitions. [2018-11-10 12:49:31,326 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 205 [2018-11-10 12:49:31,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:49:31,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:49:31,327 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:31,327 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:31,328 INFO L793 eck$LassoCheckResult]: Stem: 22660#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 22601#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 22602#L177 assume true; 22938#L23-1 assume !false; 22937#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 22936#L30 assume main_~s__state~0 == 8466; 22933#L31 assume main_~blastFlag~0 == 0;main_~blastFlag~0 := 1; 22929#L79-1 main_~s__state~0 := 8496; 22925#L177 assume true; 22922#L23-1 assume !false; 22919#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 22916#L30 assume !(main_~s__state~0 == 8466); 22913#L33 assume main_~s__state~0 == 8496; 22909#L34 assume main_~blastFlag~0 == 1;main_~blastFlag~0 := 2; 22906#L86-1 assume main_~s__hit~0 != 0;main_~s__state~0 := 8656; 22907#L177 assume true; 22793#L23-1 assume !false; 23008#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 23006#L30 assume !(main_~s__state~0 == 8466); 23002#L33 assume !(main_~s__state~0 == 8496); 22735#L37 assume !(main_~s__state~0 == 8512); 22734#L41 assume !(main_~s__state~0 == 8528); 22733#L45 assume !(main_~s__state~0 == 8544); 22732#L49 assume !(main_~s__state~0 == 8560); 22693#L53 assume !(main_~s__state~0 == 8576); 22675#L57 assume !(main_~s__state~0 == 8592); 22635#L61 assume !(main_~s__state~0 == 8608); 22614#L65 assume !(main_~s__state~0 == 8640); 22577#L69 assume main_~s__state~0 == 8656; 22578#L70 assume !(main_~blastFlag~0 == 2); 22628#L163-1 main_~s__state~0 := 8672; 22667#L177 assume true; 22790#L23-1 assume !false; 22787#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 22784#L30 assume !(main_~s__state~0 == 8466); 22780#L33 assume !(main_~s__state~0 == 8496); 22777#L37 assume !(main_~s__state~0 == 8512); 22773#L41 assume !(main_~s__state~0 == 8528); 22769#L45 assume !(main_~s__state~0 == 8544); 22765#L49 assume !(main_~s__state~0 == 8560); 22731#L53 assume !(main_~s__state~0 == 8576); 22729#L57 assume !(main_~s__state~0 == 8592); 22725#L61 assume !(main_~s__state~0 == 8608); 22686#L65 assume !(main_~s__state~0 == 8640); 22682#L69 assume !(main_~s__state~0 == 8656); 22598#L73 [2018-11-10 12:49:31,328 INFO L795 eck$LassoCheckResult]: Loop: 22598#L73 assume main_~s__state~0 == 8672; 22599#L74 assume main_~blastFlag~0 == 4;main_~blastFlag~0 := 5; 22600#L170-1 assume main_~s__hit~0 != 0;main_~s__state~0 := 8640; 22597#L177 assume true; 22988#L23-1 assume !false; 22987#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 22986#L30 assume !(main_~s__state~0 == 8466); 22982#L33 assume !(main_~s__state~0 == 8496); 22978#L37 assume !(main_~s__state~0 == 8512); 22974#L41 assume !(main_~s__state~0 == 8528); 22970#L45 assume !(main_~s__state~0 == 8544); 22583#L49 assume !(main_~s__state~0 == 8560); 22584#L53 assume !(main_~s__state~0 == 8576); 22674#L57 assume !(main_~s__state~0 == 8592); 22633#L61 assume !(main_~s__state~0 == 8608); 22634#L65 assume main_~s__state~0 == 8640; 22668#L66 assume main_~blastFlag~0 == 3;main_~blastFlag~0 := 4; 22664#L152-1 assume !(main_~s__hit~0 != 0);main_~s__state~0 := 8656; 22665#L177 assume true; 22724#L23-1 assume !false; 22718#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 22716#L30 assume !(main_~s__state~0 == 8466); 22714#L33 assume !(main_~s__state~0 == 8496); 22712#L37 assume !(main_~s__state~0 == 8512); 22709#L41 assume !(main_~s__state~0 == 8528); 22706#L45 assume !(main_~s__state~0 == 8544); 22703#L49 assume !(main_~s__state~0 == 8560); 22700#L53 assume !(main_~s__state~0 == 8576); 22697#L57 assume !(main_~s__state~0 == 8592); 22694#L61 assume !(main_~s__state~0 == 8608); 22688#L65 assume !(main_~s__state~0 == 8640); 22575#L69 assume main_~s__state~0 == 8656; 22576#L70 assume main_~blastFlag~0 == 2;main_~blastFlag~0 := 3; 22627#L163-1 main_~s__state~0 := 8672; 22666#L177 assume true; 23000#L23-1 assume !false; 22999#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 22998#L30 assume !(main_~s__state~0 == 8466); 22997#L33 assume !(main_~s__state~0 == 8496); 22996#L37 assume !(main_~s__state~0 == 8512); 22995#L41 assume !(main_~s__state~0 == 8528); 22994#L45 assume !(main_~s__state~0 == 8544); 22993#L49 assume !(main_~s__state~0 == 8560); 22992#L53 assume !(main_~s__state~0 == 8576); 22991#L57 assume !(main_~s__state~0 == 8592); 22990#L61 assume !(main_~s__state~0 == 8608); 22612#L65 assume !(main_~s__state~0 == 8640); 22613#L69 assume !(main_~s__state~0 == 8656); 22598#L73 [2018-11-10 12:49:31,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:31,328 INFO L82 PathProgramCache]: Analyzing trace with hash 305534572, now seen corresponding path program 1 times [2018-11-10 12:49:31,328 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:31,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:31,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:31,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:31,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:31,343 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 12:49:31,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:49:31,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:49:31,343 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:49:31,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:31,343 INFO L82 PathProgramCache]: Analyzing trace with hash -2135774561, now seen corresponding path program 1 times [2018-11-10 12:49:31,343 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:31,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:31,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:31,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:31,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:31,368 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 12:49:31,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:49:31,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:49:31,368 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:49:31,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:49:31,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:49:31,368 INFO L87 Difference]: Start difference. First operand 896 states and 1120 transitions. cyclomatic complexity: 238 Second operand 3 states. [2018-11-10 12:49:31,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:49:31,387 INFO L93 Difference]: Finished difference Result 873 states and 1074 transitions. [2018-11-10 12:49:31,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:49:31,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 873 states and 1074 transitions. [2018-11-10 12:49:31,390 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 205 [2018-11-10 12:49:31,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 873 states to 519 states and 627 transitions. [2018-11-10 12:49:31,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 316 [2018-11-10 12:49:31,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 321 [2018-11-10 12:49:31,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 519 states and 627 transitions. [2018-11-10 12:49:31,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:49:31,392 INFO L705 BuchiCegarLoop]: Abstraction has 519 states and 627 transitions. [2018-11-10 12:49:31,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states and 627 transitions. [2018-11-10 12:49:31,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 519. [2018-11-10 12:49:31,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-11-10 12:49:31,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 627 transitions. [2018-11-10 12:49:31,397 INFO L728 BuchiCegarLoop]: Abstraction has 519 states and 627 transitions. [2018-11-10 12:49:31,397 INFO L608 BuchiCegarLoop]: Abstraction has 519 states and 627 transitions. [2018-11-10 12:49:31,397 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 12:49:31,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 519 states and 627 transitions. [2018-11-10 12:49:31,398 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 205 [2018-11-10 12:49:31,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:49:31,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:49:31,399 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:31,399 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:31,399 INFO L793 eck$LassoCheckResult]: Stem: 24430#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 24378#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 24379#L177 assume true; 24819#L23-1 assume !false; 24818#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 24817#L30 assume main_~s__state~0 == 8466; 24815#L31 assume main_~blastFlag~0 == 0;main_~blastFlag~0 := 1; 24813#L79-1 main_~s__state~0 := 8496; 24748#L177 assume true; 24737#L23-1 assume !false; 24735#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 24733#L30 assume !(main_~s__state~0 == 8466); 24731#L33 assume main_~s__state~0 == 8496; 24726#L34 assume main_~blastFlag~0 == 1;main_~blastFlag~0 := 2; 24723#L86-1 assume main_~s__hit~0 != 0;main_~s__state~0 := 8656; 24429#L177 assume true; 24360#L23-1 assume !false; 24384#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 24414#L30 assume !(main_~s__state~0 == 8466); 24415#L33 assume !(main_~s__state~0 == 8496); 24400#L37 assume !(main_~s__state~0 == 8512); 24401#L41 assume !(main_~s__state~0 == 8528); 24397#L45 assume !(main_~s__state~0 == 8544); 24364#L49 assume !(main_~s__state~0 == 8560); 24365#L53 assume !(main_~s__state~0 == 8576); 24426#L57 assume !(main_~s__state~0 == 8592); 24409#L61 assume !(main_~s__state~0 == 8608); 24390#L65 assume !(main_~s__state~0 == 8640); 24351#L69 assume main_~s__state~0 == 8656; 24352#L70 assume main_~blastFlag~0 == 2;main_~blastFlag~0 := 3; 24404#L163-1 main_~s__state~0 := 8672; 24436#L177 assume true; 24691#L23-1 assume !false; 24725#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 24722#L30 assume !(main_~s__state~0 == 8466); 24721#L33 assume !(main_~s__state~0 == 8496); 24720#L37 assume !(main_~s__state~0 == 8512); 24719#L41 assume !(main_~s__state~0 == 8528); 24717#L45 assume !(main_~s__state~0 == 8544); 24715#L49 assume !(main_~s__state~0 == 8560); 24713#L53 assume !(main_~s__state~0 == 8576); 24444#L57 assume !(main_~s__state~0 == 8592); 24408#L61 assume !(main_~s__state~0 == 8608); 24389#L65 assume !(main_~s__state~0 == 8640); 24349#L69 assume !(main_~s__state~0 == 8656); 24350#L73 [2018-11-10 12:49:31,399 INFO L795 eck$LassoCheckResult]: Loop: 24350#L73 assume main_~s__state~0 == 8672; 24661#L74 assume main_~blastFlag~0 == 4;main_~blastFlag~0 := 5; 24658#L170-1 assume main_~s__hit~0 != 0;main_~s__state~0 := 8640; 24656#L177 assume true; 24654#L23-1 assume !false; 24652#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 24643#L30 assume !(main_~s__state~0 == 8466); 24642#L33 assume !(main_~s__state~0 == 8496); 24641#L37 assume !(main_~s__state~0 == 8512); 24640#L41 assume !(main_~s__state~0 == 8528); 24638#L45 assume !(main_~s__state~0 == 8544); 24635#L49 assume !(main_~s__state~0 == 8560); 24631#L53 assume !(main_~s__state~0 == 8576); 24630#L57 assume !(main_~s__state~0 == 8592); 24629#L61 assume !(main_~s__state~0 == 8608); 24626#L65 assume main_~s__state~0 == 8640; 24434#L66 assume main_~blastFlag~0 == 3;main_~blastFlag~0 := 4; 24432#L152-1 assume !(main_~s__hit~0 != 0);main_~s__state~0 := 8656; 24433#L177 assume true; 24686#L23-1 assume !false; 24684#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 24682#L30 assume !(main_~s__state~0 == 8466); 24680#L33 assume !(main_~s__state~0 == 8496); 24678#L37 assume !(main_~s__state~0 == 8512); 24676#L41 assume !(main_~s__state~0 == 8528); 24674#L45 assume !(main_~s__state~0 == 8544); 24672#L49 assume !(main_~s__state~0 == 8560); 24670#L53 assume !(main_~s__state~0 == 8576); 24668#L57 assume !(main_~s__state~0 == 8592); 24666#L61 assume !(main_~s__state~0 == 8608); 24664#L65 assume !(main_~s__state~0 == 8640); 24650#L69 assume main_~s__state~0 == 8656; 24584#L70 assume main_~blastFlag~0 == 2;main_~blastFlag~0 := 3; 24403#L163-1 main_~s__state~0 := 8672; 24435#L177 assume true; 24685#L23-1 assume !false; 24683#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 24681#L30 assume !(main_~s__state~0 == 8466); 24679#L33 assume !(main_~s__state~0 == 8496); 24677#L37 assume !(main_~s__state~0 == 8512); 24675#L41 assume !(main_~s__state~0 == 8528); 24673#L45 assume !(main_~s__state~0 == 8544); 24671#L49 assume !(main_~s__state~0 == 8560); 24669#L53 assume !(main_~s__state~0 == 8576); 24667#L57 assume !(main_~s__state~0 == 8592); 24665#L61 assume !(main_~s__state~0 == 8608); 24663#L65 assume !(main_~s__state~0 == 8640); 24662#L69 assume !(main_~s__state~0 == 8656); 24350#L73 [2018-11-10 12:49:31,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:31,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1326602926, now seen corresponding path program 1 times [2018-11-10 12:49:31,399 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:31,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:31,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:31,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:31,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:31,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:31,406 INFO L82 PathProgramCache]: Analyzing trace with hash -2135774561, now seen corresponding path program 2 times [2018-11-10 12:49:31,406 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:31,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:31,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:31,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:31,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:31,427 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 12:49:31,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:49:31,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:49:31,428 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:49:31,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:49:31,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:49:31,428 INFO L87 Difference]: Start difference. First operand 519 states and 627 transitions. cyclomatic complexity: 116 Second operand 3 states. [2018-11-10 12:49:31,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:49:31,445 INFO L93 Difference]: Finished difference Result 568 states and 677 transitions. [2018-11-10 12:49:31,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:49:31,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 568 states and 677 transitions. [2018-11-10 12:49:31,448 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 254 [2018-11-10 12:49:31,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 568 states to 568 states and 677 transitions. [2018-11-10 12:49:31,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 370 [2018-11-10 12:49:31,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 370 [2018-11-10 12:49:31,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 568 states and 677 transitions. [2018-11-10 12:49:31,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:49:31,450 INFO L705 BuchiCegarLoop]: Abstraction has 568 states and 677 transitions. [2018-11-10 12:49:31,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states and 677 transitions. [2018-11-10 12:49:31,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2018-11-10 12:49:31,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-11-10 12:49:31,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 677 transitions. [2018-11-10 12:49:31,455 INFO L728 BuchiCegarLoop]: Abstraction has 568 states and 677 transitions. [2018-11-10 12:49:31,455 INFO L608 BuchiCegarLoop]: Abstraction has 568 states and 677 transitions. [2018-11-10 12:49:31,456 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 12:49:31,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 568 states and 677 transitions. [2018-11-10 12:49:31,457 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 254 [2018-11-10 12:49:31,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:49:31,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:49:31,457 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:31,457 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:31,458 INFO L793 eck$LassoCheckResult]: Stem: 25525#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 25471#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 25472#L177 assume true; 25778#L23-1 assume !false; 25776#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 25774#L30 assume main_~s__state~0 == 8466; 25771#L31 assume main_~blastFlag~0 == 0;main_~blastFlag~0 := 1; 25769#L79-1 main_~s__state~0 := 8496; 25767#L177 assume true; 25765#L23-1 assume !false; 25763#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 25761#L30 assume !(main_~s__state~0 == 8466); 25759#L33 assume main_~s__state~0 == 8496; 25757#L34 assume main_~blastFlag~0 == 1;main_~blastFlag~0 := 2; 25753#L86-1 assume main_~s__hit~0 != 0;main_~s__state~0 := 8656; 25522#L177 assume true; 25694#L23-1 assume !false; 25691#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 25688#L30 assume !(main_~s__state~0 == 8466); 25684#L33 assume !(main_~s__state~0 == 8496); 25680#L37 assume !(main_~s__state~0 == 8512); 25675#L41 assume !(main_~s__state~0 == 8528); 25668#L45 assume !(main_~s__state~0 == 8544); 25456#L49 assume !(main_~s__state~0 == 8560); 25457#L53 assume !(main_~s__state~0 == 8576); 25524#L57 assume !(main_~s__state~0 == 8592); 25502#L61 assume !(main_~s__state~0 == 8608); 25483#L65 assume !(main_~s__state~0 == 8640); 25444#L69 assume main_~s__state~0 == 8656; 25445#L70 assume main_~blastFlag~0 == 2;main_~blastFlag~0 := 3; 25497#L163-1 main_~s__state~0 := 8672; 25529#L177 assume true; 25666#L23-1 assume !false; 25849#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 25847#L30 assume !(main_~s__state~0 == 8466); 25845#L33 assume !(main_~s__state~0 == 8496); 25843#L37 assume !(main_~s__state~0 == 8512); 25842#L41 assume !(main_~s__state~0 == 8528); 25840#L45 assume !(main_~s__state~0 == 8544); 25838#L49 assume !(main_~s__state~0 == 8560); 25836#L53 assume !(main_~s__state~0 == 8576); 25834#L57 assume !(main_~s__state~0 == 8592); 25832#L61 assume !(main_~s__state~0 == 8608); 25830#L65 assume !(main_~s__state~0 == 8640); 25828#L69 assume !(main_~s__state~0 == 8656); 25825#L73 [2018-11-10 12:49:31,458 INFO L795 eck$LassoCheckResult]: Loop: 25825#L73 assume main_~s__state~0 == 8672; 25823#L74 assume !(main_~blastFlag~0 == 4); 25821#L173 assume !(main_~blastFlag~0 == 5); 25819#L170-1 assume main_~s__hit~0 != 0;main_~s__state~0 := 8640; 25818#L177 assume true; 25817#L23-1 assume !false; 25814#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 25812#L30 assume !(main_~s__state~0 == 8466); 25810#L33 assume !(main_~s__state~0 == 8496); 25808#L37 assume !(main_~s__state~0 == 8512); 25806#L41 assume !(main_~s__state~0 == 8528); 25804#L45 assume !(main_~s__state~0 == 8544); 25802#L49 assume !(main_~s__state~0 == 8560); 25800#L53 assume !(main_~s__state~0 == 8576); 25798#L57 assume !(main_~s__state~0 == 8592); 25796#L61 assume !(main_~s__state~0 == 8608); 25794#L65 assume main_~s__state~0 == 8640; 25792#L66 assume main_~blastFlag~0 == 3;main_~blastFlag~0 := 4; 25787#L152-1 assume !(main_~s__hit~0 != 0);main_~s__state~0 := 8656; 25788#L177 assume true; 25782#L23-1 assume !false; 25781#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 25779#L30 assume !(main_~s__state~0 == 8466); 25780#L33 assume !(main_~s__state~0 == 8496); 25868#L37 assume !(main_~s__state~0 == 8512); 25866#L41 assume !(main_~s__state~0 == 8528); 25770#L45 assume !(main_~s__state~0 == 8544); 25768#L49 assume !(main_~s__state~0 == 8560); 25766#L53 assume !(main_~s__state~0 == 8576); 25764#L57 assume !(main_~s__state~0 == 8592); 25762#L61 assume !(main_~s__state~0 == 8608); 25760#L65 assume !(main_~s__state~0 == 8640); 25758#L69 assume main_~s__state~0 == 8656; 25756#L70 assume main_~blastFlag~0 == 2;main_~blastFlag~0 := 3; 25755#L163-1 main_~s__state~0 := 8672; 25784#L177 assume true; 25785#L23-1 assume !false; 25880#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 25878#L30 assume !(main_~s__state~0 == 8466); 25777#L33 assume !(main_~s__state~0 == 8496); 25775#L37 assume !(main_~s__state~0 == 8512); 25772#L41 assume !(main_~s__state~0 == 8528); 25773#L45 assume !(main_~s__state~0 == 8544); 25862#L49 assume !(main_~s__state~0 == 8560); 25860#L53 assume !(main_~s__state~0 == 8576); 25858#L57 assume !(main_~s__state~0 == 8592); 25856#L61 assume !(main_~s__state~0 == 8608); 25854#L65 assume !(main_~s__state~0 == 8640); 25827#L69 assume !(main_~s__state~0 == 8656); 25825#L73 [2018-11-10 12:49:31,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:31,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1326602926, now seen corresponding path program 2 times [2018-11-10 12:49:31,458 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:31,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:31,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:31,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:49:31,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:31,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:31,465 INFO L82 PathProgramCache]: Analyzing trace with hash -539592180, now seen corresponding path program 1 times [2018-11-10 12:49:31,465 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:31,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:31,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:31,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:49:31,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:31,495 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 12:49:31,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:49:31,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:49:31,495 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:49:31,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:49:31,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:49:31,496 INFO L87 Difference]: Start difference. First operand 568 states and 677 transitions. cyclomatic complexity: 118 Second operand 3 states. [2018-11-10 12:49:31,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:49:31,501 INFO L93 Difference]: Finished difference Result 541 states and 647 transitions. [2018-11-10 12:49:31,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:49:31,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 541 states and 647 transitions. [2018-11-10 12:49:31,504 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2018-11-10 12:49:31,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 541 states to 437 states and 534 transitions. [2018-11-10 12:49:31,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 270 [2018-11-10 12:49:31,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2018-11-10 12:49:31,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 437 states and 534 transitions. [2018-11-10 12:49:31,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:49:31,505 INFO L705 BuchiCegarLoop]: Abstraction has 437 states and 534 transitions. [2018-11-10 12:49:31,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states and 534 transitions. [2018-11-10 12:49:31,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 436. [2018-11-10 12:49:31,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-11-10 12:49:31,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 533 transitions. [2018-11-10 12:49:31,510 INFO L728 BuchiCegarLoop]: Abstraction has 436 states and 533 transitions. [2018-11-10 12:49:31,510 INFO L608 BuchiCegarLoop]: Abstraction has 436 states and 533 transitions. [2018-11-10 12:49:31,510 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-10 12:49:31,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 436 states and 533 transitions. [2018-11-10 12:49:31,511 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2018-11-10 12:49:31,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:49:31,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:49:31,511 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:31,511 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:31,512 INFO L793 eck$LassoCheckResult]: Stem: 26631#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 26580#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 26581#L177 assume true; 26961#L23-1 assume !false; 26959#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 26958#L30 assume main_~s__state~0 == 8466; 26957#L31 assume main_~blastFlag~0 == 0;main_~blastFlag~0 := 1; 26956#L79-1 main_~s__state~0 := 8496; 26954#L177 assume true; 26952#L23-1 assume !false; 26950#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 26949#L30 assume !(main_~s__state~0 == 8466); 26947#L33 assume main_~s__state~0 == 8496; 26945#L34 assume main_~blastFlag~0 == 1;main_~blastFlag~0 := 2; 26943#L86-1 assume !(main_~s__hit~0 != 0);main_~s__state~0 := 8512; 26941#L177 assume true; 26939#L23-1 assume !false; 26937#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 26936#L30 assume !(main_~s__state~0 == 8466); 26934#L33 assume !(main_~s__state~0 == 8496); 26932#L37 assume main_~s__state~0 == 8512; 26930#L38 main_~s__state~0 := 8528; 26928#L177 assume true; 26926#L23-1 assume !false; 26924#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 26922#L30 assume !(main_~s__state~0 == 8466); 26921#L33 assume !(main_~s__state~0 == 8496); 26919#L37 assume !(main_~s__state~0 == 8512); 26917#L41 assume main_~s__state~0 == 8528; 26915#L42 main_~s__state~0 := 8544; 26913#L177 assume true; 26911#L23-1 assume !false; 26909#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 26908#L30 assume !(main_~s__state~0 == 8466); 26729#L33 assume !(main_~s__state~0 == 8496); 26691#L37 assume !(main_~s__state~0 == 8512); 26690#L41 assume !(main_~s__state~0 == 8528); 26687#L45 assume main_~s__state~0 == 8544; 26641#L46 assume !(main_~s__verify_mode~0 + 1 != 0);main_~s__state~0 := 8560; 26577#L177 assume true; 26719#L23-1 assume !false; 26715#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 26711#L30 assume !(main_~s__state~0 == 8466); 26707#L33 assume !(main_~s__state~0 == 8496); 26703#L37 assume !(main_~s__state~0 == 8512); 26699#L41 assume !(main_~s__state~0 == 8528); 26696#L45 assume !(main_~s__state~0 == 8544); 26694#L49 assume !(main_~s__state~0 == 8560); 26646#L53 assume main_~s__state~0 == 8576; 26586#L54 [2018-11-10 12:49:31,512 INFO L795 eck$LassoCheckResult]: Loop: 26586#L54 main_~tmp___1~0 := main_#t~nondet4;havoc main_#t~nondet4; 26587#L136 assume main_~tmp___1~0 == 2;main_~s__state~0 := 8466; 26563#L177 assume true; 26564#L23-1 assume !false; 26584#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 26977#L30 assume main_~s__state~0 == 8466; 26761#L31 assume !(main_~blastFlag~0 == 0); 26976#L79-1 main_~s__state~0 := 8496; 26975#L177 assume true; 26973#L23-1 assume !false; 26971#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 26969#L30 assume !(main_~s__state~0 == 8466); 26967#L33 assume main_~s__state~0 == 8496; 26758#L34 assume !(main_~blastFlag~0 == 1); 26964#L86-1 assume !(main_~s__hit~0 != 0);main_~s__state~0 := 8512; 26963#L177 assume true; 26962#L23-1 assume !false; 26960#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 26841#L30 assume !(main_~s__state~0 == 8466); 26840#L33 assume !(main_~s__state~0 == 8496); 26839#L37 assume main_~s__state~0 == 8512; 26755#L38 main_~s__state~0 := 8528; 26837#L177 assume true; 26835#L23-1 assume !false; 26833#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 26831#L30 assume !(main_~s__state~0 == 8466); 26829#L33 assume !(main_~s__state~0 == 8496); 26827#L37 assume !(main_~s__state~0 == 8512); 26825#L41 assume main_~s__state~0 == 8528; 26787#L42 main_~s__state~0 := 8544; 26822#L177 assume true; 26820#L23-1 assume !false; 26818#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 26804#L30 assume !(main_~s__state~0 == 8466); 26802#L33 assume !(main_~s__state~0 == 8496); 26801#L37 assume !(main_~s__state~0 == 8512); 26800#L41 assume !(main_~s__state~0 == 8528); 26788#L45 assume main_~s__state~0 == 8544; 26785#L46 assume !(main_~s__verify_mode~0 + 1 != 0);main_~s__state~0 := 8560; 26606#L177 assume true; 26845#L23-1 assume !false; 26844#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 26843#L30 assume !(main_~s__state~0 == 8466); 26792#L33 assume !(main_~s__state~0 == 8496); 26791#L37 assume !(main_~s__state~0 == 8512); 26786#L41 assume !(main_~s__state~0 == 8528); 26784#L45 assume !(main_~s__state~0 == 8544); 26781#L49 assume !(main_~s__state~0 == 8560); 26780#L53 assume main_~s__state~0 == 8576; 26586#L54 [2018-11-10 12:49:31,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:31,512 INFO L82 PathProgramCache]: Analyzing trace with hash 950210311, now seen corresponding path program 1 times [2018-11-10 12:49:31,512 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:31,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:31,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:31,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:31,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:31,535 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-10 12:49:31,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:49:31,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:49:31,536 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:49:31,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:31,537 INFO L82 PathProgramCache]: Analyzing trace with hash 215434726, now seen corresponding path program 1 times [2018-11-10 12:49:31,537 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:31,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:31,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:31,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:31,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:49:31,555 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-10 12:49:31,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:49:31,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:49:31,555 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:49:31,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:49:31,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:49:31,556 INFO L87 Difference]: Start difference. First operand 436 states and 533 transitions. cyclomatic complexity: 104 Second operand 3 states. [2018-11-10 12:49:31,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:49:31,591 INFO L93 Difference]: Finished difference Result 480 states and 566 transitions. [2018-11-10 12:49:31,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:49:31,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 480 states and 566 transitions. [2018-11-10 12:49:31,594 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 146 [2018-11-10 12:49:31,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 480 states to 428 states and 507 transitions. [2018-11-10 12:49:31,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 251 [2018-11-10 12:49:31,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 252 [2018-11-10 12:49:31,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 428 states and 507 transitions. [2018-11-10 12:49:31,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:49:31,595 INFO L705 BuchiCegarLoop]: Abstraction has 428 states and 507 transitions. [2018-11-10 12:49:31,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states and 507 transitions. [2018-11-10 12:49:31,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 427. [2018-11-10 12:49:31,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-11-10 12:49:31,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 506 transitions. [2018-11-10 12:49:31,600 INFO L728 BuchiCegarLoop]: Abstraction has 427 states and 506 transitions. [2018-11-10 12:49:31,600 INFO L608 BuchiCegarLoop]: Abstraction has 427 states and 506 transitions. [2018-11-10 12:49:31,600 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-10 12:49:31,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 427 states and 506 transitions. [2018-11-10 12:49:31,601 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 146 [2018-11-10 12:49:31,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:49:31,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:49:31,601 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:31,601 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:49:31,602 INFO L793 eck$LassoCheckResult]: Stem: 27558#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 27505#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~s__state~0, main_~s__hit~0, main_~s__verify_mode~0, main_~s__session__peer~0, main_~s__s3__tmp__new_cipher__algorithms~0, main_~buf~0, main_~cb~0, main_~blastFlag~0, main_~tmp___1~0;havoc main_~s__state~0;main_~s__hit~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~s__verify_mode~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~s__session__peer~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~s__s3__tmp__new_cipher__algorithms~0 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~buf~0;havoc main_~cb~0;havoc main_~blastFlag~0;havoc main_~tmp___1~0;main_~s__state~0 := 8466;main_~blastFlag~0 := 0; 27506#L177 assume true; 27811#L23-1 assume !false; 27807#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 27803#L30 assume main_~s__state~0 == 8466; 27543#L31 assume main_~blastFlag~0 == 0;main_~blastFlag~0 := 1; 27544#L79-1 main_~s__state~0 := 8496; 27565#L177 assume true; 27791#L23-1 assume !false; 27788#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 27786#L30 assume !(main_~s__state~0 == 8466); 27782#L33 assume main_~s__state~0 == 8496; 27772#L34 assume main_~blastFlag~0 == 1;main_~blastFlag~0 := 2; 27767#L86-1 assume !(main_~s__hit~0 != 0);main_~s__state~0 := 8512; 27762#L177 assume true; 27757#L23-1 assume !false; 27753#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 27752#L30 assume !(main_~s__state~0 == 8466); 27751#L33 assume !(main_~s__state~0 == 8496); 27749#L37 assume main_~s__state~0 == 8512; 27747#L38 main_~s__state~0 := 8528; 27745#L177 assume true; 27743#L23-1 assume !false; 27741#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 27739#L30 assume !(main_~s__state~0 == 8466); 27692#L33 assume !(main_~s__state~0 == 8496); 27689#L37 assume !(main_~s__state~0 == 8512); 27687#L41 assume main_~s__state~0 == 8528; 27685#L42 main_~s__state~0 := 8544; 27683#L177 assume true; 27681#L23-1 assume !false; 27678#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 27676#L30 assume !(main_~s__state~0 == 8466); 27674#L33 assume !(main_~s__state~0 == 8496); 27672#L37 assume !(main_~s__state~0 == 8512); 27670#L41 assume !(main_~s__state~0 == 8528); 27668#L45 assume main_~s__state~0 == 8544; 27666#L46 assume main_~s__verify_mode~0 + 1 != 0; 27551#L106 assume !(main_~s__session__peer~0 != 0); 27493#L113 assume !((main_~s__s3__tmp__new_cipher__algorithms~0 + 256) % 4294967296 != 0); 27494#L121 main_~s__state~0 := 8576; 27663#L177 assume true; 27660#L23-1 assume !false; 27657#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 27654#L30 assume !(main_~s__state~0 == 8466); 27651#L33 assume !(main_~s__state~0 == 8496); 27648#L37 assume !(main_~s__state~0 == 8512); 27645#L41 assume !(main_~s__state~0 == 8528); 27642#L45 assume !(main_~s__state~0 == 8544); 27639#L49 assume !(main_~s__state~0 == 8560); 27569#L53 assume main_~s__state~0 == 8576; 27514#L54 [2018-11-10 12:49:31,602 INFO L795 eck$LassoCheckResult]: Loop: 27514#L54 main_~tmp___1~0 := main_#t~nondet4;havoc main_#t~nondet4; 27515#L136 assume main_~tmp___1~0 == 2;main_~s__state~0 := 8466; 27535#L177 assume true; 27797#L23-1 assume !false; 27796#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 27795#L30 assume main_~s__state~0 == 8466; 27680#L31 assume !(main_~blastFlag~0 == 0); 27792#L79-1 main_~s__state~0 := 8496; 27789#L177 assume true; 27787#L23-1 assume !false; 27784#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 27780#L30 assume !(main_~s__state~0 == 8466); 27777#L33 assume main_~s__state~0 == 8496; 27519#L34 assume !(main_~blastFlag~0 == 1); 27520#L86-1 assume !(main_~s__hit~0 != 0);main_~s__state~0 := 8512; 27553#L177 assume true; 27773#L23-1 assume !false; 27768#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 27763#L30 assume !(main_~s__state~0 == 8466); 27758#L33 assume !(main_~s__state~0 == 8496); 27754#L37 assume main_~s__state~0 == 8512; 27482#L38 main_~s__state~0 := 8528; 27483#L177 assume true; 27775#L23-1 assume !false; 27774#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 27769#L30 assume !(main_~s__state~0 == 8466); 27764#L33 assume !(main_~s__state~0 == 8496); 27759#L37 assume !(main_~s__state~0 == 8512); 27755#L41 assume main_~s__state~0 == 8528; 27547#L42 main_~s__state~0 := 8544; 27548#L177 assume true; 27833#L23-1 assume !false; 27831#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 27829#L30 assume !(main_~s__state~0 == 8466); 27826#L33 assume !(main_~s__state~0 == 8496); 27527#L37 assume !(main_~s__state~0 == 8512); 27528#L41 assume !(main_~s__state~0 == 8528); 27523#L45 assume main_~s__state~0 == 8544; 27524#L46 assume main_~s__verify_mode~0 + 1 != 0; 27550#L106 assume !(main_~s__session__peer~0 != 0); 27509#L113 assume !((main_~s__s3__tmp__new_cipher__algorithms~0 + 256) % 4294967296 != 0); 27688#L121 main_~s__state~0 := 8576; 27686#L177 assume true; 27684#L23-1 assume !false; 27682#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 27679#L30 assume !(main_~s__state~0 == 8466); 27677#L33 assume !(main_~s__state~0 == 8496); 27675#L37 assume !(main_~s__state~0 == 8512); 27673#L41 assume !(main_~s__state~0 == 8528); 27671#L45 assume !(main_~s__state~0 == 8544); 27626#L49 assume !(main_~s__state~0 == 8560); 27624#L53 assume main_~s__state~0 == 8576; 27514#L54 [2018-11-10 12:49:31,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:31,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1987387387, now seen corresponding path program 1 times [2018-11-10 12:49:31,602 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:31,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:31,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:31,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:31,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:31,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:31,612 INFO L82 PathProgramCache]: Analyzing trace with hash -558724932, now seen corresponding path program 1 times [2018-11-10 12:49:31,612 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:31,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:31,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:31,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:31,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:31,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:49:31,620 INFO L82 PathProgramCache]: Analyzing trace with hash 2071429046, now seen corresponding path program 1 times [2018-11-10 12:49:31,620 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:49:31,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:49:31,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:31,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:49:31,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:49:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:49:31,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:49:31 BoogieIcfgContainer [2018-11-10 12:49:31,851 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 12:49:31,851 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:49:31,851 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:49:31,852 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:49:31,852 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:49:27" (3/4) ... [2018-11-10 12:49:31,855 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 12:49:31,903 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_93174c7f-cae9-4e99-b358-738fd41e74f6/bin-2019/uautomizer/witness.graphml [2018-11-10 12:49:31,903 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:49:31,904 INFO L168 Benchmark]: Toolchain (without parser) took 5163.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.8 MB). Free memory was 961.9 MB in the beginning and 1.0 GB in the end (delta: -79.5 MB). Peak memory consumption was 111.3 MB. Max. memory is 11.5 GB. [2018-11-10 12:49:31,905 INFO L168 Benchmark]: CDTParser took 0.11 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 12:49:31,905 INFO L168 Benchmark]: CACSL2BoogieTranslator took 165.03 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 12:49:31,906 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.09 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 12:49:31,906 INFO L168 Benchmark]: Boogie Preprocessor took 12.15 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 12:49:31,906 INFO L168 Benchmark]: RCFGBuilder took 243.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -173.3 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-11-10 12:49:31,906 INFO L168 Benchmark]: BuchiAutomizer took 4666.18 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.8 MB). Peak memory consumption was 123.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:49:31,906 INFO L168 Benchmark]: Witness Printer took 52.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 11.5 GB. [2018-11-10 12:49:31,908 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.11 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 165.03 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 21.09 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. * Boogie Preprocessor took 12.15 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 243.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -173.3 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4666.18 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.8 MB). Peak memory consumption was 123.7 MB. Max. memory is 11.5 GB. * Witness Printer took 52.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 23 terminating modules (14 trivial, 9 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -2 * blastFlag + 1 and consists of 4 locations. One deterministic module has affine ranking function -1 * s__state + 8481 and consists of 4 locations. One deterministic module has affine ranking function -1 * s__state + 8504 and consists of 4 locations. One deterministic module has affine ranking function -1 * s__state + 8520 and consists of 5 locations. One deterministic module has affine ranking function -1 * s__state + 8536 and consists of 5 locations. One deterministic module has affine ranking function -1 * s__state + 8552 and consists of 5 locations. One deterministic module has affine ranking function -1 * s__state + 8664 and consists of 4 locations. One deterministic module has affine ranking function -1 * s__state + 8568 and consists of 5 locations. One deterministic module has affine ranking function -1 * s__state + 8584 and consists of 5 locations. 14 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 427 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.6s and 17 iterations. TraceHistogramMax:6. Analysis of lassos took 2.3s. Construction of modules took 1.0s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 23. Automata minimization 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 1329 StatesRemovedByMinimization, 19 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 970 states and ocurred in iteration 11. Nontrivial modules had stage [9, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1585 SDtfs, 983 SDslu, 865 SDs, 0 SdLazy, 1634 SolverSat, 186 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT2 conc0 concLT3 SILN0 SILU0 SILI5 SILT4 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf98 lsp71 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq193 hnf88 smp100 dnf111 smp95 tf113 neg99 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 9 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 53]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {\result=0, tmp___1=2, cb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@59df6c47=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@639d033d=2, s__session__peer=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4ddee4cd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3ed79179=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@37af6b19=0, s__hit=0, buf=0, blastFlag=2, s__s3__tmp__new_cipher__algorithms=4294967040, s__verify_mode=3, s__state=8576} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 53]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L10] int s__state ; [L11] int s__hit = __VERIFIER_nondet_int() ; [L12] int s__verify_mode = __VERIFIER_nondet_int() ; [L13] int s__session__peer = __VERIFIER_nondet_int() ; [L14] unsigned long s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_long() ; [L15] int buf ; [L16] int cb ; [L17] int blastFlag ; [L18] int tmp___1; [L20] s__state = 8466 [L21] blastFlag = 0 [L23] COND TRUE 1 [L24] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L30] COND TRUE s__state == 8466 [L79] COND TRUE blastFlag == 0 [L80] blastFlag = 1 [L82] s__state = 8496 [L23] COND TRUE 1 [L24] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L30] COND FALSE !(s__state == 8466) [L33] COND TRUE s__state == 8496 [L86] COND TRUE blastFlag == 1 [L87] blastFlag = 2 [L89] COND FALSE !(\read(s__hit)) [L92] s__state = 8512 [L23] COND TRUE 1 [L24] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L30] COND FALSE !(s__state == 8466) [L33] COND FALSE !(s__state == 8496) [L37] COND TRUE s__state == 8512 [L97] s__state = 8528 [L23] COND TRUE 1 [L24] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L30] COND FALSE !(s__state == 8466) [L33] COND FALSE !(s__state == 8496) [L37] COND FALSE !(s__state == 8512) [L41] COND TRUE s__state == 8528 [L101] s__state = 8544 [L23] COND TRUE 1 [L24] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L30] COND FALSE !(s__state == 8466) [L33] COND FALSE !(s__state == 8496) [L37] COND FALSE !(s__state == 8512) [L41] COND FALSE !(s__state == 8528) [L45] COND TRUE s__state == 8544 [L105] COND TRUE s__verify_mode + 1 [L106] COND FALSE !(s__session__peer != 0) [L114] COND FALSE !(s__s3__tmp__new_cipher__algorithms + 256UL) [L122] s__state = 8576 [L23] COND TRUE 1 [L24] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L30] COND FALSE !(s__state == 8466) [L33] COND FALSE !(s__state == 8496) [L37] COND FALSE !(s__state == 8512) [L41] COND FALSE !(s__state == 8528) [L45] COND FALSE !(s__state == 8544) [L49] COND FALSE !(s__state == 8560) [L53] COND TRUE s__state == 8576 Loop: [L135] tmp___1 = __VERIFIER_nondet_int() [L136] COND TRUE tmp___1 == 2 [L137] s__state = 8466 [L23] COND TRUE 1 [L24] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L30] COND TRUE s__state == 8466 [L79] COND FALSE !(blastFlag == 0) [L82] s__state = 8496 [L23] COND TRUE 1 [L24] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L30] COND FALSE !(s__state == 8466) [L33] COND TRUE s__state == 8496 [L86] COND FALSE !(blastFlag == 1) [L89] COND FALSE !(\read(s__hit)) [L92] s__state = 8512 [L23] COND TRUE 1 [L24] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L30] COND FALSE !(s__state == 8466) [L33] COND FALSE !(s__state == 8496) [L37] COND TRUE s__state == 8512 [L97] s__state = 8528 [L23] COND TRUE 1 [L24] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L30] COND FALSE !(s__state == 8466) [L33] COND FALSE !(s__state == 8496) [L37] COND FALSE !(s__state == 8512) [L41] COND TRUE s__state == 8528 [L101] s__state = 8544 [L23] COND TRUE 1 [L24] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L30] COND FALSE !(s__state == 8466) [L33] COND FALSE !(s__state == 8496) [L37] COND FALSE !(s__state == 8512) [L41] COND FALSE !(s__state == 8528) [L45] COND TRUE s__state == 8544 [L105] COND TRUE s__verify_mode + 1 [L106] COND FALSE !(s__session__peer != 0) [L114] COND FALSE !(s__s3__tmp__new_cipher__algorithms + 256UL) [L122] s__state = 8576 [L23] COND TRUE 1 [L24] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L30] COND FALSE !(s__state == 8466) [L33] COND FALSE !(s__state == 8496) [L37] COND FALSE !(s__state == 8512) [L41] COND FALSE !(s__state == 8528) [L45] COND FALSE !(s__state == 8544) [L49] COND FALSE !(s__state == 8560) [L53] COND TRUE s__state == 8576 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...