./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ssh-simplified/s3_srvr_1a.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/ssh-simplified/s3_srvr_1a.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 d8f19e5f85495da246f7b055515ad1966fa98828 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-f470102 [2019-11-28 20:38:52,635 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:38:52,637 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:38:52,653 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:38:52,654 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:38:52,656 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:38:52,657 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:38:52,666 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:38:52,670 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:38:52,672 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:38:52,674 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:38:52,675 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:38:52,676 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:38:52,679 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:38:52,681 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:38:52,683 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:38:52,684 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:38:52,688 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:38:52,691 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:38:52,694 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:38:52,697 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:38:52,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:38:52,703 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:38:52,704 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:38:52,707 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:38:52,708 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:38:52,709 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:38:52,710 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:38:52,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:38:52,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:38:52,713 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:38:52,714 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:38:52,715 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:38:52,716 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:38:52,718 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:38:52,718 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:38:52,719 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:38:52,719 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:38:52,719 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:38:52,721 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:38:52,723 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:38:52,724 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 20:38:52,763 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:38:52,764 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:38:52,765 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:38:52,765 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:38:52,765 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:38:52,766 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:38:52,766 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:38:52,768 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:38:52,768 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:38:52,768 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:38:52,769 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:38:52,769 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:38:52,772 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:38:52,772 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:38:52,772 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:38:52,773 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:38:52,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:38:52,773 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:38:52,773 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:38:52,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:38:52,774 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:38:52,774 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:38:52,775 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:38:52,776 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:38:52,777 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:38:52,777 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:38:52,777 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:38:52,778 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:38:52,778 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:38:52,778 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:38:52,779 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:38:52,779 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:38:52,781 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:38:52,782 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> d8f19e5f85495da246f7b055515ad1966fa98828 [2019-11-28 20:38:53,119 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:38:53,132 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:38:53,136 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:38:53,137 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:38:53,138 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:38:53,138 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh-simplified/s3_srvr_1a.cil.c [2019-11-28 20:38:53,212 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f04f42cc/7161bfd87781443fb81ab1a31f96eeae/FLAG15458d92c [2019-11-28 20:38:53,680 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:38:53,681 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh-simplified/s3_srvr_1a.cil.c [2019-11-28 20:38:53,688 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f04f42cc/7161bfd87781443fb81ab1a31f96eeae/FLAG15458d92c [2019-11-28 20:38:54,055 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f04f42cc/7161bfd87781443fb81ab1a31f96eeae [2019-11-28 20:38:54,059 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:38:54,061 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:38:54,062 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:38:54,062 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:38:54,065 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:38:54,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:38:54" (1/1) ... [2019-11-28 20:38:54,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@612b49be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:54, skipping insertion in model container [2019-11-28 20:38:54,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:38:54" (1/1) ... [2019-11-28 20:38:54,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:38:54,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:38:54,278 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:38:54,282 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:38:54,330 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:38:54,412 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:38:54,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:54 WrapperNode [2019-11-28 20:38:54,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:38:54,416 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:38:54,416 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:38:54,416 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:38:54,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:54" (1/1) ... [2019-11-28 20:38:54,433 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:54" (1/1) ... [2019-11-28 20:38:54,463 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:38:54,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:38:54,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:38:54,464 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:38:54,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:54" (1/1) ... [2019-11-28 20:38:54,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:54" (1/1) ... [2019-11-28 20:38:54,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:54" (1/1) ... [2019-11-28 20:38:54,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:54" (1/1) ... [2019-11-28 20:38:54,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:54" (1/1) ... [2019-11-28 20:38:54,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:54" (1/1) ... [2019-11-28 20:38:54,505 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:54" (1/1) ... [2019-11-28 20:38:54,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:38:54,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:38:54,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:38:54,511 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:38:54,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:54,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:38:54,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:38:54,915 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:38:54,915 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 20:38:54,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:38:54 BoogieIcfgContainer [2019-11-28 20:38:54,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:38:54,917 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:38:54,917 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:38:54,920 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:38:54,921 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:38:54,921 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:38:54" (1/3) ... [2019-11-28 20:38:54,922 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5538d5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:38:54, skipping insertion in model container [2019-11-28 20:38:54,922 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:38:54,922 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:38:54" (2/3) ... [2019-11-28 20:38:54,923 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5538d5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:38:54, skipping insertion in model container [2019-11-28 20:38:54,923 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:38:54,923 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:38:54" (3/3) ... [2019-11-28 20:38:54,925 INFO L371 chiAutomizerObserver]: Analyzing ICFG s3_srvr_1a.cil.c [2019-11-28 20:38:54,970 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:38:54,971 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:38:54,971 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:38:54,971 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:38:54,971 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:38:54,971 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:38:54,971 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:38:54,972 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:38:54,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2019-11-28 20:38:55,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2019-11-28 20:38:55,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:38:55,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:38:55,018 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:38:55,018 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 20:38:55,018 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:38:55,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2019-11-28 20:38:55,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2019-11-28 20:38:55,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:38:55,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:38:55,024 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 20:38:55,024 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 20:38:55,030 INFO L794 eck$LassoCheckResult]: Stem: 39#ULTIMATE.startENTRYtrue 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; 25#L176true [2019-11-28 20:38:55,030 INFO L796 eck$LassoCheckResult]: Loop: 25#L176true assume !false; 15#L23true assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7#L29true assume 8466 == main_~s__state~0; 32#L30true assume !(0 == main_~blastFlag~0); 18#L78-1true main_~s__state~0 := 8496; 25#L176true [2019-11-28 20:38:55,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:38:55,036 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-28 20:38:55,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:38:55,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097931570] [2019-11-28 20:38:55,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:38:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:38:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:38:55,136 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:38:55,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:38:55,138 INFO L82 PathProgramCache]: Analyzing trace with hash 38331118, now seen corresponding path program 1 times [2019-11-28 20:38:55,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:38:55,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866191146] [2019-11-28 20:38:55,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:38:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:38:55,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:38:55,150 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:38:55,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:38:55,152 INFO L82 PathProgramCache]: Analyzing trace with hash 925834799, now seen corresponding path program 1 times [2019-11-28 20:38:55,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:38:55,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692610696] [2019-11-28 20:38:55,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:38:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:38:55,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:38:55,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692610696] [2019-11-28 20:38:55,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:38:55,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:38:55,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054916074] [2019-11-28 20:38:55,287 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:38:55,288 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:38:55,289 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:38:55,289 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:38:55,289 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:38:55,289 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:55,289 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:38:55,289 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:38:55,290 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration1_Loop [2019-11-28 20:38:55,290 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:38:55,290 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:38:55,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:38:55,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:38:55,407 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:38:55,408 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:38:55,420 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:38:55,420 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:38:55,433 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:38:55,434 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:55,448 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 20:38:55,452 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:38:55,452 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:38:55,452 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:38:55,452 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:38:55,452 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:38:55,453 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:55,453 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:38:55,453 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:38:55,453 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration1_Loop [2019-11-28 20:38:55,453 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:38:55,454 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:38:55,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:38:55,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:38:55,528 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:38:55,534 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:38:55,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:38:55,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:38:55,547 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:38:55,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:38:55,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:38:55,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:38:55,551 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:38:55,551 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:55,555 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:38:55,562 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:38:55,562 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:38:55,578 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:38:55,578 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:38:55,579 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:38:55,580 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8481 Supporting invariants [] [2019-11-28 20:38:55,586 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:55,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:38:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:38:55,646 INFO L264 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:38:55,648 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:38:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:38:55,658 INFO L264 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:38:55,659 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:38:55,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:38:55,698 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:38:55,699 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states. Second operand 4 states. [2019-11-28 20:38:55,923 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states.. Second operand 4 states. Result 134 states and 204 transitions. Complement of second has 8 states. [2019-11-28 20:38:55,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 20:38:55,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:38:55,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2019-11-28 20:38:55,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 1 letters. Loop has 5 letters. [2019-11-28 20:38:55,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:38:55,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 6 letters. Loop has 5 letters. [2019-11-28 20:38:55,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:38:55,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 1 letters. Loop has 10 letters. [2019-11-28 20:38:55,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:38:55,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 204 transitions. [2019-11-28 20:38:55,941 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2019-11-28 20:38:55,947 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 80 states and 127 transitions. [2019-11-28 20:38:55,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2019-11-28 20:38:55,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2019-11-28 20:38:55,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 127 transitions. [2019-11-28 20:38:55,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:38:55,950 INFO L688 BuchiCegarLoop]: Abstraction has 80 states and 127 transitions. [2019-11-28 20:38:55,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 127 transitions. [2019-11-28 20:38:55,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 47. [2019-11-28 20:38:55,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 20:38:55,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2019-11-28 20:38:55,984 INFO L711 BuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2019-11-28 20:38:55,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:38:55,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:38:55,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:38:55,989 INFO L87 Difference]: Start difference. First operand 47 states and 73 transitions. Second operand 3 states. [2019-11-28 20:38:56,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:38:56,058 INFO L93 Difference]: Finished difference Result 89 states and 133 transitions. [2019-11-28 20:38:56,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:38:56,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 133 transitions. [2019-11-28 20:38:56,065 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 74 [2019-11-28 20:38:56,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 89 states and 133 transitions. [2019-11-28 20:38:56,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 81 [2019-11-28 20:38:56,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 81 [2019-11-28 20:38:56,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 133 transitions. [2019-11-28 20:38:56,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:38:56,075 INFO L688 BuchiCegarLoop]: Abstraction has 89 states and 133 transitions. [2019-11-28 20:38:56,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 133 transitions. [2019-11-28 20:38:56,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-11-28 20:38:56,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-28 20:38:56,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 133 transitions. [2019-11-28 20:38:56,086 INFO L711 BuchiCegarLoop]: Abstraction has 89 states and 133 transitions. [2019-11-28 20:38:56,086 INFO L591 BuchiCegarLoop]: Abstraction has 89 states and 133 transitions. [2019-11-28 20:38:56,087 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:38:56,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 133 transitions. [2019-11-28 20:38:56,092 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 74 [2019-11-28 20:38:56,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:38:56,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:38:56,095 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 20:38:56,096 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:38:56,096 INFO L794 eck$LassoCheckResult]: Stem: 408#ULTIMATE.startENTRY 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; 395#L176 assume !false; 383#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 370#L29 assume !(8466 == main_~s__state~0); 371#L32 [2019-11-28 20:38:56,096 INFO L796 eck$LassoCheckResult]: Loop: 371#L32 assume 8496 == main_~s__state~0; 379#L33 assume !(1 == main_~blastFlag~0); 406#L85-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 365#L176 assume !false; 450#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 449#L29 assume !(8466 == main_~s__state~0); 371#L32 [2019-11-28 20:38:56,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:38:56,097 INFO L82 PathProgramCache]: Analyzing trace with hash 963407, now seen corresponding path program 1 times [2019-11-28 20:38:56,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:38:56,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996033019] [2019-11-28 20:38:56,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:38:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:38:56,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:38:56,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996033019] [2019-11-28 20:38:56,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:38:56,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 20:38:56,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258947783] [2019-11-28 20:38:56,143 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:38:56,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:38:56,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1630948181, now seen corresponding path program 1 times [2019-11-28 20:38:56,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:38:56,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152266644] [2019-11-28 20:38:56,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:38:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:38:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:38:56,156 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:38:56,193 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:38:56,194 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:38:56,194 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:38:56,194 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:38:56,195 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:38:56,195 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:56,195 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:38:56,195 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:38:56,195 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration2_Loop [2019-11-28 20:38:56,195 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:38:56,196 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:38:56,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:38:56,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:38:56,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:38:56,258 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:38:56,258 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:38:56,271 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:38:56,271 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:56,278 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:38:56,278 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~s__hit~0=7} Honda state: {ULTIMATE.start_main_~s__hit~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:38:56,294 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:38:56,294 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:38:56,323 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:38:56,323 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:56,331 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:38:56,341 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:38:56,342 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:38:56,342 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:38:56,342 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:38:56,342 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:38:56,342 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:56,343 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:38:56,343 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:38:56,343 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration2_Loop [2019-11-28 20:38:56,343 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:38:56,344 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:38:56,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:38:56,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:38:56,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:38:56,403 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:38:56,404 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:38:56,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:38:56,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:38:56,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:38:56,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:38:56,412 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 20:38:56,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:38:56,413 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 20:38:56,413 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:56,416 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:38:56,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:38:56,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:38:56,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:38:56,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:38:56,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:38:56,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:38:56,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:38:56,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:56,438 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:38:56,471 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:38:56,471 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:38:56,488 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:38:56,488 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:38:56,489 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:38:56,489 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8576 Supporting invariants [] Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:56,496 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 20:38:56,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:38:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:38:56,544 INFO L264 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:38:56,544 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:38:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:38:56,551 INFO L264 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:38:56,552 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:38:56,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:38:56,583 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 [2019-11-28 20:38:56,583 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 89 states and 133 transitions. cyclomatic complexity: 47 Second operand 4 states. [2019-11-28 20:38:56,808 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 89 states and 133 transitions. cyclomatic complexity: 47. Second operand 4 states. Result 288 states and 419 transitions. Complement of second has 7 states. [2019-11-28 20:38:56,809 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 [2019-11-28 20:38:56,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:38:56,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2019-11-28 20:38:56,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-28 20:38:56,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:38:56,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-28 20:38:56,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:38:56,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 4 letters. Loop has 12 letters. [2019-11-28 20:38:56,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:38:56,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 288 states and 419 transitions. [2019-11-28 20:38:56,818 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 79 [2019-11-28 20:38:56,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 288 states to 211 states and 320 transitions. [2019-11-28 20:38:56,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2019-11-28 20:38:56,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2019-11-28 20:38:56,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 211 states and 320 transitions. [2019-11-28 20:38:56,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:38:56,822 INFO L688 BuchiCegarLoop]: Abstraction has 211 states and 320 transitions. [2019-11-28 20:38:56,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states and 320 transitions. [2019-11-28 20:38:56,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 122. [2019-11-28 20:38:56,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-28 20:38:56,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 181 transitions. [2019-11-28 20:38:56,834 INFO L711 BuchiCegarLoop]: Abstraction has 122 states and 181 transitions. [2019-11-28 20:38:56,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:38:56,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:38:56,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:38:56,835 INFO L87 Difference]: Start difference. First operand 122 states and 181 transitions. Second operand 3 states. [2019-11-28 20:38:56,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:38:56,900 INFO L93 Difference]: Finished difference Result 76 states and 111 transitions. [2019-11-28 20:38:56,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:38:56,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 111 transitions. [2019-11-28 20:38:56,903 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2019-11-28 20:38:56,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 74 states and 109 transitions. [2019-11-28 20:38:56,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2019-11-28 20:38:56,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2019-11-28 20:38:56,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 109 transitions. [2019-11-28 20:38:56,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:38:56,905 INFO L688 BuchiCegarLoop]: Abstraction has 74 states and 109 transitions. [2019-11-28 20:38:56,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 109 transitions. [2019-11-28 20:38:56,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-28 20:38:56,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-28 20:38:56,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2019-11-28 20:38:56,910 INFO L711 BuchiCegarLoop]: Abstraction has 74 states and 109 transitions. [2019-11-28 20:38:56,910 INFO L591 BuchiCegarLoop]: Abstraction has 74 states and 109 transitions. [2019-11-28 20:38:56,911 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 20:38:56,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 109 transitions. [2019-11-28 20:38:56,912 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2019-11-28 20:38:56,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:38:56,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:38:56,913 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 20:38:56,913 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:38:56,914 INFO L794 eck$LassoCheckResult]: Stem: 1040#ULTIMATE.startENTRY 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; 1041#L176 assume !false; 1059#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1057#L29 assume 8466 == main_~s__state~0; 1056#L30 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 1053#L78-1 main_~s__state~0 := 8496; 1051#L176 assume !false; 1049#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1046#L29 assume !(8466 == main_~s__state~0); 1044#L32 assume !(8496 == main_~s__state~0); 1013#L36 [2019-11-28 20:38:56,914 INFO L796 eck$LassoCheckResult]: Loop: 1013#L36 assume 8512 == main_~s__state~0; 1028#L37 main_~s__state~0 := 8528; 995#L176 assume !false; 1050#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1047#L29 assume !(8466 == main_~s__state~0); 1045#L32 assume !(8496 == main_~s__state~0); 1013#L36 [2019-11-28 20:38:56,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:38:56,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1381923845, now seen corresponding path program 1 times [2019-11-28 20:38:56,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:38:56,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560497949] [2019-11-28 20:38:56,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:38:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:38:56,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:38:56,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560497949] [2019-11-28 20:38:56,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:38:56,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:38:56,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068413638] [2019-11-28 20:38:56,942 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:38:56,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:38:56,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1779937937, now seen corresponding path program 1 times [2019-11-28 20:38:56,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:38:56,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113049078] [2019-11-28 20:38:56,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:38:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:38:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:38:56,958 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:38:56,980 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:38:56,980 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:38:56,980 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:38:56,981 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:38:56,981 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:38:56,981 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:56,981 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:38:56,981 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:38:56,981 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration3_Loop [2019-11-28 20:38:56,982 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:38:56,982 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:38:56,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:38:57,006 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:38:57,007 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:38:57,021 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:38:57,021 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:38:57,042 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:38:57,043 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:57,049 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:38:57,052 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:38:57,053 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:38:57,053 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:38:57,053 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:38:57,053 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:38:57,053 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:57,054 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:38:57,054 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:38:57,054 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration3_Loop [2019-11-28 20:38:57,054 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:38:57,054 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:38:57,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:38:57,082 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:38:57,082 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:38:57,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:38:57,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:38:57,099 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:38:57,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:38:57,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:38:57,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:38:57,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:38:57,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:57,106 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:38:57,110 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:38:57,111 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 20:38:57,121 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:38:57,121 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:38:57,122 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:38:57,122 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8520 Supporting invariants [] [2019-11-28 20:38:57,125 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 20:38:57,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:38:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:38:57,147 INFO L264 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:38:57,148 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:38:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:38:57,154 INFO L264 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:38:57,155 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:38:57,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:38:57,205 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 [2019-11-28 20:38:57,205 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 109 transitions. cyclomatic complexity: 39 Second operand 4 states. [2019-11-28 20:38:57,555 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 109 transitions. cyclomatic complexity: 39. Second operand 4 states. Result 232 states and 347 transitions. Complement of second has 9 states. [2019-11-28 20:38:57,556 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 [2019-11-28 20:38:57,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:38:57,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2019-11-28 20:38:57,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 129 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-28 20:38:57,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:38:57,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 129 transitions. Stem has 16 letters. Loop has 6 letters. [2019-11-28 20:38:57,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:38:57,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 129 transitions. Stem has 10 letters. Loop has 12 letters. [2019-11-28 20:38:57,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:38:57,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 232 states and 347 transitions. [2019-11-28 20:38:57,562 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 62 [2019-11-28 20:38:57,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 232 states to 182 states and 281 transitions. [2019-11-28 20:38:57,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2019-11-28 20:38:57,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 138 [2019-11-28 20:38:57,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 281 transitions. [2019-11-28 20:38:57,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:38:57,566 INFO L688 BuchiCegarLoop]: Abstraction has 182 states and 281 transitions. [2019-11-28 20:38:57,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states and 281 transitions. [2019-11-28 20:38:57,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 102. [2019-11-28 20:38:57,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-28 20:38:57,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 152 transitions. [2019-11-28 20:38:57,572 INFO L711 BuchiCegarLoop]: Abstraction has 102 states and 152 transitions. [2019-11-28 20:38:57,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:38:57,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:38:57,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:38:57,573 INFO L87 Difference]: Start difference. First operand 102 states and 152 transitions. Second operand 3 states. [2019-11-28 20:38:57,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:38:57,653 INFO L93 Difference]: Finished difference Result 113 states and 157 transitions. [2019-11-28 20:38:57,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:38:57,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 157 transitions. [2019-11-28 20:38:57,657 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2019-11-28 20:38:57,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 106 states and 149 transitions. [2019-11-28 20:38:57,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2019-11-28 20:38:57,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2019-11-28 20:38:57,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 149 transitions. [2019-11-28 20:38:57,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:38:57,659 INFO L688 BuchiCegarLoop]: Abstraction has 106 states and 149 transitions. [2019-11-28 20:38:57,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 149 transitions. [2019-11-28 20:38:57,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2019-11-28 20:38:57,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-28 20:38:57,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2019-11-28 20:38:57,669 INFO L711 BuchiCegarLoop]: Abstraction has 104 states and 147 transitions. [2019-11-28 20:38:57,669 INFO L591 BuchiCegarLoop]: Abstraction has 104 states and 147 transitions. [2019-11-28 20:38:57,669 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 20:38:57,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 147 transitions. [2019-11-28 20:38:57,670 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2019-11-28 20:38:57,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:38:57,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:38:57,673 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:38:57,673 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:38:57,673 INFO L794 eck$LassoCheckResult]: Stem: 1644#ULTIMATE.startENTRY 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; 1645#L176 assume !false; 1680#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1678#L29 assume 8466 == main_~s__state~0; 1677#L30 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 1676#L78-1 main_~s__state~0 := 8496; 1674#L176 assume !false; 1671#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1669#L29 assume !(8466 == main_~s__state~0); 1667#L32 assume 8496 == main_~s__state~0; 1665#L33 assume !(1 == main_~blastFlag~0); 1664#L85-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 1661#L176 assume !false; 1659#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1657#L29 assume !(8466 == main_~s__state~0); 1655#L32 assume !(8496 == main_~s__state~0); 1653#L36 assume !(8512 == main_~s__state~0); 1602#L40 [2019-11-28 20:38:57,674 INFO L796 eck$LassoCheckResult]: Loop: 1602#L40 assume 8528 == main_~s__state~0; 1603#L41 main_~s__state~0 := 8544; 1592#L176 assume !false; 1651#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1649#L29 assume !(8466 == main_~s__state~0); 1647#L32 assume !(8496 == main_~s__state~0); 1646#L36 assume !(8512 == main_~s__state~0); 1602#L40 [2019-11-28 20:38:57,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:38:57,675 INFO L82 PathProgramCache]: Analyzing trace with hash 905234773, now seen corresponding path program 1 times [2019-11-28 20:38:57,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:38:57,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55315359] [2019-11-28 20:38:57,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:38:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:38:57,723 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:38:57,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55315359] [2019-11-28 20:38:57,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:38:57,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:38:57,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811427414] [2019-11-28 20:38:57,724 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:38:57,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:38:57,727 INFO L82 PathProgramCache]: Analyzing trace with hash -456689360, now seen corresponding path program 1 times [2019-11-28 20:38:57,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:38:57,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482394927] [2019-11-28 20:38:57,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:38:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:38:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:38:57,739 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 20:38:57,798 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:38:57,798 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:38:57,798 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:38:57,798 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:38:57,798 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:38:57,799 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:57,799 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:38:57,799 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:38:57,799 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration4_Loop [2019-11-28 20:38:57,799 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:38:57,799 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:38:57,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:38:57,826 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:38:57,826 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:38:57,836 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:38:57,836 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 20:38:57,852 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:38:57,853 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:38:57,858 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:38:57,860 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:38:57,860 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:38:57,860 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:38:57,860 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:38:57,861 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:38:57,861 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:57,861 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:38:57,861 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:38:57,861 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration4_Loop [2019-11-28 20:38:57,861 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:38:57,861 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:38:57,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:38:57,882 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:38:57,883 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 20:38:57,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:38:57,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:38:57,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:38:57,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:38:57,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:38:57,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:38:57,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:38:57,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:38:57,893 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:38:57,901 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:38:57,901 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 20:38:57,908 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:38:57,909 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:38:57,909 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:38:57,909 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8536 Supporting invariants [] [2019-11-28 20:38:57,917 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 20:38:57,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:38:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:38:57,941 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:38:57,942 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:38:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:38:57,948 INFO L264 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:38:57,949 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:38:57,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:38:57,964 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 [2019-11-28 20:38:57,964 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 104 states and 147 transitions. cyclomatic complexity: 47 Second operand 4 states. [2019-11-28 20:38:58,167 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 104 states and 147 transitions. cyclomatic complexity: 47. Second operand 4 states. Result 271 states and 397 transitions. Complement of second has 9 states. [2019-11-28 20:38:58,169 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 [2019-11-28 20:38:58,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:38:58,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2019-11-28 20:38:58,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 134 transitions. Stem has 17 letters. Loop has 7 letters. [2019-11-28 20:38:58,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:38:58,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 134 transitions. Stem has 24 letters. Loop has 7 letters. [2019-11-28 20:38:58,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:38:58,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 134 transitions. Stem has 17 letters. Loop has 14 letters. [2019-11-28 20:38:58,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:38:58,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 397 transitions. [2019-11-28 20:38:58,183 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 80 [2019-11-28 20:38:58,185 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 225 states and 335 transitions. [2019-11-28 20:38:58,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2019-11-28 20:38:58,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2019-11-28 20:38:58,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 225 states and 335 transitions. [2019-11-28 20:38:58,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:38:58,187 INFO L688 BuchiCegarLoop]: Abstraction has 225 states and 335 transitions. [2019-11-28 20:38:58,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states and 335 transitions. [2019-11-28 20:38:58,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 146. [2019-11-28 20:38:58,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-28 20:38:58,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 208 transitions. [2019-11-28 20:38:58,203 INFO L711 BuchiCegarLoop]: Abstraction has 146 states and 208 transitions. [2019-11-28 20:38:58,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:38:58,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:38:58,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:38:58,204 INFO L87 Difference]: Start difference. First operand 146 states and 208 transitions. Second operand 3 states. [2019-11-28 20:38:58,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:38:58,224 INFO L93 Difference]: Finished difference Result 182 states and 244 transitions. [2019-11-28 20:38:58,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:38:58,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 244 transitions. [2019-11-28 20:38:58,226 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 88 [2019-11-28 20:38:58,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 182 states and 244 transitions. [2019-11-28 20:38:58,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 112 [2019-11-28 20:38:58,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2019-11-28 20:38:58,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 244 transitions. [2019-11-28 20:38:58,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:38:58,231 INFO L688 BuchiCegarLoop]: Abstraction has 182 states and 244 transitions. [2019-11-28 20:38:58,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states and 244 transitions. [2019-11-28 20:38:58,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2019-11-28 20:38:58,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-11-28 20:38:58,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 244 transitions. [2019-11-28 20:38:58,236 INFO L711 BuchiCegarLoop]: Abstraction has 182 states and 244 transitions. [2019-11-28 20:38:58,236 INFO L591 BuchiCegarLoop]: Abstraction has 182 states and 244 transitions. [2019-11-28 20:38:58,236 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 20:38:58,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 182 states and 244 transitions. [2019-11-28 20:38:58,238 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 88 [2019-11-28 20:38:58,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:38:58,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:38:58,239 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:38:58,239 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:38:58,239 INFO L794 eck$LassoCheckResult]: Stem: 2455#ULTIMATE.startENTRY 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; 2456#L176 assume !false; 2569#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 2567#L29 assume 8466 == main_~s__state~0; 2549#L30 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 2548#L78-1 main_~s__state~0 := 8496; 2547#L176 assume !false; 2544#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 2541#L29 assume !(8466 == main_~s__state~0); 2537#L32 assume 8496 == main_~s__state~0; 2415#L33 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 2451#L85-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 2452#L176 assume !false; 2533#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 2530#L29 assume !(8466 == main_~s__state~0); 2529#L32 assume !(8496 == main_~s__state~0); 2527#L36 assume !(8512 == main_~s__state~0); 2459#L40 assume !(8528 == main_~s__state~0); 2406#L44 [2019-11-28 20:38:58,240 INFO L796 eck$LassoCheckResult]: Loop: 2406#L44 assume 8544 == main_~s__state~0; 2424#L45 assume !(0 != 1 + main_~s__verify_mode~0);main_~s__state~0 := 8560; 2395#L176 assume !false; 2472#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 2468#L29 assume !(8466 == main_~s__state~0); 2464#L32 assume !(8496 == main_~s__state~0); 2460#L36 assume !(8512 == main_~s__state~0); 2458#L40 assume !(8528 == main_~s__state~0); 2406#L44 [2019-11-28 20:38:58,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:38:58,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1193146448, now seen corresponding path program 1 times [2019-11-28 20:38:58,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:38:58,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183682106] [2019-11-28 20:38:58,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:38:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:38:58,287 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 20:38:58,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183682106] [2019-11-28 20:38:58,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:38:58,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:38:58,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261992095] [2019-11-28 20:38:58,289 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:38:58,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:38:58,289 INFO L82 PathProgramCache]: Analyzing trace with hash 594459181, now seen corresponding path program 1 times [2019-11-28 20:38:58,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:38:58,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185853354] [2019-11-28 20:38:58,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:38:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:38:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:38:58,304 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:38:58,348 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:38:58,348 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:38:58,348 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:38:58,348 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:38:58,348 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:38:58,348 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:58,349 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:38:58,349 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:38:58,349 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration5_Loop [2019-11-28 20:38:58,349 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:38:58,349 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:38:58,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:38:58,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:38:58,383 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:38:58,383 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 20:38:58,388 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:38:58,388 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:38:58,392 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:38:58,392 INFO L440 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: [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 20:38:58,398 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:38:58,398 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:58,414 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:38:58,414 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:38:58,421 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:38:58,423 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:38:58,423 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:38:58,423 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:38:58,423 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:38:58,424 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:38:58,424 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:58,424 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:38:58,424 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:38:58,424 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration5_Loop [2019-11-28 20:38:58,424 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:38:58,424 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:38:58,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:38:58,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:38:58,466 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:38:58,468 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:38:58,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:38:58,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:38:58,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:38:58,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:38:58,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:38:58,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:38:58,490 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:38:58,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:38:58,498 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:38:58,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:38:58,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:38:58,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:38:58,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:38:58,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:38:58,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:38:58,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:38:58,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:58,522 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:38:58,525 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:38:58,525 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:38:58,530 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:38:58,530 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:38:58,530 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:38:58,531 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8552 Supporting invariants [] [2019-11-28 20:38:58,541 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:58,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:38:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:38:58,568 INFO L264 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:38:58,569 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:38:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:38:58,581 INFO L264 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:38:58,582 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:38:58,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:38:58,603 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 [2019-11-28 20:38:58,603 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 182 states and 244 transitions. cyclomatic complexity: 68 Second operand 4 states. [2019-11-28 20:38:58,801 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 182 states and 244 transitions. cyclomatic complexity: 68. Second operand 4 states. Result 363 states and 509 transitions. Complement of second has 9 states. [2019-11-28 20:38:58,802 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 [2019-11-28 20:38:58,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:38:58,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2019-11-28 20:38:58,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 141 transitions. Stem has 18 letters. Loop has 8 letters. [2019-11-28 20:38:58,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:38:58,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 141 transitions. Stem has 26 letters. Loop has 8 letters. [2019-11-28 20:38:58,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:38:58,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 141 transitions. Stem has 18 letters. Loop has 16 letters. [2019-11-28 20:38:58,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:38:58,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 363 states and 509 transitions. [2019-11-28 20:38:58,809 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 123 [2019-11-28 20:38:58,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 363 states to 321 states and 451 transitions. [2019-11-28 20:38:58,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 172 [2019-11-28 20:38:58,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 201 [2019-11-28 20:38:58,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 321 states and 451 transitions. [2019-11-28 20:38:58,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:38:58,814 INFO L688 BuchiCegarLoop]: Abstraction has 321 states and 451 transitions. [2019-11-28 20:38:58,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states and 451 transitions. [2019-11-28 20:38:58,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 247. [2019-11-28 20:38:58,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-11-28 20:38:58,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 337 transitions. [2019-11-28 20:38:58,820 INFO L711 BuchiCegarLoop]: Abstraction has 247 states and 337 transitions. [2019-11-28 20:38:58,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:38:58,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:38:58,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:38:58,821 INFO L87 Difference]: Start difference. First operand 247 states and 337 transitions. Second operand 3 states. [2019-11-28 20:38:58,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:38:58,876 INFO L93 Difference]: Finished difference Result 281 states and 366 transitions. [2019-11-28 20:38:58,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:38:58,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 281 states and 366 transitions. [2019-11-28 20:38:58,880 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 108 [2019-11-28 20:38:58,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 281 states to 260 states and 342 transitions. [2019-11-28 20:38:58,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 143 [2019-11-28 20:38:58,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 144 [2019-11-28 20:38:58,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 260 states and 342 transitions. [2019-11-28 20:38:58,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:38:58,883 INFO L688 BuchiCegarLoop]: Abstraction has 260 states and 342 transitions. [2019-11-28 20:38:58,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states and 342 transitions. [2019-11-28 20:38:58,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2019-11-28 20:38:58,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-28 20:38:58,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 340 transitions. [2019-11-28 20:38:58,889 INFO L711 BuchiCegarLoop]: Abstraction has 258 states and 340 transitions. [2019-11-28 20:38:58,889 INFO L591 BuchiCegarLoop]: Abstraction has 258 states and 340 transitions. [2019-11-28 20:38:58,889 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 20:38:58,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 258 states and 340 transitions. [2019-11-28 20:38:58,891 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 107 [2019-11-28 20:38:58,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:38:58,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:38:58,892 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:38:58,892 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:38:58,893 INFO L794 eck$LassoCheckResult]: Stem: 3639#ULTIMATE.startENTRY 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; 3640#L176 assume !false; 3764#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 3762#L29 assume 8466 == main_~s__state~0; 3761#L30 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 3760#L78-1 main_~s__state~0 := 8496; 3759#L176 assume !false; 3754#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 3748#L29 assume !(8466 == main_~s__state~0); 3737#L32 assume 8496 == main_~s__state~0; 3716#L33 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 3712#L85-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 3709#L176 assume !false; 3707#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 3705#L29 assume !(8466 == main_~s__state~0); 3703#L32 assume !(8496 == main_~s__state~0); 3701#L36 assume !(8512 == main_~s__state~0); 3697#L40 assume !(8528 == main_~s__state~0); 3652#L44 assume !(8544 == main_~s__state~0); 3619#L48 [2019-11-28 20:38:58,893 INFO L796 eck$LassoCheckResult]: Loop: 3619#L48 assume 8560 == main_~s__state~0; 3573#L49 main_~s__state~0 := 8576; 3574#L176 assume !false; 3662#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 3658#L29 assume !(8466 == main_~s__state~0); 3655#L32 assume !(8496 == main_~s__state~0); 3650#L36 assume !(8512 == main_~s__state~0); 3648#L40 assume !(8528 == main_~s__state~0); 3647#L44 assume !(8544 == main_~s__state~0); 3619#L48 [2019-11-28 20:38:58,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:38:58,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1818454854, now seen corresponding path program 1 times [2019-11-28 20:38:58,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:38:58,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419971678] [2019-11-28 20:38:58,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:38:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:38:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:38:58,930 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:38:58,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:38:58,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1734491453, now seen corresponding path program 1 times [2019-11-28 20:38:58,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:38:58,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711258977] [2019-11-28 20:38:58,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:38:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:38:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:38:58,954 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:38:58,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:38:58,955 INFO L82 PathProgramCache]: Analyzing trace with hash 566159524, now seen corresponding path program 1 times [2019-11-28 20:38:58,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:38:58,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019886214] [2019-11-28 20:38:58,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:38:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:38:58,992 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 20:38:58,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019886214] [2019-11-28 20:38:58,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:38:58,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:38:58,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046295416] [2019-11-28 20:38:59,016 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:38:59,016 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:38:59,016 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:38:59,017 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:38:59,017 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:38:59,017 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:59,017 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:38:59,017 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:38:59,017 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration6_Loop [2019-11-28 20:38:59,017 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:38:59,017 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:38:59,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:38:59,040 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:38:59,040 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:38:59,046 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:38:59,046 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:38:59,058 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:38:59,058 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:59,063 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:38:59,065 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:38:59,065 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:38:59,066 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:38:59,066 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:38:59,066 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:38:59,066 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:59,066 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:38:59,066 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:38:59,066 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration6_Loop [2019-11-28 20:38:59,066 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:38:59,066 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:38:59,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:38:59,087 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:38:59,088 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:38:59,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:38:59,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:38:59,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:38:59,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:38:59,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:38:59,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:38:59,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:38:59,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:59,103 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:38:59,107 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:38:59,107 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:59,111 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:38:59,111 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:38:59,111 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:38:59,111 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8568 Supporting invariants [] [2019-11-28 20:38:59,113 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 20:38:59,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:38:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:38:59,154 INFO L264 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:38:59,155 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:38:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:38:59,168 INFO L264 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:38:59,169 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:38:59,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:38:59,190 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 [2019-11-28 20:38:59,190 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 258 states and 340 transitions. cyclomatic complexity: 89 Second operand 4 states. [2019-11-28 20:38:59,372 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 258 states and 340 transitions. cyclomatic complexity: 89. Second operand 4 states. Result 460 states and 639 transitions. Complement of second has 9 states. [2019-11-28 20:38:59,373 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 [2019-11-28 20:38:59,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:38:59,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2019-11-28 20:38:59,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 166 transitions. Stem has 19 letters. Loop has 9 letters. [2019-11-28 20:38:59,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:38:59,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 166 transitions. Stem has 28 letters. Loop has 9 letters. [2019-11-28 20:38:59,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:38:59,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 166 transitions. Stem has 19 letters. Loop has 18 letters. [2019-11-28 20:38:59,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:38:59,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 460 states and 639 transitions. [2019-11-28 20:38:59,379 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 159 [2019-11-28 20:38:59,382 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 460 states to 425 states and 589 transitions. [2019-11-28 20:38:59,382 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 219 [2019-11-28 20:38:59,383 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 245 [2019-11-28 20:38:59,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 425 states and 589 transitions. [2019-11-28 20:38:59,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:38:59,384 INFO L688 BuchiCegarLoop]: Abstraction has 425 states and 589 transitions. [2019-11-28 20:38:59,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states and 589 transitions. [2019-11-28 20:38:59,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 343. [2019-11-28 20:38:59,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-11-28 20:38:59,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 460 transitions. [2019-11-28 20:38:59,391 INFO L711 BuchiCegarLoop]: Abstraction has 343 states and 460 transitions. [2019-11-28 20:38:59,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:38:59,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:38:59,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:38:59,392 INFO L87 Difference]: Start difference. First operand 343 states and 460 transitions. Second operand 3 states. [2019-11-28 20:38:59,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:38:59,462 INFO L93 Difference]: Finished difference Result 397 states and 510 transitions. [2019-11-28 20:38:59,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:38:59,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 397 states and 510 transitions. [2019-11-28 20:38:59,465 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 154 [2019-11-28 20:38:59,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 397 states to 372 states and 485 transitions. [2019-11-28 20:38:59,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 223 [2019-11-28 20:38:59,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 230 [2019-11-28 20:38:59,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 372 states and 485 transitions. [2019-11-28 20:38:59,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:38:59,468 INFO L688 BuchiCegarLoop]: Abstraction has 372 states and 485 transitions. [2019-11-28 20:38:59,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states and 485 transitions. [2019-11-28 20:38:59,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 336. [2019-11-28 20:38:59,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-28 20:38:59,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 448 transitions. [2019-11-28 20:38:59,474 INFO L711 BuchiCegarLoop]: Abstraction has 336 states and 448 transitions. [2019-11-28 20:38:59,474 INFO L591 BuchiCegarLoop]: Abstraction has 336 states and 448 transitions. [2019-11-28 20:38:59,474 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 20:38:59,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 336 states and 448 transitions. [2019-11-28 20:38:59,476 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 152 [2019-11-28 20:38:59,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:38:59,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:38:59,477 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:38:59,477 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:38:59,477 INFO L794 eck$LassoCheckResult]: Stem: 5214#ULTIMATE.startENTRY 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; 5215#L176 assume !false; 5462#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 5459#L29 assume 8466 == main_~s__state~0; 5200#L30 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 5201#L78-1 main_~s__state~0 := 8496; 5475#L176 assume !false; 5473#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 5471#L29 assume !(8466 == main_~s__state~0); 5469#L32 assume 8496 == main_~s__state~0; 5217#L33 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 5209#L85-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 5168#L176 [2019-11-28 20:38:59,478 INFO L796 eck$LassoCheckResult]: Loop: 5168#L176 assume !false; 5170#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 5153#L29 assume !(8466 == main_~s__state~0); 5154#L32 assume !(8496 == main_~s__state~0); 5164#L36 assume !(8512 == main_~s__state~0); 5157#L40 assume !(8528 == main_~s__state~0); 5158#L44 assume !(8544 == main_~s__state~0); 5191#L48 assume !(8560 == main_~s__state~0); 5192#L52 assume !(8576 == main_~s__state~0); 5185#L56 assume !(8592 == main_~s__state~0); 5149#L60 assume !(8608 == main_~s__state~0); 5150#L64 assume !(8640 == main_~s__state~0); 5216#L68 assume 8656 == main_~s__state~0; 5143#L69 assume 2 == main_~blastFlag~0;main_~blastFlag~0 := 3; 5144#L162-1 main_~s__state~0 := 8672; 5168#L176 [2019-11-28 20:38:59,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:38:59,478 INFO L82 PathProgramCache]: Analyzing trace with hash -883919713, now seen corresponding path program 1 times [2019-11-28 20:38:59,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:38:59,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283986686] [2019-11-28 20:38:59,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:38:59,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:38:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:38:59,486 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:38:59,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:38:59,487 INFO L82 PathProgramCache]: Analyzing trace with hash -15441655, now seen corresponding path program 1 times [2019-11-28 20:38:59,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:38:59,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436734439] [2019-11-28 20:38:59,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:38:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:38:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:38:59,493 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:38:59,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:38:59,494 INFO L82 PathProgramCache]: Analyzing trace with hash 2052349099, now seen corresponding path program 1 times [2019-11-28 20:38:59,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:38:59,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200685994] [2019-11-28 20:38:59,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:38:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:38:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:38:59,505 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:38:59,540 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:38:59,540 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:38:59,540 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:38:59,540 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:38:59,541 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:38:59,541 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:59,541 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:38:59,541 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:38:59,541 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration7_Loop [2019-11-28 20:38:59,541 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:38:59,541 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:38:59,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:38:59,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:38:59,588 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:38:59,589 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:38:59,600 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:38:59,600 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:38:59,610 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:38:59,611 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:59,618 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:38:59,620 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:38:59,620 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:38:59,620 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:38:59,620 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:38:59,620 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:38:59,620 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:59,620 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:38:59,620 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:38:59,621 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration7_Loop [2019-11-28 20:38:59,621 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:38:59,621 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:38:59,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:38:59,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:38:59,664 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:38:59,664 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:38:59,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:38:59,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:38:59,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:38:59,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:38:59,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:38:59,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:38:59,679 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:38:59,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:59,682 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:38:59,685 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:38:59,685 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:38:59,689 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:38:59,690 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:38:59,690 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:38:59,690 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8664 Supporting invariants [] [2019-11-28 20:38:59,700 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:38:59,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:38:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:38:59,730 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:38:59,731 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:38:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:38:59,737 INFO L264 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:38:59,738 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:38:59,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:38:59,750 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 20:38:59,750 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 336 states and 448 transitions. cyclomatic complexity: 120 Second operand 4 states. [2019-11-28 20:38:59,800 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 336 states and 448 transitions. cyclomatic complexity: 120. Second operand 4 states. Result 442 states and 583 transitions. Complement of second has 7 states. [2019-11-28 20:38:59,802 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 [2019-11-28 20:38:59,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 20:38:59,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2019-11-28 20:38:59,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 12 letters. Loop has 15 letters. [2019-11-28 20:38:59,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:38:59,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 27 letters. Loop has 15 letters. [2019-11-28 20:38:59,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:38:59,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 12 letters. Loop has 30 letters. [2019-11-28 20:38:59,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:38:59,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 442 states and 583 transitions. [2019-11-28 20:38:59,810 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 220 [2019-11-28 20:38:59,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 442 states to 436 states and 575 transitions. [2019-11-28 20:38:59,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 278 [2019-11-28 20:38:59,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 279 [2019-11-28 20:38:59,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 436 states and 575 transitions. [2019-11-28 20:38:59,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:38:59,815 INFO L688 BuchiCegarLoop]: Abstraction has 436 states and 575 transitions. [2019-11-28 20:38:59,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states and 575 transitions. [2019-11-28 20:38:59,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 432. [2019-11-28 20:38:59,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-11-28 20:38:59,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 570 transitions. [2019-11-28 20:38:59,823 INFO L711 BuchiCegarLoop]: Abstraction has 432 states and 570 transitions. [2019-11-28 20:38:59,823 INFO L591 BuchiCegarLoop]: Abstraction has 432 states and 570 transitions. [2019-11-28 20:38:59,823 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 20:38:59,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 432 states and 570 transitions. [2019-11-28 20:38:59,826 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 220 [2019-11-28 20:38:59,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:38:59,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:38:59,828 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:38:59,828 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:38:59,829 INFO L794 eck$LassoCheckResult]: Stem: 6109#ULTIMATE.startENTRY 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; 6110#L176 assume !false; 6303#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 6302#L29 assume 8466 == main_~s__state~0; 6301#L30 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 6300#L78-1 main_~s__state~0 := 8496; 6256#L176 assume !false; 6253#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 6250#L29 assume !(8466 == main_~s__state~0); 6248#L32 assume 8496 == main_~s__state~0; 6246#L33 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 6244#L85-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 6104#L176 assume !false; 6247#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 6245#L29 assume !(8466 == main_~s__state~0); 6243#L32 assume !(8496 == main_~s__state~0); 6241#L36 assume !(8512 == main_~s__state~0); 6238#L40 assume !(8528 == main_~s__state~0); 6235#L44 assume !(8544 == main_~s__state~0); 6230#L48 assume !(8560 == main_~s__state~0); 6227#L52 assume !(8576 == main_~s__state~0); 6222#L56 assume !(8592 == main_~s__state~0); 6219#L60 assume !(8608 == main_~s__state~0); 6111#L64 assume !(8640 == main_~s__state~0); 6112#L68 assume !(8656 == main_~s__state~0); 6091#L72 [2019-11-28 20:38:59,829 INFO L796 eck$LassoCheckResult]: Loop: 6091#L72 assume 8672 == main_~s__state~0; 6050#L73 assume 4 == main_~blastFlag~0;main_~blastFlag~0 := 5; 6051#L169-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8640; 6032#L176 assume !false; 6335#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 6333#L29 assume !(8466 == main_~s__state~0); 6328#L32 assume !(8496 == main_~s__state~0); 6323#L36 assume !(8512 == main_~s__state~0); 6318#L40 assume !(8528 == main_~s__state~0); 6271#L44 assume !(8544 == main_~s__state~0); 6272#L48 assume !(8560 == main_~s__state~0); 6284#L52 assume !(8576 == main_~s__state~0); 6135#L56 assume !(8592 == main_~s__state~0); 6035#L60 assume !(8608 == main_~s__state~0); 6037#L64 assume !(8640 == main_~s__state~0); 6182#L68 assume !(8656 == main_~s__state~0); 6091#L72 [2019-11-28 20:38:59,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:38:59,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1204368937, now seen corresponding path program 1 times [2019-11-28 20:38:59,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:38:59,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689159217] [2019-11-28 20:38:59,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:38:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:38:59,870 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 20:38:59,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689159217] [2019-11-28 20:38:59,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:38:59,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:38:59,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352499090] [2019-11-28 20:38:59,871 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:38:59,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:38:59,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1774399381, now seen corresponding path program 1 times [2019-11-28 20:38:59,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:38:59,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122028395] [2019-11-28 20:38:59,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:38:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:38:59,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:38:59,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122028395] [2019-11-28 20:38:59,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:38:59,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:38:59,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097577751] [2019-11-28 20:38:59,895 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:38:59,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:38:59,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:38:59,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:38:59,896 INFO L87 Difference]: Start difference. First operand 432 states and 570 transitions. cyclomatic complexity: 148 Second operand 3 states. [2019-11-28 20:38:59,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:38:59,963 INFO L93 Difference]: Finished difference Result 409 states and 528 transitions. [2019-11-28 20:38:59,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:38:59,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 409 states and 528 transitions. [2019-11-28 20:38:59,968 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 194 [2019-11-28 20:38:59,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 409 states to 409 states and 528 transitions. [2019-11-28 20:38:59,971 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 252 [2019-11-28 20:38:59,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 252 [2019-11-28 20:38:59,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 409 states and 528 transitions. [2019-11-28 20:38:59,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:38:59,972 INFO L688 BuchiCegarLoop]: Abstraction has 409 states and 528 transitions. [2019-11-28 20:38:59,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states and 528 transitions. [2019-11-28 20:38:59,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 376. [2019-11-28 20:38:59,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-11-28 20:38:59,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 491 transitions. [2019-11-28 20:38:59,980 INFO L711 BuchiCegarLoop]: Abstraction has 376 states and 491 transitions. [2019-11-28 20:38:59,980 INFO L591 BuchiCegarLoop]: Abstraction has 376 states and 491 transitions. [2019-11-28 20:38:59,981 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 20:38:59,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 376 states and 491 transitions. [2019-11-28 20:38:59,983 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 161 [2019-11-28 20:38:59,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:38:59,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:38:59,985 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:38:59,985 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:38:59,986 INFO L794 eck$LassoCheckResult]: Stem: 6955#ULTIMATE.startENTRY 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; 6956#L176 assume !false; 7168#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7148#L29 assume 8466 == main_~s__state~0; 7147#L30 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 7146#L78-1 main_~s__state~0 := 8496; 7145#L176 assume !false; 7144#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7143#L29 assume !(8466 == main_~s__state~0); 7141#L32 assume 8496 == main_~s__state~0; 7139#L33 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 7136#L85-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 6953#L176 assume !false; 7134#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7243#L29 assume !(8466 == main_~s__state~0); 7242#L32 assume !(8496 == main_~s__state~0); 7241#L36 assume !(8512 == main_~s__state~0); 7240#L40 assume !(8528 == main_~s__state~0); 7239#L44 assume !(8544 == main_~s__state~0); 7237#L48 assume !(8560 == main_~s__state~0); 7235#L52 assume !(8576 == main_~s__state~0); 7234#L56 assume !(8592 == main_~s__state~0); 7233#L60 assume !(8608 == main_~s__state~0); 6957#L64 assume !(8640 == main_~s__state~0); 6958#L68 assume !(8656 == main_~s__state~0); 6940#L72 [2019-11-28 20:38:59,986 INFO L796 eck$LassoCheckResult]: Loop: 6940#L72 assume 8672 == main_~s__state~0; 6897#L73 assume 4 == main_~blastFlag~0;main_~blastFlag~0 := 5; 6898#L169-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8640; 6928#L176 assume !false; 6907#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 6889#L29 assume !(8466 == main_~s__state~0); 6890#L32 assume !(8496 == main_~s__state~0); 7248#L36 assume !(8512 == main_~s__state~0); 7247#L40 assume !(8528 == main_~s__state~0); 7246#L44 assume !(8544 == main_~s__state~0); 6930#L48 assume !(8560 == main_~s__state~0); 6931#L52 assume !(8576 == main_~s__state~0); 6919#L56 assume !(8592 == main_~s__state~0); 6920#L60 assume !(8608 == main_~s__state~0); 7149#L64 assume 8640 == main_~s__state~0; 6906#L65 assume 3 == main_~blastFlag~0;main_~blastFlag~0 := 4; 6903#L151-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8656; 6904#L176 assume !false; 7250#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7249#L29 assume !(8466 == main_~s__state~0); 6900#L32 assume !(8496 == main_~s__state~0); 6901#L36 assume !(8512 == main_~s__state~0); 6893#L40 assume !(8528 == main_~s__state~0); 6894#L44 assume !(8544 == main_~s__state~0); 6962#L48 assume !(8560 == main_~s__state~0); 7245#L52 assume !(8576 == main_~s__state~0); 7244#L56 assume !(8592 == main_~s__state~0); 6883#L60 assume !(8608 == main_~s__state~0); 6884#L64 assume !(8640 == main_~s__state~0); 7232#L68 assume !(8656 == main_~s__state~0); 6940#L72 [2019-11-28 20:38:59,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:38:59,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1204368937, now seen corresponding path program 2 times [2019-11-28 20:38:59,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:38:59,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773227392] [2019-11-28 20:38:59,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:38:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:00,003 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 20:39:00,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773227392] [2019-11-28 20:39:00,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:00,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:39:00,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612841231] [2019-11-28 20:39:00,005 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:39:00,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:00,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1325834225, now seen corresponding path program 1 times [2019-11-28 20:39:00,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:00,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193457799] [2019-11-28 20:39:00,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:00,023 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:00,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193457799] [2019-11-28 20:39:00,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:00,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:00,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791603685] [2019-11-28 20:39:00,024 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:00,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:00,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:00,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:00,025 INFO L87 Difference]: Start difference. First operand 376 states and 491 transitions. cyclomatic complexity: 125 Second operand 3 states. [2019-11-28 20:39:00,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:00,090 INFO L93 Difference]: Finished difference Result 413 states and 527 transitions. [2019-11-28 20:39:00,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:00,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 413 states and 527 transitions. [2019-11-28 20:39:00,094 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 174 [2019-11-28 20:39:00,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 413 states to 401 states and 515 transitions. [2019-11-28 20:39:00,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 232 [2019-11-28 20:39:00,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 232 [2019-11-28 20:39:00,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 401 states and 515 transitions. [2019-11-28 20:39:00,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:39:00,098 INFO L688 BuchiCegarLoop]: Abstraction has 401 states and 515 transitions. [2019-11-28 20:39:00,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states and 515 transitions. [2019-11-28 20:39:00,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 389. [2019-11-28 20:39:00,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-11-28 20:39:00,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 503 transitions. [2019-11-28 20:39:00,105 INFO L711 BuchiCegarLoop]: Abstraction has 389 states and 503 transitions. [2019-11-28 20:39:00,106 INFO L591 BuchiCegarLoop]: Abstraction has 389 states and 503 transitions. [2019-11-28 20:39:00,106 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 20:39:00,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 389 states and 503 transitions. [2019-11-28 20:39:00,108 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 174 [2019-11-28 20:39:00,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:00,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:00,109 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:00,110 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:00,110 INFO L794 eck$LassoCheckResult]: Stem: 7754#ULTIMATE.startENTRY 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; 7755#L176 assume !false; 7966#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7965#L29 assume 8466 == main_~s__state~0; 7964#L30 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 7963#L78-1 main_~s__state~0 := 8496; 7962#L176 assume !false; 7961#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7960#L29 assume !(8466 == main_~s__state~0); 7959#L32 assume 8496 == main_~s__state~0; 7957#L33 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 7955#L85-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 7953#L176 assume !false; 7951#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7949#L29 assume !(8466 == main_~s__state~0); 7948#L32 assume !(8496 == main_~s__state~0); 7935#L36 assume 8512 == main_~s__state~0; 7724#L37 main_~s__state~0 := 8528; 7725#L176 assume !false; 7703#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7704#L29 assume !(8466 == main_~s__state~0); 8047#L32 assume !(8496 == main_~s__state~0); 7720#L36 assume !(8512 == main_~s__state~0); 7721#L40 assume !(8528 == main_~s__state~0); 7972#L44 assume !(8544 == main_~s__state~0); 7764#L48 assume !(8560 == main_~s__state~0); 7765#L52 [2019-11-28 20:39:00,110 INFO L796 eck$LassoCheckResult]: Loop: 7765#L52 assume !(8576 == main_~s__state~0); 7767#L56 assume 8592 == main_~s__state~0; 7762#L57 main_~s__state~0 := 8608; 7676#L176 assume !false; 7877#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7874#L29 assume !(8466 == main_~s__state~0); 7871#L32 assume !(8496 == main_~s__state~0); 7868#L36 assume !(8512 == main_~s__state~0); 7865#L40 assume !(8528 == main_~s__state~0); 7862#L44 assume !(8544 == main_~s__state~0); 7860#L48 assume !(8560 == main_~s__state~0); 7765#L52 [2019-11-28 20:39:00,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:00,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1695835077, now seen corresponding path program 1 times [2019-11-28 20:39:00,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:00,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508272952] [2019-11-28 20:39:00,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:00,137 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-28 20:39:00,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508272952] [2019-11-28 20:39:00,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:00,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:00,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197057026] [2019-11-28 20:39:00,139 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:39:00,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:00,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1642596384, now seen corresponding path program 1 times [2019-11-28 20:39:00,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:00,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862083832] [2019-11-28 20:39:00,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:00,147 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:00,171 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:39:00,171 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:39:00,171 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:39:00,171 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:39:00,171 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:39:00,171 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:39:00,172 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:39:00,172 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:39:00,172 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration10_Loop [2019-11-28 20:39:00,172 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:39:00,172 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:39:00,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:39:00,193 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:39:00,194 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:39:00,199 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:39:00,200 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:39:00,224 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:39:00,225 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:39:00,230 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 20:39:00,232 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:39:00,232 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:39:00,232 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:39:00,232 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:39:00,232 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:39:00,232 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:39:00,233 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:39:00,233 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:39:00,233 INFO L133 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a.cil.c_Iteration10_Loop [2019-11-28 20:39:00,233 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:39:00,233 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:39:00,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:39:00,251 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:39:00,251 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:39:00,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:39:00,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:39:00,270 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:39:00,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:39:00,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:39:00,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:39:00,271 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:39:00,272 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:39:00,276 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:39:00,279 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 20:39:00,279 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:39:00,285 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:39:00,285 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:39:00,285 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:39:00,285 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8600 Supporting invariants [] [2019-11-28 20:39:00,287 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:39:00,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:00,334 INFO L264 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:39:00,335 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:39:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:00,341 INFO L264 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:39:00,341 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:39:00,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:00,357 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 [2019-11-28 20:39:00,358 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 389 states and 503 transitions. cyclomatic complexity: 124 Second operand 5 states. [2019-11-28 20:39:00,521 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 389 states and 503 transitions. cyclomatic complexity: 124. Second operand 5 states. Result 596 states and 801 transitions. Complement of second has 9 states. [2019-11-28 20:39:00,522 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 [2019-11-28 20:39:00,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 20:39:00,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 175 transitions. [2019-11-28 20:39:00,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 175 transitions. Stem has 26 letters. Loop has 11 letters. [2019-11-28 20:39:00,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:39:00,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 175 transitions. Stem has 37 letters. Loop has 11 letters. [2019-11-28 20:39:00,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:39:00,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 175 transitions. Stem has 26 letters. Loop has 22 letters. [2019-11-28 20:39:00,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:39:00,524 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 596 states and 801 transitions. [2019-11-28 20:39:00,529 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 197 [2019-11-28 20:39:00,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 596 states to 553 states and 744 transitions. [2019-11-28 20:39:00,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 273 [2019-11-28 20:39:00,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 293 [2019-11-28 20:39:00,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 553 states and 744 transitions. [2019-11-28 20:39:00,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:39:00,533 INFO L688 BuchiCegarLoop]: Abstraction has 553 states and 744 transitions. [2019-11-28 20:39:00,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states and 744 transitions. [2019-11-28 20:39:00,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 452. [2019-11-28 20:39:00,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-11-28 20:39:00,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 598 transitions. [2019-11-28 20:39:00,540 INFO L711 BuchiCegarLoop]: Abstraction has 452 states and 598 transitions. [2019-11-28 20:39:00,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:00,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:00,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:00,541 INFO L87 Difference]: Start difference. First operand 452 states and 598 transitions. Second operand 3 states. [2019-11-28 20:39:00,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:00,588 INFO L93 Difference]: Finished difference Result 471 states and 603 transitions. [2019-11-28 20:39:00,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:00,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 471 states and 603 transitions. [2019-11-28 20:39:00,593 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 166 [2019-11-28 20:39:00,596 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 471 states to 442 states and 570 transitions. [2019-11-28 20:39:00,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 234 [2019-11-28 20:39:00,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 236 [2019-11-28 20:39:00,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 442 states and 570 transitions. [2019-11-28 20:39:00,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:39:00,597 INFO L688 BuchiCegarLoop]: Abstraction has 442 states and 570 transitions. [2019-11-28 20:39:00,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states and 570 transitions. [2019-11-28 20:39:00,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 440. [2019-11-28 20:39:00,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-11-28 20:39:00,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 568 transitions. [2019-11-28 20:39:00,605 INFO L711 BuchiCegarLoop]: Abstraction has 440 states and 568 transitions. [2019-11-28 20:39:00,605 INFO L591 BuchiCegarLoop]: Abstraction has 440 states and 568 transitions. [2019-11-28 20:39:00,605 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 20:39:00,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 440 states and 568 transitions. [2019-11-28 20:39:00,607 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 165 [2019-11-28 20:39:00,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:00,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:00,609 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:00,609 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:00,609 INFO L794 eck$LassoCheckResult]: Stem: 9804#ULTIMATE.startENTRY 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; 9805#L176 assume !false; 9990#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 9989#L29 assume 8466 == main_~s__state~0; 9987#L30 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 9985#L78-1 main_~s__state~0 := 8496; 9983#L176 assume !false; 9981#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 9979#L29 assume !(8466 == main_~s__state~0); 9977#L32 assume 8496 == main_~s__state~0; 9976#L33 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 9974#L85-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 9975#L176 assume !false; 10140#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10138#L29 assume !(8466 == main_~s__state~0); 10137#L32 assume !(8496 == main_~s__state~0); 10136#L36 assume 8512 == main_~s__state~0; 10135#L37 main_~s__state~0 := 8528; 10133#L176 assume !false; 10132#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10129#L29 assume !(8466 == main_~s__state~0); 10125#L32 assume !(8496 == main_~s__state~0); 10121#L36 assume !(8512 == main_~s__state~0); 9739#L40 assume 8528 == main_~s__state~0; 9740#L41 main_~s__state~0 := 8544; 9794#L176 assume !false; 10095#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10147#L29 assume !(8466 == main_~s__state~0); 10145#L32 assume !(8496 == main_~s__state~0); 10142#L36 assume !(8512 == main_~s__state~0); 10100#L40 assume !(8528 == main_~s__state~0); 10043#L44 assume !(8544 == main_~s__state~0); 9906#L48 assume !(8560 == main_~s__state~0); 9857#L52 assume 8576 == main_~s__state~0; 9802#L53 [2019-11-28 20:39:00,609 INFO L796 eck$LassoCheckResult]: Loop: 9802#L53 main_~tmp___1~0 := main_#t~nondet4;havoc main_#t~nondet4; 9730#L135 assume !(2 == main_~tmp___1~0);main_~s__state~0 := 8592; 9723#L176 assume !false; 10027#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10024#L29 assume !(8466 == main_~s__state~0); 10020#L32 assume !(8496 == main_~s__state~0); 10017#L36 assume !(8512 == main_~s__state~0); 10014#L40 assume !(8528 == main_~s__state~0); 10011#L44 assume !(8544 == main_~s__state~0); 9845#L48 assume !(8560 == main_~s__state~0); 9846#L52 assume 8576 == main_~s__state~0; 9802#L53 [2019-11-28 20:39:00,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:00,610 INFO L82 PathProgramCache]: Analyzing trace with hash -682922250, now seen corresponding path program 1 times [2019-11-28 20:39:00,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:00,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790409400] [2019-11-28 20:39:00,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:00,640 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-28 20:39:00,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790409400] [2019-11-28 20:39:00,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:00,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:00,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382902174] [2019-11-28 20:39:00,642 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:39:00,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:00,642 INFO L82 PathProgramCache]: Analyzing trace with hash -589369450, now seen corresponding path program 1 times [2019-11-28 20:39:00,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:00,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065953388] [2019-11-28 20:39:00,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:00,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:39:00,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065953388] [2019-11-28 20:39:00,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:00,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:39:00,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229739857] [2019-11-28 20:39:00,659 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:00,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:00,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:00,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:00,662 INFO L87 Difference]: Start difference. First operand 440 states and 568 transitions. cyclomatic complexity: 137 Second operand 3 states. [2019-11-28 20:39:00,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:00,720 INFO L93 Difference]: Finished difference Result 465 states and 582 transitions. [2019-11-28 20:39:00,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:00,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 465 states and 582 transitions. [2019-11-28 20:39:00,723 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 165 [2019-11-28 20:39:00,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 465 states to 456 states and 573 transitions. [2019-11-28 20:39:00,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 240 [2019-11-28 20:39:00,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 240 [2019-11-28 20:39:00,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 456 states and 573 transitions. [2019-11-28 20:39:00,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:39:00,727 INFO L688 BuchiCegarLoop]: Abstraction has 456 states and 573 transitions. [2019-11-28 20:39:00,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states and 573 transitions. [2019-11-28 20:39:00,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 449. [2019-11-28 20:39:00,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-28 20:39:00,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 562 transitions. [2019-11-28 20:39:00,734 INFO L711 BuchiCegarLoop]: Abstraction has 449 states and 562 transitions. [2019-11-28 20:39:00,734 INFO L591 BuchiCegarLoop]: Abstraction has 449 states and 562 transitions. [2019-11-28 20:39:00,735 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 20:39:00,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 449 states and 562 transitions. [2019-11-28 20:39:00,737 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 165 [2019-11-28 20:39:00,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:00,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:00,738 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:00,738 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:00,738 INFO L794 eck$LassoCheckResult]: Stem: 10724#ULTIMATE.startENTRY 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; 10725#L176 assume !false; 10900#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10898#L29 assume 8466 == main_~s__state~0; 10896#L30 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 10890#L78-1 main_~s__state~0 := 8496; 10888#L176 assume !false; 10887#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10886#L29 assume !(8466 == main_~s__state~0); 10885#L32 assume 8496 == main_~s__state~0; 10884#L33 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 10882#L85-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 10883#L176 assume !false; 10922#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10919#L29 assume !(8466 == main_~s__state~0); 10916#L32 assume !(8496 == main_~s__state~0); 10912#L36 assume 8512 == main_~s__state~0; 10908#L37 main_~s__state~0 := 8528; 10903#L176 assume !false; 10902#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10901#L29 assume !(8466 == main_~s__state~0); 10899#L32 assume !(8496 == main_~s__state~0); 10897#L36 assume !(8512 == main_~s__state~0); 10895#L40 assume 8528 == main_~s__state~0; 10709#L41 main_~s__state~0 := 8544; 10710#L176 assume !false; 10920#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10917#L29 assume !(8466 == main_~s__state~0); 10914#L32 assume !(8496 == main_~s__state~0); 10910#L36 assume !(8512 == main_~s__state~0); 10905#L40 assume !(8528 == main_~s__state~0); 10892#L44 assume !(8544 == main_~s__state~0); 10769#L48 assume !(8560 == main_~s__state~0); 10738#L52 assume 8576 == main_~s__state~0; 10719#L53 [2019-11-28 20:39:00,739 INFO L796 eck$LassoCheckResult]: Loop: 10719#L53 main_~tmp___1~0 := main_#t~nondet4;havoc main_#t~nondet4; 10642#L135 assume 2 == main_~tmp___1~0;main_~s__state~0 := 8466; 10643#L176 assume !false; 10827#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10825#L29 assume 8466 == main_~s__state~0; 10749#L30 assume !(0 == main_~blastFlag~0); 10820#L78-1 main_~s__state~0 := 8496; 10818#L176 assume !false; 10816#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10814#L29 assume !(8466 == main_~s__state~0); 10812#L32 assume 8496 == main_~s__state~0; 10745#L33 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 10802#L85-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 10799#L176 assume !false; 10797#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10794#L29 assume !(8466 == main_~s__state~0); 10791#L32 assume !(8496 == main_~s__state~0); 10787#L36 assume 8512 == main_~s__state~0; 10741#L37 main_~s__state~0 := 8528; 10780#L176 assume !false; 10776#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10772#L29 assume !(8466 == main_~s__state~0); 10768#L32 assume !(8496 == main_~s__state~0); 10762#L36 assume !(8512 == main_~s__state~0); 10760#L40 assume 8528 == main_~s__state~0; 10736#L41 main_~s__state~0 := 8544; 10635#L176 assume !false; 10752#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10748#L29 assume !(8466 == main_~s__state~0); 10744#L32 assume !(8496 == main_~s__state~0); 10740#L36 assume !(8512 == main_~s__state~0); 10735#L40 assume !(8528 == main_~s__state~0); 10733#L44 assume !(8544 == main_~s__state~0); 10731#L48 assume !(8560 == main_~s__state~0); 10732#L52 assume 8576 == main_~s__state~0; 10719#L53 [2019-11-28 20:39:00,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:00,739 INFO L82 PathProgramCache]: Analyzing trace with hash -682922250, now seen corresponding path program 2 times [2019-11-28 20:39:00,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:00,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541081398] [2019-11-28 20:39:00,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:00,753 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-28 20:39:00,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541081398] [2019-11-28 20:39:00,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:00,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:00,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684478312] [2019-11-28 20:39:00,754 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:39:00,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:00,755 INFO L82 PathProgramCache]: Analyzing trace with hash 2085672464, now seen corresponding path program 1 times [2019-11-28 20:39:00,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:00,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868596299] [2019-11-28 20:39:00,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:00,767 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-28 20:39:00,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868596299] [2019-11-28 20:39:00,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:00,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:00,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309035646] [2019-11-28 20:39:00,768 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:00,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:00,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:00,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:00,769 INFO L87 Difference]: Start difference. First operand 449 states and 562 transitions. cyclomatic complexity: 123 Second operand 3 states. [2019-11-28 20:39:00,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:00,817 INFO L93 Difference]: Finished difference Result 453 states and 549 transitions. [2019-11-28 20:39:00,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:00,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 453 states and 549 transitions. [2019-11-28 20:39:00,821 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 147 [2019-11-28 20:39:00,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 453 states to 415 states and 506 transitions. [2019-11-28 20:39:00,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 217 [2019-11-28 20:39:00,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 219 [2019-11-28 20:39:00,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 415 states and 506 transitions. [2019-11-28 20:39:00,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:39:00,824 INFO L688 BuchiCegarLoop]: Abstraction has 415 states and 506 transitions. [2019-11-28 20:39:00,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states and 506 transitions. [2019-11-28 20:39:00,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 413. [2019-11-28 20:39:00,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-11-28 20:39:00,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 504 transitions. [2019-11-28 20:39:00,830 INFO L711 BuchiCegarLoop]: Abstraction has 413 states and 504 transitions. [2019-11-28 20:39:00,830 INFO L591 BuchiCegarLoop]: Abstraction has 413 states and 504 transitions. [2019-11-28 20:39:00,830 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-28 20:39:00,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 413 states and 504 transitions. [2019-11-28 20:39:00,832 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 146 [2019-11-28 20:39:00,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:00,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:00,838 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:00,838 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:00,838 INFO L794 eck$LassoCheckResult]: Stem: 11634#ULTIMATE.startENTRY 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; 11635#L176 assume !false; 11872#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 11869#L29 assume 8466 == main_~s__state~0; 11612#L30 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 11613#L78-1 main_~s__state~0 := 8496; 11735#L176 assume !false; 11734#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 11733#L29 assume !(8466 == main_~s__state~0); 11731#L32 assume 8496 == main_~s__state~0; 11729#L33 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 11726#L85-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 11722#L176 assume !false; 11720#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 11718#L29 assume !(8466 == main_~s__state~0); 11716#L32 assume !(8496 == main_~s__state~0); 11714#L36 assume !(8512 == main_~s__state~0); 11712#L40 assume !(8528 == main_~s__state~0); 11710#L44 assume !(8544 == main_~s__state~0); 11708#L48 assume !(8560 == main_~s__state~0); 11706#L52 assume !(8576 == main_~s__state~0); 11588#L56 assume !(8592 == main_~s__state~0); 11549#L60 assume !(8608 == main_~s__state~0); 11550#L64 assume !(8640 == main_~s__state~0); 11633#L68 assume 8656 == main_~s__state~0; 11541#L69 assume !(2 == main_~blastFlag~0); 11542#L162-1 main_~s__state~0 := 8672; 11574#L176 assume !false; 11899#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 11895#L29 assume !(8466 == main_~s__state~0); 11891#L32 assume !(8496 == main_~s__state~0); 11887#L36 assume !(8512 == main_~s__state~0); 11883#L40 assume !(8528 == main_~s__state~0); 11879#L44 assume !(8544 == main_~s__state~0); 11599#L48 assume !(8560 == main_~s__state~0); 11600#L52 assume !(8576 == main_~s__state~0); 11627#L56 assume !(8592 == main_~s__state~0); 11643#L60 assume !(8608 == main_~s__state~0); 11642#L64 assume !(8640 == main_~s__state~0); 11641#L68 assume !(8656 == main_~s__state~0); 11611#L72 [2019-11-28 20:39:00,838 INFO L796 eck$LassoCheckResult]: Loop: 11611#L72 assume 8672 == main_~s__state~0; 11564#L73 assume 4 == main_~blastFlag~0;main_~blastFlag~0 := 5; 11565#L169-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8640; 11610#L176 assume !false; 11858#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 11857#L29 assume !(8466 == main_~s__state~0); 11854#L32 assume !(8496 == main_~s__state~0); 11852#L36 assume !(8512 == main_~s__state~0); 11850#L40 assume !(8528 == main_~s__state~0); 11848#L44 assume !(8544 == main_~s__state~0); 11846#L48 assume !(8560 == main_~s__state~0); 11844#L52 assume !(8576 == main_~s__state~0); 11587#L56 assume !(8592 == main_~s__state~0); 11547#L60 assume !(8608 == main_~s__state~0); 11548#L64 assume 8640 == main_~s__state~0; 11572#L65 assume 3 == main_~blastFlag~0;main_~blastFlag~0 := 4; 11570#L151-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8656; 11571#L176 assume !false; 11702#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 11701#L29 assume !(8466 == main_~s__state~0); 11699#L32 assume !(8496 == main_~s__state~0); 11697#L36 assume !(8512 == main_~s__state~0); 11695#L40 assume !(8528 == main_~s__state~0); 11693#L44 assume !(8544 == main_~s__state~0); 11691#L48 assume !(8560 == main_~s__state~0); 11689#L52 assume !(8576 == main_~s__state~0); 11688#L56 assume !(8592 == main_~s__state~0); 11686#L60 assume !(8608 == main_~s__state~0); 11631#L64 assume !(8640 == main_~s__state~0); 11632#L68 assume 8656 == main_~s__state~0; 11539#L69 assume 2 == main_~blastFlag~0;main_~blastFlag~0 := 3; 11540#L162-1 main_~s__state~0 := 8672; 11573#L176 assume !false; 11677#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 11676#L29 assume !(8466 == main_~s__state~0); 11671#L32 assume !(8496 == main_~s__state~0); 11670#L36 assume !(8512 == main_~s__state~0); 11668#L40 assume !(8528 == main_~s__state~0); 11665#L44 assume !(8544 == main_~s__state~0); 11662#L48 assume !(8560 == main_~s__state~0); 11659#L52 assume !(8576 == main_~s__state~0); 11656#L56 assume !(8592 == main_~s__state~0); 11653#L60 assume !(8608 == main_~s__state~0); 11649#L64 assume !(8640 == main_~s__state~0); 11646#L68 assume !(8656 == main_~s__state~0); 11611#L72 [2019-11-28 20:39:00,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:00,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1636133345, now seen corresponding path program 1 times [2019-11-28 20:39:00,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:00,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467280493] [2019-11-28 20:39:00,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:00,864 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 20:39:00,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467280493] [2019-11-28 20:39:00,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:00,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:00,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921216048] [2019-11-28 20:39:00,865 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:39:00,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:00,866 INFO L82 PathProgramCache]: Analyzing trace with hash -270758187, now seen corresponding path program 1 times [2019-11-28 20:39:00,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:00,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891282638] [2019-11-28 20:39:00,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:00,878 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-28 20:39:00,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891282638] [2019-11-28 20:39:00,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:00,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:00,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131388965] [2019-11-28 20:39:00,879 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:00,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:00,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:00,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:00,880 INFO L87 Difference]: Start difference. First operand 413 states and 504 transitions. cyclomatic complexity: 99 Second operand 3 states. [2019-11-28 20:39:00,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:00,906 INFO L93 Difference]: Finished difference Result 429 states and 511 transitions. [2019-11-28 20:39:00,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:00,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 429 states and 511 transitions. [2019-11-28 20:39:00,909 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 134 [2019-11-28 20:39:00,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 429 states to 429 states and 511 transitions. [2019-11-28 20:39:00,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 239 [2019-11-28 20:39:00,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 239 [2019-11-28 20:39:00,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 429 states and 511 transitions. [2019-11-28 20:39:00,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:39:00,913 INFO L688 BuchiCegarLoop]: Abstraction has 429 states and 511 transitions. [2019-11-28 20:39:00,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states and 511 transitions. [2019-11-28 20:39:00,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-28 20:39:00,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-28 20:39:00,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 511 transitions. [2019-11-28 20:39:00,932 INFO L711 BuchiCegarLoop]: Abstraction has 429 states and 511 transitions. [2019-11-28 20:39:00,932 INFO L591 BuchiCegarLoop]: Abstraction has 429 states and 511 transitions. [2019-11-28 20:39:00,932 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-28 20:39:00,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 429 states and 511 transitions. [2019-11-28 20:39:00,934 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 134 [2019-11-28 20:39:00,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:00,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:00,936 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:00,937 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:00,937 INFO L794 eck$LassoCheckResult]: Stem: 12482#ULTIMATE.startENTRY 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; 12483#L176 assume !false; 12738#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 12736#L29 assume 8466 == main_~s__state~0; 12459#L30 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 12460#L78-1 main_~s__state~0 := 8496; 12710#L176 assume !false; 12709#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 12708#L29 assume !(8466 == main_~s__state~0); 12707#L32 assume 8496 == main_~s__state~0; 12705#L33 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 12706#L85-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 12474#L176 assume !false; 12745#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 12744#L29 assume !(8466 == main_~s__state~0); 12741#L32 assume !(8496 == main_~s__state~0); 12740#L36 assume !(8512 == main_~s__state~0); 12739#L40 assume !(8528 == main_~s__state~0); 12737#L44 assume !(8544 == main_~s__state~0); 12445#L48 assume !(8560 == main_~s__state~0); 12446#L52 assume !(8576 == main_~s__state~0); 12435#L56 assume !(8592 == main_~s__state~0); 12398#L60 assume !(8608 == main_~s__state~0); 12399#L64 assume !(8640 == main_~s__state~0); 12481#L68 assume 8656 == main_~s__state~0; 12390#L69 assume 2 == main_~blastFlag~0;main_~blastFlag~0 := 3; 12391#L162-1 main_~s__state~0 := 8672; 12420#L176 assume !false; 12603#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 12816#L29 assume !(8466 == main_~s__state~0); 12815#L32 assume !(8496 == main_~s__state~0); 12814#L36 assume !(8512 == main_~s__state~0); 12409#L40 assume !(8528 == main_~s__state~0); 12410#L44 assume !(8544 == main_~s__state~0); 12443#L48 assume !(8560 == main_~s__state~0); 12444#L52 assume !(8576 == main_~s__state~0); 12434#L56 assume !(8592 == main_~s__state~0); 12396#L60 assume !(8608 == main_~s__state~0); 12397#L64 assume !(8640 == main_~s__state~0); 12480#L68 assume !(8656 == main_~s__state~0); 12488#L72 [2019-11-28 20:39:00,937 INFO L796 eck$LassoCheckResult]: Loop: 12488#L72 assume 8672 == main_~s__state~0; 12807#L73 assume 4 == main_~blastFlag~0;main_~blastFlag~0 := 5; 12805#L169-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8640; 12804#L176 assume !false; 12802#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 12800#L29 assume !(8466 == main_~s__state~0); 12798#L32 assume !(8496 == main_~s__state~0); 12796#L36 assume !(8512 == main_~s__state~0); 12794#L40 assume !(8528 == main_~s__state~0); 12792#L44 assume !(8544 == main_~s__state~0); 12790#L48 assume !(8560 == main_~s__state~0); 12787#L52 assume !(8576 == main_~s__state~0); 12785#L56 assume !(8592 == main_~s__state~0); 12782#L60 assume !(8608 == main_~s__state~0); 12724#L64 assume 8640 == main_~s__state~0; 12725#L65 assume 3 == main_~blastFlag~0;main_~blastFlag~0 := 4; 12778#L151-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8656; 12777#L176 assume !false; 12775#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 12773#L29 assume !(8466 == main_~s__state~0); 12771#L32 assume !(8496 == main_~s__state~0); 12769#L36 assume !(8512 == main_~s__state~0); 12767#L40 assume !(8528 == main_~s__state~0); 12765#L44 assume !(8544 == main_~s__state~0); 12763#L48 assume !(8560 == main_~s__state~0); 12761#L52 assume !(8576 == main_~s__state~0); 12759#L56 assume !(8592 == main_~s__state~0); 12755#L60 assume !(8608 == main_~s__state~0); 12756#L64 assume !(8640 == main_~s__state~0); 12497#L68 assume 8656 == main_~s__state~0; 12493#L69 assume 2 == main_~blastFlag~0;main_~blastFlag~0 := 3; 12389#L162-1 main_~s__state~0 := 8672; 12419#L176 assume !false; 12776#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 12774#L29 assume !(8466 == main_~s__state~0); 12772#L32 assume !(8496 == main_~s__state~0); 12770#L36 assume !(8512 == main_~s__state~0); 12768#L40 assume !(8528 == main_~s__state~0); 12766#L44 assume !(8544 == main_~s__state~0); 12764#L48 assume !(8560 == main_~s__state~0); 12762#L52 assume !(8576 == main_~s__state~0); 12760#L56 assume !(8592 == main_~s__state~0); 12758#L60 assume !(8608 == main_~s__state~0); 12753#L64 assume !(8640 == main_~s__state~0); 12754#L68 assume !(8656 == main_~s__state~0); 12488#L72 [2019-11-28 20:39:00,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:00,938 INFO L82 PathProgramCache]: Analyzing trace with hash -356269667, now seen corresponding path program 1 times [2019-11-28 20:39:00,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:00,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478622066] [2019-11-28 20:39:00,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:00,958 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:00,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:00,959 INFO L82 PathProgramCache]: Analyzing trace with hash -270758187, now seen corresponding path program 2 times [2019-11-28 20:39:00,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:00,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386402619] [2019-11-28 20:39:00,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:00,982 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-28 20:39:00,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386402619] [2019-11-28 20:39:00,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:00,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:00,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733501134] [2019-11-28 20:39:00,983 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:00,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:00,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:00,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:00,984 INFO L87 Difference]: Start difference. First operand 429 states and 511 transitions. cyclomatic complexity: 90 Second operand 3 states. [2019-11-28 20:39:01,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:01,012 INFO L93 Difference]: Finished difference Result 475 states and 558 transitions. [2019-11-28 20:39:01,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:01,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 475 states and 558 transitions. [2019-11-28 20:39:01,016 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 180 [2019-11-28 20:39:01,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 475 states to 475 states and 558 transitions. [2019-11-28 20:39:01,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 285 [2019-11-28 20:39:01,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 285 [2019-11-28 20:39:01,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 475 states and 558 transitions. [2019-11-28 20:39:01,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:39:01,022 INFO L688 BuchiCegarLoop]: Abstraction has 475 states and 558 transitions. [2019-11-28 20:39:01,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states and 558 transitions. [2019-11-28 20:39:01,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2019-11-28 20:39:01,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-11-28 20:39:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 558 transitions. [2019-11-28 20:39:01,033 INFO L711 BuchiCegarLoop]: Abstraction has 475 states and 558 transitions. [2019-11-28 20:39:01,034 INFO L591 BuchiCegarLoop]: Abstraction has 475 states and 558 transitions. [2019-11-28 20:39:01,034 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-28 20:39:01,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 475 states and 558 transitions. [2019-11-28 20:39:01,037 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 180 [2019-11-28 20:39:01,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:01,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:01,039 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:01,039 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:01,040 INFO L794 eck$LassoCheckResult]: Stem: 13386#ULTIMATE.startENTRY 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; 13387#L176 assume !false; 13556#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 13550#L29 assume 8466 == main_~s__state~0; 13545#L30 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 13540#L78-1 main_~s__state~0 := 8496; 13534#L176 assume !false; 13528#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 13523#L29 assume !(8466 == main_~s__state~0); 13520#L32 assume 8496 == main_~s__state~0; 13517#L33 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 13508#L85-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 13380#L176 assume !false; 13469#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 13467#L29 assume !(8466 == main_~s__state~0); 13465#L32 assume !(8496 == main_~s__state~0); 13463#L36 assume !(8512 == main_~s__state~0); 13462#L40 assume !(8528 == main_~s__state~0); 13461#L44 assume !(8544 == main_~s__state~0); 13460#L48 assume !(8560 == main_~s__state~0); 13459#L52 assume !(8576 == main_~s__state~0); 13457#L56 assume !(8592 == main_~s__state~0); 13456#L60 assume !(8608 == main_~s__state~0); 13454#L64 assume !(8640 == main_~s__state~0); 13396#L68 assume 8656 == main_~s__state~0; 13300#L69 assume 2 == main_~blastFlag~0;main_~blastFlag~0 := 3; 13301#L162-1 main_~s__state~0 := 8672; 13331#L176 assume !false; 13631#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 13636#L29 assume !(8466 == main_~s__state~0); 13634#L32 assume !(8496 == main_~s__state~0); 13633#L36 assume !(8512 == main_~s__state~0); 13632#L40 assume !(8528 == main_~s__state~0); 13630#L44 assume !(8544 == main_~s__state~0); 13628#L48 assume !(8560 == main_~s__state~0); 13624#L52 assume !(8576 == main_~s__state~0); 13620#L56 assume !(8592 == main_~s__state~0); 13616#L60 assume !(8608 == main_~s__state~0); 13611#L64 assume !(8640 == main_~s__state~0); 13395#L68 assume !(8656 == main_~s__state~0); 13368#L72 [2019-11-28 20:39:01,041 INFO L796 eck$LassoCheckResult]: Loop: 13368#L72 assume 8672 == main_~s__state~0; 13369#L73 assume !(4 == main_~blastFlag~0); 13392#L172 assume !(5 == main_~blastFlag~0); 13370#L169-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8640; 13356#L176 assume !false; 13333#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 13315#L29 assume !(8466 == main_~s__state~0); 13316#L32 assume !(8496 == main_~s__state~0); 13325#L36 assume !(8512 == main_~s__state~0); 13769#L40 assume !(8528 == main_~s__state~0); 13768#L44 assume !(8544 == main_~s__state~0); 13767#L48 assume !(8560 == main_~s__state~0); 13765#L52 assume !(8576 == main_~s__state~0); 13751#L56 assume !(8592 == main_~s__state~0); 13306#L60 assume !(8608 == main_~s__state~0); 13307#L64 assume 8640 == main_~s__state~0; 13332#L65 assume 3 == main_~blastFlag~0;main_~blastFlag~0 := 4; 13327#L151-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8656; 13328#L176 assume !false; 13766#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 13764#L29 assume !(8466 == main_~s__state~0); 13763#L32 assume !(8496 == main_~s__state~0); 13761#L36 assume !(8512 == main_~s__state~0); 13759#L40 assume !(8528 == main_~s__state~0); 13757#L44 assume !(8544 == main_~s__state~0); 13755#L48 assume !(8560 == main_~s__state~0); 13753#L52 assume !(8576 == main_~s__state~0); 13750#L56 assume !(8592 == main_~s__state~0); 13748#L60 assume !(8608 == main_~s__state~0); 13746#L64 assume !(8640 == main_~s__state~0); 13455#L68 assume 8656 == main_~s__state~0; 13453#L69 assume 2 == main_~blastFlag~0;main_~blastFlag~0 := 3; 13329#L162-1 main_~s__state~0 := 8672; 13330#L176 assume !false; 13772#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 13771#L29 assume !(8466 == main_~s__state~0); 13770#L32 assume !(8496 == main_~s__state~0); 13351#L36 assume !(8512 == main_~s__state~0); 13319#L40 assume !(8528 == main_~s__state~0); 13320#L44 assume !(8544 == main_~s__state~0); 13358#L48 assume !(8560 == main_~s__state~0); 13359#L52 assume !(8576 == main_~s__state~0); 13346#L56 assume !(8592 == main_~s__state~0); 13347#L60 assume !(8608 == main_~s__state~0); 13684#L64 assume !(8640 == main_~s__state~0); 13685#L68 assume !(8656 == main_~s__state~0); 13368#L72 [2019-11-28 20:39:01,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:01,041 INFO L82 PathProgramCache]: Analyzing trace with hash -356269667, now seen corresponding path program 2 times [2019-11-28 20:39:01,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:01,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877276736] [2019-11-28 20:39:01,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:01,055 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:01,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:01,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1348951222, now seen corresponding path program 1 times [2019-11-28 20:39:01,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:01,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681614241] [2019-11-28 20:39:01,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:01,070 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-28 20:39:01,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681614241] [2019-11-28 20:39:01,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:01,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:01,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838934546] [2019-11-28 20:39:01,072 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:01,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:01,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:01,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:01,072 INFO L87 Difference]: Start difference. First operand 475 states and 558 transitions. cyclomatic complexity: 92 Second operand 3 states. [2019-11-28 20:39:01,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:01,082 INFO L93 Difference]: Finished difference Result 450 states and 530 transitions. [2019-11-28 20:39:01,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:01,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 450 states and 530 transitions. [2019-11-28 20:39:01,085 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 103 [2019-11-28 20:39:01,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 450 states to 352 states and 424 transitions. [2019-11-28 20:39:01,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 191 [2019-11-28 20:39:01,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 191 [2019-11-28 20:39:01,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 352 states and 424 transitions. [2019-11-28 20:39:01,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:39:01,088 INFO L688 BuchiCegarLoop]: Abstraction has 352 states and 424 transitions. [2019-11-28 20:39:01,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states and 424 transitions. [2019-11-28 20:39:01,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 351. [2019-11-28 20:39:01,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-11-28 20:39:01,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 423 transitions. [2019-11-28 20:39:01,094 INFO L711 BuchiCegarLoop]: Abstraction has 351 states and 423 transitions. [2019-11-28 20:39:01,094 INFO L591 BuchiCegarLoop]: Abstraction has 351 states and 423 transitions. [2019-11-28 20:39:01,094 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-11-28 20:39:01,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 351 states and 423 transitions. [2019-11-28 20:39:01,096 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 103 [2019-11-28 20:39:01,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:01,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:01,101 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:01,101 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:39:01,101 INFO L794 eck$LassoCheckResult]: Stem: 14306#ULTIMATE.startENTRY 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; 14307#L176 assume !false; 14556#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14479#L29 assume 8466 == main_~s__state~0; 14480#L30 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 14540#L78-1 main_~s__state~0 := 8496; 14539#L176 assume !false; 14535#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14533#L29 assume !(8466 == main_~s__state~0); 14529#L32 assume 8496 == main_~s__state~0; 14528#L33 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 14526#L85-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 14524#L176 assume !false; 14521#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14518#L29 assume !(8466 == main_~s__state~0); 14515#L32 assume !(8496 == main_~s__state~0); 14513#L36 assume 8512 == main_~s__state~0; 14512#L37 main_~s__state~0 := 8528; 14510#L176 assume !false; 14507#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14504#L29 assume !(8466 == main_~s__state~0); 14501#L32 assume !(8496 == main_~s__state~0); 14498#L36 assume !(8512 == main_~s__state~0); 14462#L40 assume 8528 == main_~s__state~0; 14463#L41 main_~s__state~0 := 8544; 14477#L176 assume !false; 14476#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14474#L29 assume !(8466 == main_~s__state~0); 14472#L32 assume !(8496 == main_~s__state~0); 14470#L36 assume !(8512 == main_~s__state~0); 14468#L40 assume !(8528 == main_~s__state~0); 14465#L44 assume 8544 == main_~s__state~0; 14263#L45 assume !(0 != 1 + main_~s__verify_mode~0);main_~s__state~0 := 8560; 14264#L176 assume !false; 14494#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14563#L29 assume !(8466 == main_~s__state~0); 14562#L32 assume !(8496 == main_~s__state~0); 14561#L36 assume !(8512 == main_~s__state~0); 14559#L40 assume !(8528 == main_~s__state~0); 14310#L44 assume !(8544 == main_~s__state~0); 14311#L48 assume !(8560 == main_~s__state~0); 14324#L52 assume 8576 == main_~s__state~0; 14303#L53 [2019-11-28 20:39:01,102 INFO L796 eck$LassoCheckResult]: Loop: 14303#L53 main_~tmp___1~0 := main_#t~nondet4;havoc main_#t~nondet4; 14237#L135 assume 2 == main_~tmp___1~0;main_~s__state~0 := 8466; 14238#L176 assume !false; 14455#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14453#L29 assume 8466 == main_~s__state~0; 14407#L30 assume !(0 == main_~blastFlag~0); 14451#L78-1 main_~s__state~0 := 8496; 14449#L176 assume !false; 14447#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14445#L29 assume !(8466 == main_~s__state~0); 14443#L32 assume 8496 == main_~s__state~0; 14403#L33 assume !(1 == main_~blastFlag~0); 14441#L85-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 14439#L176 assume !false; 14437#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14435#L29 assume !(8466 == main_~s__state~0); 14417#L32 assume !(8496 == main_~s__state~0); 14414#L36 assume 8512 == main_~s__state~0; 14392#L37 main_~s__state~0 := 8528; 14405#L176 assume !false; 14401#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14400#L29 assume !(8466 == main_~s__state~0); 14399#L32 assume !(8496 == main_~s__state~0); 14398#L36 assume !(8512 == main_~s__state~0); 14390#L40 assume 8528 == main_~s__state~0; 14387#L41 main_~s__state~0 := 8544; 14384#L176 assume !false; 14380#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14375#L29 assume !(8466 == main_~s__state~0); 14370#L32 assume !(8496 == main_~s__state~0); 14365#L36 assume !(8512 == main_~s__state~0); 14361#L40 assume !(8528 == main_~s__state~0); 14323#L44 assume 8544 == main_~s__state~0; 14322#L45 assume !(0 != 1 + main_~s__verify_mode~0);main_~s__state~0 := 8560; 14232#L176 assume !false; 14411#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14406#L29 assume !(8466 == main_~s__state~0); 14402#L32 assume !(8496 == main_~s__state~0); 14391#L36 assume !(8512 == main_~s__state~0); 14388#L40 assume !(8528 == main_~s__state~0); 14360#L44 assume !(8544 == main_~s__state~0); 14314#L48 assume !(8560 == main_~s__state~0); 14315#L52 assume 8576 == main_~s__state~0; 14303#L53 [2019-11-28 20:39:01,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:01,102 INFO L82 PathProgramCache]: Analyzing trace with hash -2029459126, now seen corresponding path program 1 times [2019-11-28 20:39:01,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:01,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444412048] [2019-11-28 20:39:01,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:01,124 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-28 20:39:01,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444412048] [2019-11-28 20:39:01,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:01,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:01,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852029484] [2019-11-28 20:39:01,125 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:39:01,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:01,125 INFO L82 PathProgramCache]: Analyzing trace with hash -16050654, now seen corresponding path program 1 times [2019-11-28 20:39:01,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:01,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242931794] [2019-11-28 20:39:01,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:39:01,140 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-28 20:39:01,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242931794] [2019-11-28 20:39:01,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:39:01,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:39:01,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116035286] [2019-11-28 20:39:01,142 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 20:39:01,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:39:01,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:39:01,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:39:01,142 INFO L87 Difference]: Start difference. First operand 351 states and 423 transitions. cyclomatic complexity: 79 Second operand 3 states. [2019-11-28 20:39:01,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:39:01,191 INFO L93 Difference]: Finished difference Result 382 states and 443 transitions. [2019-11-28 20:39:01,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:39:01,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 382 states and 443 transitions. [2019-11-28 20:39:01,194 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 72 [2019-11-28 20:39:01,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 382 states to 336 states and 390 transitions. [2019-11-28 20:39:01,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 166 [2019-11-28 20:39:01,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2019-11-28 20:39:01,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 336 states and 390 transitions. [2019-11-28 20:39:01,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 20:39:01,197 INFO L688 BuchiCegarLoop]: Abstraction has 336 states and 390 transitions. [2019-11-28 20:39:01,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states and 390 transitions. [2019-11-28 20:39:01,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 335. [2019-11-28 20:39:01,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-11-28 20:39:01,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 389 transitions. [2019-11-28 20:39:01,205 INFO L711 BuchiCegarLoop]: Abstraction has 335 states and 389 transitions. [2019-11-28 20:39:01,205 INFO L591 BuchiCegarLoop]: Abstraction has 335 states and 389 transitions. [2019-11-28 20:39:01,205 INFO L424 BuchiCegarLoop]: ======== Iteration 17============ [2019-11-28 20:39:01,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 335 states and 389 transitions. [2019-11-28 20:39:01,207 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 72 [2019-11-28 20:39:01,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:39:01,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:39:01,208 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [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] [2019-11-28 20:39:01,208 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [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] [2019-11-28 20:39:01,208 INFO L794 eck$LassoCheckResult]: Stem: 15050#ULTIMATE.startENTRY 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; 15051#L176 assume !false; 15133#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15131#L29 assume 8466 == main_~s__state~0; 15032#L30 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 15033#L78-1 main_~s__state~0 := 8496; 15156#L176 assume !false; 15155#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15153#L29 assume !(8466 == main_~s__state~0); 15151#L32 assume 8496 == main_~s__state~0; 15149#L33 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 15147#L85-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 15146#L176 assume !false; 15145#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15143#L29 assume !(8466 == main_~s__state~0); 15141#L32 assume !(8496 == main_~s__state~0); 15139#L36 assume 8512 == main_~s__state~0; 15137#L37 main_~s__state~0 := 8528; 15136#L176 assume !false; 15135#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15134#L29 assume !(8466 == main_~s__state~0); 15132#L32 assume !(8496 == main_~s__state~0); 15130#L36 assume !(8512 == main_~s__state~0); 15129#L40 assume 8528 == main_~s__state~0; 15128#L41 main_~s__state~0 := 8544; 15126#L176 assume !false; 15123#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15122#L29 assume !(8466 == main_~s__state~0); 15121#L32 assume !(8496 == main_~s__state~0); 15119#L36 assume !(8512 == main_~s__state~0); 15117#L40 assume !(8528 == main_~s__state~0); 15114#L44 assume 8544 == main_~s__state~0; 15115#L45 assume 0 != 1 + main_~s__verify_mode~0; 15208#L105 assume !(0 != main_~s__session__peer~0); 15206#L112 assume !(0 != (256 + main_~s__s3__tmp__new_cipher__algorithms~0) % 4294967296); 15203#L120 main_~s__state~0 := 8576; 15201#L176 assume !false; 15185#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15184#L29 assume !(8466 == main_~s__state~0); 15183#L32 assume !(8496 == main_~s__state~0); 15182#L36 assume !(8512 == main_~s__state~0); 15181#L40 assume !(8528 == main_~s__state~0); 15180#L44 assume !(8544 == main_~s__state~0); 15170#L48 assume !(8560 == main_~s__state~0); 15061#L52 assume 8576 == main_~s__state~0; 15046#L53 [2019-11-28 20:39:01,209 INFO L796 eck$LassoCheckResult]: Loop: 15046#L53 main_~tmp___1~0 := main_#t~nondet4;havoc main_#t~nondet4; 14977#L135 assume 2 == main_~tmp___1~0;main_~s__state~0 := 8466; 14978#L176 assume !false; 15200#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15124#L29 assume 8466 == main_~s__state~0; 15125#L30 assume !(0 == main_~blastFlag~0); 15007#L78-1 main_~s__state~0 := 8496; 15008#L176 assume !false; 15164#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15162#L29 assume !(8466 == main_~s__state~0); 15160#L32 assume 8496 == main_~s__state~0; 15052#L33 assume !(1 == main_~blastFlag~0); 15043#L85-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 15044#L176 assume !false; 15194#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15192#L29 assume !(8466 == main_~s__state~0); 15190#L32 assume !(8496 == main_~s__state~0); 15188#L36 assume 8512 == main_~s__state~0; 15017#L37 main_~s__state~0 := 8528; 15018#L176 assume !false; 15154#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15152#L29 assume !(8466 == main_~s__state~0); 15150#L32 assume !(8496 == main_~s__state~0); 15148#L36 assume !(8512 == main_~s__state~0); 15127#L40 assume 8528 == main_~s__state~0; 15035#L41 main_~s__state~0 := 8544; 15036#L176 assume !false; 15144#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15142#L29 assume !(8466 == main_~s__state~0); 15140#L32 assume !(8496 == main_~s__state~0); 15138#L36 assume !(8512 == main_~s__state~0); 15102#L40 assume !(8528 == main_~s__state~0); 15057#L44 assume 8544 == main_~s__state~0; 15001#L45 assume 0 != 1 + main_~s__verify_mode~0; 15003#L105 assume !(0 != main_~s__session__peer~0); 15025#L112 assume !(0 != (256 + main_~s__s3__tmp__new_cipher__algorithms~0) % 4294967296); 15014#L120 main_~s__state~0 := 8576; 14972#L176 assume !false; 15212#L23 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15158#L29 assume !(8466 == main_~s__state~0); 15157#L32 assume !(8496 == main_~s__state~0); 15103#L36 assume !(8512 == main_~s__state~0); 15104#L40 assume !(8528 == main_~s__state~0); 15105#L44 assume !(8544 == main_~s__state~0); 15106#L48 assume !(8560 == main_~s__state~0); 15060#L52 assume 8576 == main_~s__state~0; 15046#L53 [2019-11-28 20:39:01,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:01,209 INFO L82 PathProgramCache]: Analyzing trace with hash -904822850, now seen corresponding path program 1 times [2019-11-28 20:39:01,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:01,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507571163] [2019-11-28 20:39:01,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:01,251 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:01,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:01,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1328677862, now seen corresponding path program 1 times [2019-11-28 20:39:01,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:01,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211174059] [2019-11-28 20:39:01,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:01,268 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:01,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:39:01,269 INFO L82 PathProgramCache]: Analyzing trace with hash 2007728355, now seen corresponding path program 1 times [2019-11-28 20:39:01,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:39:01,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454860884] [2019-11-28 20:39:01,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:39:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:39:01,291 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:39:01,421 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 47 [2019-11-28 20:39:01,575 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 50 [2019-11-28 20:39:01,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:39:01 BoogieIcfgContainer [2019-11-28 20:39:01,615 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:39:01,616 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:39:01,616 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:39:01,616 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:39:01,616 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:38:54" (3/4) ... [2019-11-28 20:39:01,619 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 20:39:01,699 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:39:01,700 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:39:01,704 INFO L168 Benchmark]: Toolchain (without parser) took 7641.02 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 311.4 MB). Free memory was 957.7 MB in the beginning and 1.0 GB in the end (delta: -64.3 MB). Peak memory consumption was 247.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:39:01,705 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:39:01,705 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -158.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:39:01,706 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.76 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:39:01,706 INFO L168 Benchmark]: Boogie Preprocessor took 46.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:39:01,707 INFO L168 Benchmark]: RCFGBuilder took 405.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:39:01,709 INFO L168 Benchmark]: BuchiAutomizer took 6698.09 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 191.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.2 MB). Peak memory consumption was 244.5 MB. Max. memory is 11.5 GB. [2019-11-28 20:39:01,710 INFO L168 Benchmark]: Witness Printer took 84.02 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:39:01,715 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 353.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -158.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.76 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 405.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6698.09 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 191.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.2 MB). Peak memory consumption was 244.5 MB. Max. memory is 11.5 GB. * Witness Printer took 84.02 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 23 terminating modules (15 trivial, 8 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * s__state + 8481 and consists of 5 locations. One deterministic module has affine ranking function -1 * s__state + 8576 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 + 8568 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 + 8600 and consists of 5 locations. 15 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 335 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.6s and 17 iterations. TraceHistogramMax:6. Analysis of lassos took 3.0s. Construction of modules took 1.5s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 23. Automata minimization 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 640 StatesRemovedByMinimization, 18 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 475 states and ocurred in iteration 14. Nontrivial modules had stage [8, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1484 SDtfs, 949 SDslu, 774 SDs, 0 SdLazy, 1619 SolverSat, 200 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT1 conc0 concLT2 SILN0 SILU0 SILI6 SILT5 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax100 hnf99 lsp78 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq197 hnf87 smp100 dnf103 smp97 tf114 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 52]: 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@39e76b9a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@741aa48a=2, s__session__peer=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5b72d854=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@727140c1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@16564632=0, s__hit=0, buf=0, blastFlag=2, s__s3__tmp__new_cipher__algorithms=-256, s__verify_mode=4, s__state=8576} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 52]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L9] int s__state ; [L10] int s__hit = __VERIFIER_nondet_int() ; [L11] int s__verify_mode = __VERIFIER_nondet_int() ; [L12] int s__session__peer = __VERIFIER_nondet_int() ; [L13] unsigned long s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_long() ; [L14] int buf ; [L15] int cb ; [L16] int blastFlag ; [L17] int tmp___1; [L19] s__state = 8466 [L20] blastFlag = 0 [L22] COND TRUE 1 [L23] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L29] COND TRUE s__state == 8466 [L78] COND TRUE blastFlag == 0 [L79] blastFlag = 1 [L81] s__state = 8496 [L22] COND TRUE 1 [L23] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L29] COND FALSE !(s__state == 8466) [L32] COND TRUE s__state == 8496 [L85] COND TRUE blastFlag == 1 [L86] blastFlag = 2 [L88] COND FALSE !(\read(s__hit)) [L91] s__state = 8512 [L22] COND TRUE 1 [L23] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L29] COND FALSE !(s__state == 8466) [L32] COND FALSE !(s__state == 8496) [L36] COND TRUE s__state == 8512 [L96] s__state = 8528 [L22] COND TRUE 1 [L23] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L29] COND FALSE !(s__state == 8466) [L32] COND FALSE !(s__state == 8496) [L36] COND FALSE !(s__state == 8512) [L40] COND TRUE s__state == 8528 [L100] s__state = 8544 [L22] COND TRUE 1 [L23] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L29] COND FALSE !(s__state == 8466) [L32] COND FALSE !(s__state == 8496) [L36] COND FALSE !(s__state == 8512) [L40] COND FALSE !(s__state == 8528) [L44] COND TRUE s__state == 8544 [L104] COND TRUE s__verify_mode + 1 [L105] COND FALSE !(s__session__peer != 0) [L113] COND FALSE !(s__s3__tmp__new_cipher__algorithms + 256UL) [L121] s__state = 8576 [L22] COND TRUE 1 [L23] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L29] COND FALSE !(s__state == 8466) [L32] COND FALSE !(s__state == 8496) [L36] COND FALSE !(s__state == 8512) [L40] COND FALSE !(s__state == 8528) [L44] COND FALSE !(s__state == 8544) [L48] COND FALSE !(s__state == 8560) [L52] COND TRUE s__state == 8576 Loop: [L134] tmp___1 = __VERIFIER_nondet_int() [L135] COND TRUE tmp___1 == 2 [L136] s__state = 8466 [L22] COND TRUE 1 [L23] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L29] COND TRUE s__state == 8466 [L78] COND FALSE !(blastFlag == 0) [L81] s__state = 8496 [L22] COND TRUE 1 [L23] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L29] COND FALSE !(s__state == 8466) [L32] COND TRUE s__state == 8496 [L85] COND FALSE !(blastFlag == 1) [L88] COND FALSE !(\read(s__hit)) [L91] s__state = 8512 [L22] COND TRUE 1 [L23] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L29] COND FALSE !(s__state == 8466) [L32] COND FALSE !(s__state == 8496) [L36] COND TRUE s__state == 8512 [L96] s__state = 8528 [L22] COND TRUE 1 [L23] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L29] COND FALSE !(s__state == 8466) [L32] COND FALSE !(s__state == 8496) [L36] COND FALSE !(s__state == 8512) [L40] COND TRUE s__state == 8528 [L100] s__state = 8544 [L22] COND TRUE 1 [L23] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L29] COND FALSE !(s__state == 8466) [L32] COND FALSE !(s__state == 8496) [L36] COND FALSE !(s__state == 8512) [L40] COND FALSE !(s__state == 8528) [L44] COND TRUE s__state == 8544 [L104] COND TRUE s__verify_mode + 1 [L105] COND FALSE !(s__session__peer != 0) [L113] COND FALSE !(s__s3__tmp__new_cipher__algorithms + 256UL) [L121] s__state = 8576 [L22] COND TRUE 1 [L23] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L29] COND FALSE !(s__state == 8466) [L32] COND FALSE !(s__state == 8496) [L36] COND FALSE !(s__state == 8512) [L40] COND FALSE !(s__state == 8528) [L44] COND FALSE !(s__state == 8544) [L48] COND FALSE !(s__state == 8560) [L52] COND TRUE s__state == 8576 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...