./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: 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 /storage/repos/svcomp/c/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.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 253410f53553d69ef02e4dba1b07bb26de7bec75 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 22:10:42,161 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:10:42,162 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:10:42,175 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:10:42,175 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:10:42,176 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:10:42,178 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:10:42,180 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:10:42,182 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:10:42,183 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:10:42,184 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:10:42,184 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:10:42,185 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:10:42,187 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:10:42,188 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:10:42,189 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:10:42,190 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:10:42,192 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:10:42,194 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:10:42,196 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:10:42,197 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:10:42,199 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:10:42,202 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:10:42,202 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:10:42,202 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:10:42,203 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:10:42,205 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:10:42,206 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:10:42,207 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:10:42,208 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:10:42,209 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:10:42,209 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:10:42,209 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:10:42,210 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:10:42,211 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:10:42,212 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:10:42,212 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 22:10:42,230 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:10:42,231 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:10:42,232 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:10:42,233 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:10:42,233 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:10:42,233 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:10:42,233 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:10:42,233 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:10:42,233 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:10:42,234 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:10:42,234 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:10:42,234 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:10:42,234 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 22:10:42,234 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:10:42,235 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:10:42,236 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 22:10:42,236 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:10:42,236 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:10:42,236 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:10:42,237 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:10:42,237 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 22:10:42,237 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:10:42,238 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:10:42,238 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:10:42,238 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:10:42,238 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:10:42,238 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:10:42,239 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:10:42,240 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:10:42,240 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:10:42,240 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:10:42,241 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:10:42,241 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> 253410f53553d69ef02e4dba1b07bb26de7bec75 [2019-01-01 22:10:42,292 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:10:42,309 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:10:42,315 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:10:42,316 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:10:42,317 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:10:42,317 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.cil.c [2019-01-01 22:10:42,383 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b47ffb95c/e00f41bc5b154a6d81df743510e1d18d/FLAGd4b6b6b47 [2019-01-01 22:10:42,877 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:10:42,878 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.cil.c [2019-01-01 22:10:42,890 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b47ffb95c/e00f41bc5b154a6d81df743510e1d18d/FLAGd4b6b6b47 [2019-01-01 22:10:43,223 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b47ffb95c/e00f41bc5b154a6d81df743510e1d18d [2019-01-01 22:10:43,227 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:10:43,229 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:10:43,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:10:43,231 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:10:43,236 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:10:43,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:10:43" (1/1) ... [2019-01-01 22:10:43,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c03e545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:10:43, skipping insertion in model container [2019-01-01 22:10:43,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:10:43" (1/1) ... [2019-01-01 22:10:43,250 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:10:43,282 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:10:43,549 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:10:43,554 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:10:43,589 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:10:43,607 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:10:43,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:10:43 WrapperNode [2019-01-01 22:10:43,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:10:43,609 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:10:43,609 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:10:43,609 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:10:43,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:10:43" (1/1) ... [2019-01-01 22:10:43,623 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:10:43" (1/1) ... [2019-01-01 22:10:43,645 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:10:43,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:10:43,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:10:43,645 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:10:43,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:10:43" (1/1) ... [2019-01-01 22:10:43,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:10:43" (1/1) ... [2019-01-01 22:10:43,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:10:43" (1/1) ... [2019-01-01 22:10:43,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:10:43" (1/1) ... [2019-01-01 22:10:43,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:10:43" (1/1) ... [2019-01-01 22:10:43,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:10:43" (1/1) ... [2019-01-01 22:10:43,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:10:43" (1/1) ... [2019-01-01 22:10:43,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:10:43,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:10:43,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:10:43,747 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:10:43,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:10:43" (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-01-01 22:10:43,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:10:43,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:10:44,365 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:10:44,366 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 22:10:44,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:10:44 BoogieIcfgContainer [2019-01-01 22:10:44,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:10:44,367 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:10:44,367 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:10:44,371 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:10:44,372 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:10:44,372 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:10:43" (1/3) ... [2019-01-01 22:10:44,374 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f0eb09c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:10:44, skipping insertion in model container [2019-01-01 22:10:44,374 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:10:44,374 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:10:43" (2/3) ... [2019-01-01 22:10:44,374 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f0eb09c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:10:44, skipping insertion in model container [2019-01-01 22:10:44,374 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:10:44,375 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:10:44" (3/3) ... [2019-01-01 22:10:44,376 INFO L375 chiAutomizerObserver]: Analyzing ICFG s3_srvr_1a_true-unreach-call_false-termination.cil.c [2019-01-01 22:10:44,441 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:10:44,441 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:10:44,442 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:10:44,442 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:10:44,442 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:10:44,442 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:10:44,442 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:10:44,443 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:10:44,443 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:10:44,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2019-01-01 22:10:44,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2019-01-01 22:10:44,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:10:44,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:10:44,494 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:10:44,494 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 22:10:44,494 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:10:44,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2019-01-01 22:10:44,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2019-01-01 22:10:44,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:10:44,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:10:44,499 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 22:10:44,499 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 22:10:44,508 INFO L794 eck$LassoCheckResult]: Stem: 35#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; 6#L177true [2019-01-01 22:10:44,509 INFO L796 eck$LassoCheckResult]: Loop: 6#L177true assume !false; 41#L24true assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 28#L30true assume 8466 == main_~s__state~0; 30#L31true assume !(0 == main_~blastFlag~0); 43#L79-1true main_~s__state~0 := 8496; 6#L177true [2019-01-01 22:10:44,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:44,515 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-01 22:10:44,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:44,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:44,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:44,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:44,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:44,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:44,615 INFO L82 PathProgramCache]: Analyzing trace with hash 38331118, now seen corresponding path program 1 times [2019-01-01 22:10:44,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:44,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:44,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:44,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:44,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:44,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:44,629 INFO L82 PathProgramCache]: Analyzing trace with hash 925834799, now seen corresponding path program 1 times [2019-01-01 22:10:44,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:44,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:44,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:44,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:44,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:44,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:10:44,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:10:44,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:10:44,818 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:10:44,819 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:10:44,819 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:10:44,819 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:10:44,820 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:10:44,822 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:44,822 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:10:44,822 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:10:44,823 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration1_Loop [2019-01-01 22:10:44,823 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:10:44,823 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:10:44,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:44,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:45,125 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-01 22:10:45,224 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:10:45,225 INFO L412 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:45,236 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:10:45,236 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:45,263 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:10:45,263 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:10:45,277 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:10:45,294 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:10:45,295 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:10:45,295 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:10:45,295 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:10:45,295 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:10:45,295 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:45,295 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:10:45,295 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:10:45,296 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration1_Loop [2019-01-01 22:10:45,296 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:10:45,296 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:10:45,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:45,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:45,558 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2019-01-01 22:10:45,559 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:10:45,564 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:10:45,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:10:45,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:10:45,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:10:45,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:10:45,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:10:45,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:10:45,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:10:45,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:10:45,585 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:10:45,593 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:10:45,594 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:10:45,596 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:10:45,596 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:10:45,597 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:10:45,598 INFO L520 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-01-01 22:10:45,600 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:10:45,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:45,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:10:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:45,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:10:45,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:10:45,786 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-01-01 22:10:45,787 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states. Second operand 4 states. [2019-01-01 22:10:46,582 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-01-01 22:10:46,583 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-01-01 22:10:46,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:10:46,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2019-01-01 22:10:46,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 1 letters. Loop has 5 letters. [2019-01-01 22:10:46,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:46,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 6 letters. Loop has 5 letters. [2019-01-01 22:10:46,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:46,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 1 letters. Loop has 10 letters. [2019-01-01 22:10:46,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:46,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 204 transitions. [2019-01-01 22:10:46,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2019-01-01 22:10:46,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 80 states and 127 transitions. [2019-01-01 22:10:46,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2019-01-01 22:10:46,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2019-01-01 22:10:46,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 127 transitions. [2019-01-01 22:10:46,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:10:46,616 INFO L705 BuchiCegarLoop]: Abstraction has 80 states and 127 transitions. [2019-01-01 22:10:46,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 127 transitions. [2019-01-01 22:10:46,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 47. [2019-01-01 22:10:46,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-01 22:10:46,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2019-01-01 22:10:46,649 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2019-01-01 22:10:46,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:10:46,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:10:46,655 INFO L87 Difference]: Start difference. First operand 47 states and 73 transitions. Second operand 3 states. [2019-01-01 22:10:46,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:10:46,732 INFO L93 Difference]: Finished difference Result 89 states and 133 transitions. [2019-01-01 22:10:46,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:10:46,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 133 transitions. [2019-01-01 22:10:46,737 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 74 [2019-01-01 22:10:46,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 89 states and 133 transitions. [2019-01-01 22:10:46,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 81 [2019-01-01 22:10:46,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 81 [2019-01-01 22:10:46,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 133 transitions. [2019-01-01 22:10:46,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:10:46,741 INFO L705 BuchiCegarLoop]: Abstraction has 89 states and 133 transitions. [2019-01-01 22:10:46,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 133 transitions. [2019-01-01 22:10:46,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-01 22:10:46,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-01 22:10:46,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 133 transitions. [2019-01-01 22:10:46,750 INFO L728 BuchiCegarLoop]: Abstraction has 89 states and 133 transitions. [2019-01-01 22:10:46,751 INFO L608 BuchiCegarLoop]: Abstraction has 89 states and 133 transitions. [2019-01-01 22:10:46,751 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:10:46,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 133 transitions. [2019-01-01 22:10:46,754 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 74 [2019-01-01 22:10:46,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:10:46,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:10:46,755 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 22:10:46,755 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:10:46,756 INFO L794 eck$LassoCheckResult]: Stem: 410#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; 411#L177 assume !false; 414#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 399#L30 assume !(8466 == main_~s__state~0); 400#L33 [2019-01-01 22:10:46,756 INFO L796 eck$LassoCheckResult]: Loop: 400#L33 assume 8496 == main_~s__state~0; 390#L34 assume !(1 == main_~blastFlag~0); 391#L86-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 363#L177 assume !false; 368#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 450#L30 assume !(8466 == main_~s__state~0); 400#L33 [2019-01-01 22:10:46,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:46,756 INFO L82 PathProgramCache]: Analyzing trace with hash 963407, now seen corresponding path program 1 times [2019-01-01 22:10:46,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:46,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:46,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:46,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:46,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:46,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:10:46,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:10:46,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 22:10:46,788 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:10:46,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:46,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1630948181, now seen corresponding path program 1 times [2019-01-01 22:10:46,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:46,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:46,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:46,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:46,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:46,859 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:10:46,860 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:10:46,860 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:10:46,860 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:10:46,860 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:10:46,860 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:46,860 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:10:46,860 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:10:46,861 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration2_Loop [2019-01-01 22:10:46,861 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:10:46,861 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:10:46,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:46,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:46,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:47,033 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:10:47,033 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:47,037 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:10:47,037 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:10:47,043 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:10:47,043 INFO L448 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:47,063 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:10:47,063 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-01-01 22:10:47,111 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:10:47,111 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:47,133 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:10:47,170 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:10:47,170 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:10:47,170 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:10:47,171 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:10:47,171 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:10:47,171 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:47,171 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:10:47,171 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:10:47,171 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration2_Loop [2019-01-01 22:10:47,172 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:10:47,172 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:10:47,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:47,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:47,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:47,370 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:10:47,370 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:10:47,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:10:47,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:10:47,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:10:47,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:10:47,372 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:10:47,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:10:47,373 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:10:47,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:10:47,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:10:47,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:10:47,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:10:47,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:10:47,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:10:47,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:10:47,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:10:47,377 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:10:47,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:10:47,386 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:10:47,391 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:10:47,392 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:10:47,392 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:10:47,392 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:10:47,393 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:10:47,394 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~s__state~0) = -1*ULTIMATE.start_main_~s__state~0 + 8576 Supporting invariants [] [2019-01-01 22:10:47,394 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:10:47,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:47,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:10:47,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:47,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:10:47,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:10:47,546 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-01-01 22:10:47,546 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 89 states and 133 transitions. cyclomatic complexity: 47 Second operand 4 states. [2019-01-01 22:10:47,950 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-01-01 22:10:47,950 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-01-01 22:10:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:10:47,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2019-01-01 22:10:47,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-01 22:10:47,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:47,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-01 22:10:47,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:47,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 90 transitions. Stem has 4 letters. Loop has 12 letters. [2019-01-01 22:10:47,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:47,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 288 states and 419 transitions. [2019-01-01 22:10:47,961 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 79 [2019-01-01 22:10:47,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 288 states to 211 states and 320 transitions. [2019-01-01 22:10:47,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2019-01-01 22:10:47,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2019-01-01 22:10:47,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 211 states and 320 transitions. [2019-01-01 22:10:47,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:10:47,969 INFO L705 BuchiCegarLoop]: Abstraction has 211 states and 320 transitions. [2019-01-01 22:10:47,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states and 320 transitions. [2019-01-01 22:10:47,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 122. [2019-01-01 22:10:47,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-01 22:10:47,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 181 transitions. [2019-01-01 22:10:47,981 INFO L728 BuchiCegarLoop]: Abstraction has 122 states and 181 transitions. [2019-01-01 22:10:47,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:10:47,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:10:47,982 INFO L87 Difference]: Start difference. First operand 122 states and 181 transitions. Second operand 3 states. [2019-01-01 22:10:48,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:10:48,066 INFO L93 Difference]: Finished difference Result 76 states and 111 transitions. [2019-01-01 22:10:48,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:10:48,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 111 transitions. [2019-01-01 22:10:48,069 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2019-01-01 22:10:48,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 74 states and 109 transitions. [2019-01-01 22:10:48,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2019-01-01 22:10:48,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2019-01-01 22:10:48,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 109 transitions. [2019-01-01 22:10:48,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:10:48,072 INFO L705 BuchiCegarLoop]: Abstraction has 74 states and 109 transitions. [2019-01-01 22:10:48,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 109 transitions. [2019-01-01 22:10:48,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-01 22:10:48,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-01 22:10:48,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2019-01-01 22:10:48,081 INFO L728 BuchiCegarLoop]: Abstraction has 74 states and 109 transitions. [2019-01-01 22:10:48,081 INFO L608 BuchiCegarLoop]: Abstraction has 74 states and 109 transitions. [2019-01-01 22:10:48,082 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:10:48,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 109 transitions. [2019-01-01 22:10:48,083 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 [2019-01-01 22:10:48,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:10:48,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:10:48,085 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 22:10:48,085 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:10:48,086 INFO L794 eck$LassoCheckResult]: Stem: 1039#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; 1040#L177 assume !false; 1062#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1060#L30 assume 8466 == main_~s__state~0; 1058#L31 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 1056#L79-1 main_~s__state~0 := 8496; 1054#L177 assume !false; 1052#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1050#L30 assume !(8466 == main_~s__state~0); 1049#L33 assume !(8496 == main_~s__state~0); 1023#L37 [2019-01-01 22:10:48,086 INFO L796 eck$LassoCheckResult]: Loop: 1023#L37 assume 8512 == main_~s__state~0; 997#L38 main_~s__state~0 := 8528; 993#L177 assume !false; 1047#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1045#L30 assume !(8466 == main_~s__state~0); 1044#L33 assume !(8496 == main_~s__state~0); 1023#L37 [2019-01-01 22:10:48,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:48,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1381923845, now seen corresponding path program 1 times [2019-01-01 22:10:48,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:48,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:48,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:48,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:48,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:48,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:10:48,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:10:48,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:10:48,125 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:10:48,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:48,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1779937937, now seen corresponding path program 1 times [2019-01-01 22:10:48,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:48,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:48,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:48,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:48,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:48,167 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:10:48,167 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:10:48,167 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:10:48,168 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:10:48,168 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:10:48,168 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:48,168 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:10:48,168 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:10:48,169 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration3_Loop [2019-01-01 22:10:48,169 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:10:48,169 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:10:48,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:48,196 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:10:48,196 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:48,206 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:10:48,206 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:48,231 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:10:48,231 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:10:48,237 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:10:48,255 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:10:48,255 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:10:48,255 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:10:48,255 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:10:48,256 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:10:48,256 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:48,256 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:10:48,256 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:10:48,256 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration3_Loop [2019-01-01 22:10:48,256 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:10:48,256 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:10:48,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:48,469 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-01 22:10:48,604 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-01 22:10:48,605 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:10:48,605 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:10:48,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:10:48,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:10:48,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:10:48,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:10:48,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:10:48,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:10:48,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:10:48,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:10:48,618 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:10:48,623 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:10:48,624 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:10:48,624 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:10:48,624 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:10:48,624 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:10:48,626 INFO L520 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-01-01 22:10:48,626 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:10:48,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:48,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:10:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:48,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:10:48,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:10:48,779 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-01-01 22:10:48,780 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 109 transitions. cyclomatic complexity: 39 Second operand 4 states. [2019-01-01 22:10:49,232 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-01-01 22:10:49,233 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-01-01 22:10:49,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:10:49,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2019-01-01 22:10:49,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 129 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-01 22:10:49,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:49,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 129 transitions. Stem has 16 letters. Loop has 6 letters. [2019-01-01 22:10:49,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:49,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 129 transitions. Stem has 10 letters. Loop has 12 letters. [2019-01-01 22:10:49,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:49,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 232 states and 347 transitions. [2019-01-01 22:10:49,242 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 62 [2019-01-01 22:10:49,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 232 states to 182 states and 281 transitions. [2019-01-01 22:10:49,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2019-01-01 22:10:49,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 138 [2019-01-01 22:10:49,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 281 transitions. [2019-01-01 22:10:49,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:10:49,246 INFO L705 BuchiCegarLoop]: Abstraction has 182 states and 281 transitions. [2019-01-01 22:10:49,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states and 281 transitions. [2019-01-01 22:10:49,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 102. [2019-01-01 22:10:49,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-01 22:10:49,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 152 transitions. [2019-01-01 22:10:49,255 INFO L728 BuchiCegarLoop]: Abstraction has 102 states and 152 transitions. [2019-01-01 22:10:49,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:10:49,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:10:49,256 INFO L87 Difference]: Start difference. First operand 102 states and 152 transitions. Second operand 3 states. [2019-01-01 22:10:49,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:10:49,352 INFO L93 Difference]: Finished difference Result 113 states and 157 transitions. [2019-01-01 22:10:49,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:10:49,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 157 transitions. [2019-01-01 22:10:49,356 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2019-01-01 22:10:49,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 106 states and 149 transitions. [2019-01-01 22:10:49,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2019-01-01 22:10:49,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2019-01-01 22:10:49,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 149 transitions. [2019-01-01 22:10:49,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:10:49,360 INFO L705 BuchiCegarLoop]: Abstraction has 106 states and 149 transitions. [2019-01-01 22:10:49,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 149 transitions. [2019-01-01 22:10:49,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2019-01-01 22:10:49,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-01 22:10:49,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2019-01-01 22:10:49,367 INFO L728 BuchiCegarLoop]: Abstraction has 104 states and 147 transitions. [2019-01-01 22:10:49,367 INFO L608 BuchiCegarLoop]: Abstraction has 104 states and 147 transitions. [2019-01-01 22:10:49,367 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:10:49,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 147 transitions. [2019-01-01 22:10:49,369 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2019-01-01 22:10:49,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:10:49,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:10:49,370 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:10:49,371 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:10:49,372 INFO L794 eck$LassoCheckResult]: Stem: 1640#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; 1641#L177 assume !false; 1676#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1674#L30 assume 8466 == main_~s__state~0; 1672#L31 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 1670#L79-1 main_~s__state~0 := 8496; 1668#L177 assume !false; 1666#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1665#L30 assume !(8466 == main_~s__state~0); 1663#L33 assume 8496 == main_~s__state~0; 1662#L34 assume !(1 == main_~blastFlag~0); 1660#L86-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 1656#L177 assume !false; 1653#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1651#L30 assume !(8466 == main_~s__state~0); 1650#L33 assume !(8496 == main_~s__state~0); 1649#L37 assume !(8512 == main_~s__state~0); 1623#L41 [2019-01-01 22:10:49,372 INFO L796 eck$LassoCheckResult]: Loop: 1623#L41 assume 8528 == main_~s__state~0; 1632#L42 main_~s__state~0 := 8544; 1590#L177 assume !false; 1661#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 1658#L30 assume !(8466 == main_~s__state~0); 1654#L33 assume !(8496 == main_~s__state~0); 1652#L37 assume !(8512 == main_~s__state~0); 1623#L41 [2019-01-01 22:10:49,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:49,372 INFO L82 PathProgramCache]: Analyzing trace with hash 905234773, now seen corresponding path program 1 times [2019-01-01 22:10:49,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:49,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:49,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:49,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:49,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:49,404 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:10:49,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:10:49,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:10:49,405 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:10:49,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:49,407 INFO L82 PathProgramCache]: Analyzing trace with hash -456689360, now seen corresponding path program 1 times [2019-01-01 22:10:49,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:49,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:49,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:49,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:49,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:49,474 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:10:49,474 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:10:49,474 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:10:49,474 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:10:49,475 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:10:49,475 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:49,475 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:10:49,475 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:10:49,475 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration4_Loop [2019-01-01 22:10:49,475 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:10:49,475 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:10:49,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:49,508 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:10:49,508 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:49,512 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:10:49,512 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:49,536 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:10:49,536 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:10:49,540 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:10:49,558 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:10:49,558 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:10:49,558 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:10:49,558 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:10:49,558 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:10:49,559 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:49,559 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:10:49,559 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:10:49,559 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration4_Loop [2019-01-01 22:10:49,559 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:10:49,559 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:10:49,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:49,589 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:10:49,590 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:10:49,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:10:49,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:10:49,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:10:49,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:10:49,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:10:49,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:10:49,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:10:49,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:10:49,602 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:10:49,607 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:10:49,607 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:10:49,607 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:10:49,607 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:10:49,608 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:10:49,608 INFO L520 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-01-01 22:10:49,608 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:10:49,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:49,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:10:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:49,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:10:49,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:10:49,707 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-01-01 22:10:49,707 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 104 states and 147 transitions. cyclomatic complexity: 47 Second operand 4 states. [2019-01-01 22:10:50,325 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-01-01 22:10:50,326 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-01-01 22:10:50,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:10:50,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2019-01-01 22:10:50,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 134 transitions. Stem has 17 letters. Loop has 7 letters. [2019-01-01 22:10:50,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:50,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 134 transitions. Stem has 24 letters. Loop has 7 letters. [2019-01-01 22:10:50,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:50,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 134 transitions. Stem has 17 letters. Loop has 14 letters. [2019-01-01 22:10:50,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:50,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 397 transitions. [2019-01-01 22:10:50,334 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 80 [2019-01-01 22:10:50,337 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 225 states and 335 transitions. [2019-01-01 22:10:50,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2019-01-01 22:10:50,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2019-01-01 22:10:50,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 225 states and 335 transitions. [2019-01-01 22:10:50,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:10:50,338 INFO L705 BuchiCegarLoop]: Abstraction has 225 states and 335 transitions. [2019-01-01 22:10:50,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states and 335 transitions. [2019-01-01 22:10:50,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 146. [2019-01-01 22:10:50,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-01 22:10:50,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 208 transitions. [2019-01-01 22:10:50,347 INFO L728 BuchiCegarLoop]: Abstraction has 146 states and 208 transitions. [2019-01-01 22:10:50,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:10:50,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:10:50,347 INFO L87 Difference]: Start difference. First operand 146 states and 208 transitions. Second operand 3 states. [2019-01-01 22:10:50,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:10:50,371 INFO L93 Difference]: Finished difference Result 182 states and 244 transitions. [2019-01-01 22:10:50,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:10:50,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 244 transitions. [2019-01-01 22:10:50,375 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 88 [2019-01-01 22:10:50,377 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 182 states and 244 transitions. [2019-01-01 22:10:50,377 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 112 [2019-01-01 22:10:50,377 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2019-01-01 22:10:50,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 244 transitions. [2019-01-01 22:10:50,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:10:50,378 INFO L705 BuchiCegarLoop]: Abstraction has 182 states and 244 transitions. [2019-01-01 22:10:50,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states and 244 transitions. [2019-01-01 22:10:50,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2019-01-01 22:10:50,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-01-01 22:10:50,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 244 transitions. [2019-01-01 22:10:50,385 INFO L728 BuchiCegarLoop]: Abstraction has 182 states and 244 transitions. [2019-01-01 22:10:50,385 INFO L608 BuchiCegarLoop]: Abstraction has 182 states and 244 transitions. [2019-01-01 22:10:50,386 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:10:50,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 182 states and 244 transitions. [2019-01-01 22:10:50,387 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 88 [2019-01-01 22:10:50,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:10:50,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:10:50,390 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:10:50,390 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:10:50,390 INFO L794 eck$LassoCheckResult]: Stem: 2447#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; 2448#L177 assume !false; 2532#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 2530#L30 assume 8466 == main_~s__state~0; 2527#L31 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 2525#L79-1 main_~s__state~0 := 8496; 2523#L177 assume !false; 2521#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 2519#L30 assume !(8466 == main_~s__state~0); 2518#L33 assume 8496 == main_~s__state~0; 2509#L34 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 2508#L86-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 2506#L177 assume !false; 2505#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 2504#L30 assume !(8466 == main_~s__state~0); 2503#L33 assume !(8496 == main_~s__state~0); 2501#L37 assume !(8512 == main_~s__state~0); 2456#L41 assume !(8528 == main_~s__state~0); 2423#L45 [2019-01-01 22:10:50,391 INFO L796 eck$LassoCheckResult]: Loop: 2423#L45 assume 8544 == main_~s__state~0; 2424#L46 assume !(0 != 1 + main_~s__verify_mode~0);main_~s__state~0 := 8560; 2393#L177 assume !false; 2470#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 2466#L30 assume !(8466 == main_~s__state~0); 2462#L33 assume !(8496 == main_~s__state~0); 2457#L37 assume !(8512 == main_~s__state~0); 2455#L41 assume !(8528 == main_~s__state~0); 2423#L45 [2019-01-01 22:10:50,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:50,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1193146448, now seen corresponding path program 1 times [2019-01-01 22:10:50,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:50,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:50,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:50,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:50,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:50,419 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 22:10:50,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:10:50,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:10:50,420 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:10:50,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:50,421 INFO L82 PathProgramCache]: Analyzing trace with hash 594459181, now seen corresponding path program 1 times [2019-01-01 22:10:50,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:50,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:50,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:50,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:50,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:50,472 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:10:50,472 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:10:50,472 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:10:50,472 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:10:50,472 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:10:50,473 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:50,473 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:10:50,473 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:10:50,473 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration5_Loop [2019-01-01 22:10:50,473 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:10:50,473 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:10:50,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:50,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:50,529 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:10:50,529 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:50,536 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:10:50,536 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:10:50,540 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:10:50,540 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~s__verify_mode~0=-1} Honda state: {ULTIMATE.start_main_~s__verify_mode~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /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) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:50,563 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:10:50,563 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:50,588 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:10:50,588 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:10:50,607 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:10:50,632 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:10:50,633 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:10:50,633 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:10:50,633 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:10:50,633 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:10:50,633 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:50,633 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:10:50,633 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:10:50,633 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration5_Loop [2019-01-01 22:10:50,634 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:10:50,634 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:10:50,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:50,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:50,686 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:10:50,686 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:10:50,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:10:50,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:10:50,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:10:50,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:10:50,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:10:50,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:10:50,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:10:50,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:10:50,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:10:50,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:10:50,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:10:50,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:10:50,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:10:50,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:10:50,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:10:50,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:10:50,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:10:50,706 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:10:50,710 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:10:50,711 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:10:50,711 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:10:50,711 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:10:50,711 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:10:50,712 INFO L520 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-01-01 22:10:50,712 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:10:50,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:50,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:10:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:50,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:10:50,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:10:50,815 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-01-01 22:10:50,815 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 182 states and 244 transitions. cyclomatic complexity: 68 Second operand 4 states. [2019-01-01 22:10:51,288 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-01-01 22:10:51,289 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-01-01 22:10:51,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:10:51,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2019-01-01 22:10:51,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 141 transitions. Stem has 18 letters. Loop has 8 letters. [2019-01-01 22:10:51,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:51,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 141 transitions. Stem has 26 letters. Loop has 8 letters. [2019-01-01 22:10:51,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:51,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 141 transitions. Stem has 18 letters. Loop has 16 letters. [2019-01-01 22:10:51,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:51,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 363 states and 509 transitions. [2019-01-01 22:10:51,295 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 123 [2019-01-01 22:10:51,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 363 states to 321 states and 451 transitions. [2019-01-01 22:10:51,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 172 [2019-01-01 22:10:51,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 201 [2019-01-01 22:10:51,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 321 states and 451 transitions. [2019-01-01 22:10:51,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:10:51,299 INFO L705 BuchiCegarLoop]: Abstraction has 321 states and 451 transitions. [2019-01-01 22:10:51,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states and 451 transitions. [2019-01-01 22:10:51,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 247. [2019-01-01 22:10:51,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-01-01 22:10:51,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 337 transitions. [2019-01-01 22:10:51,309 INFO L728 BuchiCegarLoop]: Abstraction has 247 states and 337 transitions. [2019-01-01 22:10:51,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:10:51,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:10:51,310 INFO L87 Difference]: Start difference. First operand 247 states and 337 transitions. Second operand 3 states. [2019-01-01 22:10:51,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:10:51,428 INFO L93 Difference]: Finished difference Result 281 states and 366 transitions. [2019-01-01 22:10:51,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:10:51,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 281 states and 366 transitions. [2019-01-01 22:10:51,431 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 108 [2019-01-01 22:10:51,433 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 281 states to 260 states and 342 transitions. [2019-01-01 22:10:51,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 143 [2019-01-01 22:10:51,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 144 [2019-01-01 22:10:51,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 260 states and 342 transitions. [2019-01-01 22:10:51,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:10:51,434 INFO L705 BuchiCegarLoop]: Abstraction has 260 states and 342 transitions. [2019-01-01 22:10:51,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states and 342 transitions. [2019-01-01 22:10:51,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2019-01-01 22:10:51,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-01-01 22:10:51,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 340 transitions. [2019-01-01 22:10:51,443 INFO L728 BuchiCegarLoop]: Abstraction has 258 states and 340 transitions. [2019-01-01 22:10:51,443 INFO L608 BuchiCegarLoop]: Abstraction has 258 states and 340 transitions. [2019-01-01 22:10:51,443 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:10:51,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 258 states and 340 transitions. [2019-01-01 22:10:51,444 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 107 [2019-01-01 22:10:51,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:10:51,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:10:51,447 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:10:51,447 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:10:51,449 INFO L794 eck$LassoCheckResult]: Stem: 3638#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; 3639#L177 assume !false; 3768#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 3765#L30 assume 8466 == main_~s__state~0; 3762#L31 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 3760#L79-1 main_~s__state~0 := 8496; 3758#L177 assume !false; 3756#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 3754#L30 assume !(8466 == main_~s__state~0); 3753#L33 assume 8496 == main_~s__state~0; 3744#L34 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 3741#L86-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 3738#L177 assume !false; 3736#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 3734#L30 assume !(8466 == main_~s__state~0); 3732#L33 assume !(8496 == main_~s__state~0); 3730#L37 assume !(8512 == main_~s__state~0); 3612#L41 assume !(8528 == main_~s__state~0); 3645#L45 assume !(8544 == main_~s__state~0); 3584#L49 [2019-01-01 22:10:51,449 INFO L796 eck$LassoCheckResult]: Loop: 3584#L49 assume 8560 == main_~s__state~0; 3585#L50 main_~s__state~0 := 8576; 3572#L177 assume !false; 3663#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 3659#L30 assume !(8466 == main_~s__state~0); 3655#L33 assume !(8496 == main_~s__state~0); 3651#L37 assume !(8512 == main_~s__state~0); 3649#L41 assume !(8528 == main_~s__state~0); 3646#L45 assume !(8544 == main_~s__state~0); 3584#L49 [2019-01-01 22:10:51,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:51,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1818454854, now seen corresponding path program 1 times [2019-01-01 22:10:51,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:51,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:51,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:51,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:51,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:51,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:51,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1734491453, now seen corresponding path program 1 times [2019-01-01 22:10:51,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:51,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:51,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:51,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:51,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:51,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:51,478 INFO L82 PathProgramCache]: Analyzing trace with hash 566159524, now seen corresponding path program 1 times [2019-01-01 22:10:51,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:51,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:51,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:51,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:51,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:51,552 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 22:10:51,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:10:51,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:10:51,579 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:10:51,580 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:10:51,580 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:10:51,580 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:10:51,580 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:10:51,580 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:51,580 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:10:51,581 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:10:51,581 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration6_Loop [2019-01-01 22:10:51,581 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:10:51,581 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:10:51,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:51,615 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:10:51,616 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:51,620 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:10:51,620 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-01-01 22:10:51,668 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:10:51,668 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:10:51,682 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:10:51,710 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:10:51,710 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:10:51,710 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:10:51,710 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:10:51,710 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:10:51,710 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:51,710 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:10:51,710 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:10:51,711 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration6_Loop [2019-01-01 22:10:51,711 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:10:51,711 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:10:51,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:51,800 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:10:51,801 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:10:51,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:10:51,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:10:51,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:10:51,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:10:51,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:10:51,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:10:51,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:10:51,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:10:51,812 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:10:51,815 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:10:51,815 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:10:51,816 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:10:51,816 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:10:51,816 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:10:51,816 INFO L520 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-01-01 22:10:51,817 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:10:51,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:51,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:10:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:51,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:10:51,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:10:51,900 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-01-01 22:10:51,900 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 258 states and 340 transitions. cyclomatic complexity: 89 Second operand 4 states. [2019-01-01 22:10:52,344 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-01-01 22:10:52,345 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-01-01 22:10:52,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:10:52,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2019-01-01 22:10:52,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 166 transitions. Stem has 19 letters. Loop has 9 letters. [2019-01-01 22:10:52,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:52,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 166 transitions. Stem has 28 letters. Loop has 9 letters. [2019-01-01 22:10:52,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:52,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 166 transitions. Stem has 19 letters. Loop has 18 letters. [2019-01-01 22:10:52,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:52,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 460 states and 639 transitions. [2019-01-01 22:10:52,352 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 159 [2019-01-01 22:10:52,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 460 states to 425 states and 589 transitions. [2019-01-01 22:10:52,355 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 219 [2019-01-01 22:10:52,355 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 245 [2019-01-01 22:10:52,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 425 states and 589 transitions. [2019-01-01 22:10:52,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:10:52,357 INFO L705 BuchiCegarLoop]: Abstraction has 425 states and 589 transitions. [2019-01-01 22:10:52,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states and 589 transitions. [2019-01-01 22:10:52,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 343. [2019-01-01 22:10:52,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-01-01 22:10:52,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 460 transitions. [2019-01-01 22:10:52,369 INFO L728 BuchiCegarLoop]: Abstraction has 343 states and 460 transitions. [2019-01-01 22:10:52,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:10:52,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:10:52,371 INFO L87 Difference]: Start difference. First operand 343 states and 460 transitions. Second operand 3 states. [2019-01-01 22:10:52,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:10:52,464 INFO L93 Difference]: Finished difference Result 397 states and 510 transitions. [2019-01-01 22:10:52,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:10:52,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 397 states and 510 transitions. [2019-01-01 22:10:52,470 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 154 [2019-01-01 22:10:52,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 397 states to 372 states and 485 transitions. [2019-01-01 22:10:52,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 223 [2019-01-01 22:10:52,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 230 [2019-01-01 22:10:52,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 372 states and 485 transitions. [2019-01-01 22:10:52,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:10:52,476 INFO L705 BuchiCegarLoop]: Abstraction has 372 states and 485 transitions. [2019-01-01 22:10:52,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states and 485 transitions. [2019-01-01 22:10:52,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 336. [2019-01-01 22:10:52,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-01-01 22:10:52,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 448 transitions. [2019-01-01 22:10:52,485 INFO L728 BuchiCegarLoop]: Abstraction has 336 states and 448 transitions. [2019-01-01 22:10:52,485 INFO L608 BuchiCegarLoop]: Abstraction has 336 states and 448 transitions. [2019-01-01 22:10:52,485 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 22:10:52,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 336 states and 448 transitions. [2019-01-01 22:10:52,488 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 152 [2019-01-01 22:10:52,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:10:52,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:10:52,489 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:10:52,489 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:10:52,491 INFO L794 eck$LassoCheckResult]: Stem: 5212#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; 5213#L177 assume !false; 5411#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 5407#L30 assume 8466 == main_~s__state~0; 5406#L31 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 5405#L79-1 main_~s__state~0 := 8496; 5404#L177 assume !false; 5403#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 5399#L30 assume !(8466 == main_~s__state~0); 5395#L33 assume 8496 == main_~s__state~0; 5391#L34 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 5389#L86-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 5156#L177 [2019-01-01 22:10:52,491 INFO L796 eck$LassoCheckResult]: Loop: 5156#L177 assume !false; 5157#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 5191#L30 assume !(8466 == main_~s__state~0); 5192#L33 assume !(8496 == main_~s__state~0); 5183#L37 assume !(8512 == main_~s__state~0); 5184#L41 assume !(8528 == main_~s__state~0); 5180#L45 assume !(8544 == main_~s__state~0); 5152#L49 assume !(8560 == main_~s__state~0); 5153#L53 assume !(8576 == main_~s__state~0); 5211#L57 assume !(8592 == main_~s__state~0); 5189#L61 assume !(8608 == main_~s__state~0); 5175#L65 assume !(8640 == main_~s__state~0); 5145#L69 assume 8656 == main_~s__state~0; 5146#L70 assume 2 == main_~blastFlag~0;main_~blastFlag~0 := 3; 5186#L163-1 main_~s__state~0 := 8672; 5156#L177 [2019-01-01 22:10:52,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:52,491 INFO L82 PathProgramCache]: Analyzing trace with hash -883919713, now seen corresponding path program 1 times [2019-01-01 22:10:52,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:52,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:52,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:52,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:52,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:52,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:52,507 INFO L82 PathProgramCache]: Analyzing trace with hash -15441655, now seen corresponding path program 1 times [2019-01-01 22:10:52,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:52,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:52,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:52,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:52,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:52,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:52,519 INFO L82 PathProgramCache]: Analyzing trace with hash 2052349099, now seen corresponding path program 1 times [2019-01-01 22:10:52,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:52,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:52,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:52,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:52,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:52,621 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:10:52,621 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:10:52,621 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:10:52,622 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:10:52,622 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:10:52,622 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:52,622 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:10:52,622 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:10:52,623 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration7_Loop [2019-01-01 22:10:52,623 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:10:52,623 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:10:52,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:52,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:52,724 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:10:52,724 INFO L412 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) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:52,728 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:10:52,729 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-01-01 22:10:52,751 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:10:52,751 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:10:52,756 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:10:52,775 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:10:52,776 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:10:52,776 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:10:52,776 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:10:52,776 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:10:52,776 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:52,776 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:10:52,776 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:10:52,776 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration7_Loop [2019-01-01 22:10:52,777 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:10:52,777 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:10:52,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:52,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:52,832 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:10:52,833 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:10:52,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:10:52,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:10:52,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:10:52,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:10:52,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:10:52,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:10:52,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:10:52,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:10:52,842 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:10:52,848 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:10:52,848 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:10:52,849 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:10:52,849 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:10:52,850 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:10:52,850 INFO L520 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-01-01 22:10:52,850 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:10:52,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:52,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:10:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:52,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:10:53,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:10:53,011 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-01-01 22:10:53,011 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 336 states and 448 transitions. cyclomatic complexity: 120 Second operand 4 states. [2019-01-01 22:10:53,074 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-01-01 22:10:53,082 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-01-01 22:10:53,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:10:53,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2019-01-01 22:10:53,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 12 letters. Loop has 15 letters. [2019-01-01 22:10:53,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:53,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 27 letters. Loop has 15 letters. [2019-01-01 22:10:53,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:53,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 12 letters. Loop has 30 letters. [2019-01-01 22:10:53,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:53,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 442 states and 583 transitions. [2019-01-01 22:10:53,090 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 220 [2019-01-01 22:10:53,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 442 states to 436 states and 575 transitions. [2019-01-01 22:10:53,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 278 [2019-01-01 22:10:53,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 279 [2019-01-01 22:10:53,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 436 states and 575 transitions. [2019-01-01 22:10:53,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:10:53,096 INFO L705 BuchiCegarLoop]: Abstraction has 436 states and 575 transitions. [2019-01-01 22:10:53,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states and 575 transitions. [2019-01-01 22:10:53,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 432. [2019-01-01 22:10:53,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-01-01 22:10:53,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 570 transitions. [2019-01-01 22:10:53,110 INFO L728 BuchiCegarLoop]: Abstraction has 432 states and 570 transitions. [2019-01-01 22:10:53,110 INFO L608 BuchiCegarLoop]: Abstraction has 432 states and 570 transitions. [2019-01-01 22:10:53,110 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 22:10:53,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 432 states and 570 transitions. [2019-01-01 22:10:53,114 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 220 [2019-01-01 22:10:53,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:10:53,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:10:53,117 INFO L866 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-01-01 22:10:53,119 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:10:53,119 INFO L794 eck$LassoCheckResult]: Stem: 6106#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; 6107#L177 assume !false; 6232#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 6231#L30 assume 8466 == main_~s__state~0; 6228#L31 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 6224#L79-1 main_~s__state~0 := 8496; 6220#L177 assume !false; 6219#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 6218#L30 assume !(8466 == main_~s__state~0); 6217#L33 assume 8496 == main_~s__state~0; 6214#L34 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 6207#L86-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 6102#L177 assume !false; 6276#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 6404#L30 assume !(8466 == main_~s__state~0); 6403#L33 assume !(8496 == main_~s__state~0); 6401#L37 assume !(8512 == main_~s__state~0); 6400#L41 assume !(8528 == main_~s__state~0); 6398#L45 assume !(8544 == main_~s__state~0); 6396#L49 assume !(8560 == main_~s__state~0); 6394#L53 assume !(8576 == main_~s__state~0); 6121#L57 assume !(8592 == main_~s__state~0); 6078#L61 assume !(8608 == main_~s__state~0); 6062#L65 assume !(8640 == main_~s__state~0); 6029#L69 assume !(8656 == main_~s__state~0); 6030#L73 [2019-01-01 22:10:53,119 INFO L796 eck$LassoCheckResult]: Loop: 6030#L73 assume 8672 == main_~s__state~0; 6054#L74 assume 4 == main_~blastFlag~0;main_~blastFlag~0 := 5; 6055#L170-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8640; 6028#L177 assume !false; 6324#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 6322#L30 assume !(8466 == main_~s__state~0); 6319#L33 assume !(8496 == main_~s__state~0); 6317#L37 assume !(8512 == main_~s__state~0); 6315#L41 assume !(8528 == main_~s__state~0); 6314#L45 assume !(8544 == main_~s__state~0); 6313#L49 assume !(8560 == main_~s__state~0); 6281#L53 assume !(8576 == main_~s__state~0); 6283#L57 assume !(8592 == main_~s__state~0); 6235#L61 assume !(8608 == main_~s__state~0); 6233#L65 assume !(8640 == main_~s__state~0); 6234#L69 assume !(8656 == main_~s__state~0); 6030#L73 [2019-01-01 22:10:53,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:53,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1204368937, now seen corresponding path program 1 times [2019-01-01 22:10:53,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:53,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:53,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:53,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:53,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:53,168 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 22:10:53,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:10:53,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:10:53,169 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:10:53,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:53,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1774399381, now seen corresponding path program 1 times [2019-01-01 22:10:53,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:53,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:53,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:53,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:53,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:53,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-01-01 22:10:53,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:10:53,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:10:53,203 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:10:53,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:10:53,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:10:53,205 INFO L87 Difference]: Start difference. First operand 432 states and 570 transitions. cyclomatic complexity: 148 Second operand 3 states. [2019-01-01 22:10:53,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:10:53,290 INFO L93 Difference]: Finished difference Result 409 states and 528 transitions. [2019-01-01 22:10:53,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:10:53,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 409 states and 528 transitions. [2019-01-01 22:10:53,295 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 194 [2019-01-01 22:10:53,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 409 states to 409 states and 528 transitions. [2019-01-01 22:10:53,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 252 [2019-01-01 22:10:53,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 252 [2019-01-01 22:10:53,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 409 states and 528 transitions. [2019-01-01 22:10:53,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:10:53,299 INFO L705 BuchiCegarLoop]: Abstraction has 409 states and 528 transitions. [2019-01-01 22:10:53,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states and 528 transitions. [2019-01-01 22:10:53,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 376. [2019-01-01 22:10:53,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-01-01 22:10:53,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 491 transitions. [2019-01-01 22:10:53,309 INFO L728 BuchiCegarLoop]: Abstraction has 376 states and 491 transitions. [2019-01-01 22:10:53,310 INFO L608 BuchiCegarLoop]: Abstraction has 376 states and 491 transitions. [2019-01-01 22:10:53,310 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 22:10:53,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 376 states and 491 transitions. [2019-01-01 22:10:53,313 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 161 [2019-01-01 22:10:53,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:10:53,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:10:53,316 INFO L866 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-01-01 22:10:53,317 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:10:53,317 INFO L794 eck$LassoCheckResult]: Stem: 6952#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; 6953#L177 assume !false; 7115#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7113#L30 assume 8466 == main_~s__state~0; 7111#L31 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 7109#L79-1 main_~s__state~0 := 8496; 7107#L177 assume !false; 7105#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7103#L30 assume !(8466 == main_~s__state~0); 7101#L33 assume 8496 == main_~s__state~0; 7099#L34 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 7096#L86-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 6949#L177 assume !false; 7092#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7226#L30 assume !(8466 == main_~s__state~0); 7225#L33 assume !(8496 == main_~s__state~0); 7224#L37 assume !(8512 == main_~s__state~0); 7222#L41 assume !(8528 == main_~s__state~0); 7216#L45 assume !(8544 == main_~s__state~0); 7213#L49 assume !(8560 == main_~s__state~0); 7210#L53 assume !(8576 == main_~s__state~0); 7207#L57 assume !(8592 == main_~s__state~0); 7204#L61 assume !(8608 == main_~s__state~0); 7201#L65 assume !(8640 == main_~s__state~0); 6877#L69 assume !(8656 == main_~s__state~0); 6878#L73 [2019-01-01 22:10:53,317 INFO L796 eck$LassoCheckResult]: Loop: 6878#L73 assume 8672 == main_~s__state~0; 6902#L74 assume 4 == main_~blastFlag~0;main_~blastFlag~0 := 5; 6903#L170-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8640; 6901#L177 assume !false; 7250#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7249#L30 assume !(8466 == main_~s__state~0); 7248#L33 assume !(8496 == main_~s__state~0); 7247#L37 assume !(8512 == main_~s__state~0); 7246#L41 assume !(8528 == main_~s__state~0); 7245#L45 assume !(8544 == main_~s__state~0); 7244#L49 assume !(8560 == main_~s__state~0); 7243#L53 assume !(8576 == main_~s__state~0); 7242#L57 assume !(8592 == main_~s__state~0); 7238#L61 assume !(8608 == main_~s__state~0); 7171#L65 assume 8640 == main_~s__state~0; 6957#L66 assume 3 == main_~blastFlag~0;main_~blastFlag~0 := 4; 6955#L152-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8656; 6885#L177 assume !false; 6886#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 6931#L30 assume !(8466 == main_~s__state~0); 6932#L33 assume !(8496 == main_~s__state~0); 6919#L37 assume !(8512 == main_~s__state~0); 6920#L41 assume !(8528 == main_~s__state~0); 6916#L45 assume !(8544 == main_~s__state~0); 6889#L49 assume !(8560 == main_~s__state~0); 6890#L53 assume !(8576 == main_~s__state~0); 6950#L57 assume !(8592 == main_~s__state~0); 6928#L61 assume !(8608 == main_~s__state~0); 6909#L65 assume !(8640 == main_~s__state~0); 6910#L69 assume !(8656 == main_~s__state~0); 6878#L73 [2019-01-01 22:10:53,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:53,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1204368937, now seen corresponding path program 2 times [2019-01-01 22:10:53,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:53,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:53,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:53,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:53,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:53,353 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 22:10:53,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:10:53,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:10:53,354 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:10:53,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:53,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1325834225, now seen corresponding path program 1 times [2019-01-01 22:10:53,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:53,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:53,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:53,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:10:53,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:53,385 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:10:53,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:10:53,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:10:53,387 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:10:53,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:10:53,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:10:53,387 INFO L87 Difference]: Start difference. First operand 376 states and 491 transitions. cyclomatic complexity: 125 Second operand 3 states. [2019-01-01 22:10:53,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:10:53,464 INFO L93 Difference]: Finished difference Result 413 states and 527 transitions. [2019-01-01 22:10:53,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:10:53,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 413 states and 527 transitions. [2019-01-01 22:10:53,468 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 174 [2019-01-01 22:10:53,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 413 states to 401 states and 515 transitions. [2019-01-01 22:10:53,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 232 [2019-01-01 22:10:53,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 232 [2019-01-01 22:10:53,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 401 states and 515 transitions. [2019-01-01 22:10:53,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:10:53,472 INFO L705 BuchiCegarLoop]: Abstraction has 401 states and 515 transitions. [2019-01-01 22:10:53,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states and 515 transitions. [2019-01-01 22:10:53,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 389. [2019-01-01 22:10:53,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-01-01 22:10:53,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 503 transitions. [2019-01-01 22:10:53,481 INFO L728 BuchiCegarLoop]: Abstraction has 389 states and 503 transitions. [2019-01-01 22:10:53,481 INFO L608 BuchiCegarLoop]: Abstraction has 389 states and 503 transitions. [2019-01-01 22:10:53,481 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 22:10:53,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 389 states and 503 transitions. [2019-01-01 22:10:53,485 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 174 [2019-01-01 22:10:53,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:10:53,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:10:53,486 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:10:53,486 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:10:53,487 INFO L794 eck$LassoCheckResult]: Stem: 7747#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; 7748#L177 assume !false; 7953#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7948#L30 assume 8466 == main_~s__state~0; 7943#L31 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 7942#L79-1 main_~s__state~0 := 8496; 7938#L177 assume !false; 7934#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7929#L30 assume !(8466 == main_~s__state~0); 7925#L33 assume 8496 == main_~s__state~0; 7922#L34 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 7920#L86-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 7918#L177 assume !false; 7916#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7915#L30 assume !(8466 == main_~s__state~0); 7914#L33 assume !(8496 == main_~s__state~0); 7910#L37 assume 8512 == main_~s__state~0; 7679#L38 main_~s__state~0 := 8528; 7680#L177 assume !false; 8038#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7979#L30 assume !(8466 == main_~s__state~0); 7978#L33 assume !(8496 == main_~s__state~0); 7976#L37 assume !(8512 == main_~s__state~0); 7968#L41 assume !(8528 == main_~s__state~0); 7826#L45 assume !(8544 == main_~s__state~0); 7767#L49 assume !(8560 == main_~s__state~0); 7765#L53 [2019-01-01 22:10:53,487 INFO L796 eck$LassoCheckResult]: Loop: 7765#L53 assume !(8576 == main_~s__state~0); 7762#L57 assume 8592 == main_~s__state~0; 7671#L58 main_~s__state~0 := 8608; 7672#L177 assume !false; 7872#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 7862#L30 assume !(8466 == main_~s__state~0); 7857#L33 assume !(8496 == main_~s__state~0); 7789#L37 assume !(8512 == main_~s__state~0); 7781#L41 assume !(8528 == main_~s__state~0); 7774#L45 assume !(8544 == main_~s__state~0); 7764#L49 assume !(8560 == main_~s__state~0); 7765#L53 [2019-01-01 22:10:53,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:53,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1695835077, now seen corresponding path program 1 times [2019-01-01 22:10:53,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:53,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:53,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:53,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:53,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:53,556 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-01 22:10:53,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:10:53,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:10:53,557 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:10:53,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:53,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1642596384, now seen corresponding path program 1 times [2019-01-01 22:10:53,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:53,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:53,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:53,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:53,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:53,661 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:10:53,661 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:10:53,662 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:10:53,662 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:10:53,662 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:10:53,662 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:53,662 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:10:53,662 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:10:53,663 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration10_Loop [2019-01-01 22:10:53,663 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:10:53,663 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:10:53,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:53,711 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:10:53,711 INFO L412 LassoAnalysis]: Checking for nontermination... 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-01-01 22:10:53,716 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:10:53,716 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-01-01 22:10:53,747 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:10:53,747 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:10:53,751 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:10:53,770 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:10:53,770 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:10:53,770 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:10:53,770 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:10:53,770 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:10:53,770 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:10:53,770 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:10:53,771 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:10:53,771 INFO L131 ssoRankerPreferences]: Filename of dumped script: s3_srvr_1a_true-unreach-call_false-termination.cil.c_Iteration10_Loop [2019-01-01 22:10:53,771 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:10:53,771 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:10:53,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:10:53,809 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:10:53,810 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:10:53,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:10:53,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:10:53,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:10:53,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:10:53,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:10:53,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:10:53,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:10:53,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:10:53,822 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:10:53,824 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:10:53,824 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:10:53,825 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:10:53,825 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:10:53,825 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:10:53,825 INFO L520 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-01-01 22:10:53,828 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:10:53,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:53,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:10:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:53,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:10:53,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:10:53,898 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-01-01 22:10:53,898 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 389 states and 503 transitions. cyclomatic complexity: 124 Second operand 5 states. [2019-01-01 22:10:54,639 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-01-01 22:10:54,640 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-01-01 22:10:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 22:10:54,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 175 transitions. [2019-01-01 22:10:54,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 175 transitions. Stem has 26 letters. Loop has 11 letters. [2019-01-01 22:10:54,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:54,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 175 transitions. Stem has 37 letters. Loop has 11 letters. [2019-01-01 22:10:54,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:54,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 175 transitions. Stem has 26 letters. Loop has 22 letters. [2019-01-01 22:10:54,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:10:54,643 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 596 states and 801 transitions. [2019-01-01 22:10:54,649 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 197 [2019-01-01 22:10:54,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 596 states to 553 states and 744 transitions. [2019-01-01 22:10:54,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 273 [2019-01-01 22:10:54,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 293 [2019-01-01 22:10:54,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 553 states and 744 transitions. [2019-01-01 22:10:54,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:10:54,655 INFO L705 BuchiCegarLoop]: Abstraction has 553 states and 744 transitions. [2019-01-01 22:10:54,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states and 744 transitions. [2019-01-01 22:10:54,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 452. [2019-01-01 22:10:54,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-01-01 22:10:54,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 598 transitions. [2019-01-01 22:10:54,670 INFO L728 BuchiCegarLoop]: Abstraction has 452 states and 598 transitions. [2019-01-01 22:10:54,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:10:54,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:10:54,673 INFO L87 Difference]: Start difference. First operand 452 states and 598 transitions. Second operand 3 states. [2019-01-01 22:10:55,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:10:55,252 INFO L93 Difference]: Finished difference Result 471 states and 603 transitions. [2019-01-01 22:10:55,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:10:55,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 471 states and 603 transitions. [2019-01-01 22:10:55,257 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 166 [2019-01-01 22:10:55,262 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 471 states to 442 states and 570 transitions. [2019-01-01 22:10:55,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 234 [2019-01-01 22:10:55,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 236 [2019-01-01 22:10:55,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 442 states and 570 transitions. [2019-01-01 22:10:55,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:10:55,265 INFO L705 BuchiCegarLoop]: Abstraction has 442 states and 570 transitions. [2019-01-01 22:10:55,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states and 570 transitions. [2019-01-01 22:10:55,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 440. [2019-01-01 22:10:55,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-01-01 22:10:55,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 568 transitions. [2019-01-01 22:10:55,304 INFO L728 BuchiCegarLoop]: Abstraction has 440 states and 568 transitions. [2019-01-01 22:10:55,304 INFO L608 BuchiCegarLoop]: Abstraction has 440 states and 568 transitions. [2019-01-01 22:10:55,304 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 22:10:55,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 440 states and 568 transitions. [2019-01-01 22:10:55,309 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 165 [2019-01-01 22:10:55,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:10:55,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:10:55,310 INFO L866 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-01-01 22:10:55,310 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:10:55,310 INFO L794 eck$LassoCheckResult]: Stem: 9806#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; 9807#L177 assume !false; 9886#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 9884#L30 assume 8466 == main_~s__state~0; 9882#L31 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 9880#L79-1 main_~s__state~0 := 8496; 9877#L177 assume !false; 9876#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 9875#L30 assume !(8466 == main_~s__state~0); 9873#L33 assume 8496 == main_~s__state~0; 9867#L34 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 9864#L86-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 9865#L177 assume !false; 10093#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10090#L30 assume !(8466 == main_~s__state~0); 10088#L33 assume !(8496 == main_~s__state~0); 10086#L37 assume 8512 == main_~s__state~0; 10083#L38 main_~s__state~0 := 8528; 10080#L177 assume !false; 10077#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10075#L30 assume !(8466 == main_~s__state~0); 10073#L33 assume !(8496 == main_~s__state~0); 10070#L37 assume !(8512 == main_~s__state~0); 10067#L41 assume 8528 == main_~s__state~0; 9788#L42 main_~s__state~0 := 8544; 9797#L177 assume !false; 10041#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10112#L30 assume !(8466 == main_~s__state~0); 10111#L33 assume !(8496 == main_~s__state~0); 10107#L37 assume !(8512 == main_~s__state~0); 9786#L41 assume !(8528 == main_~s__state~0); 9787#L45 assume !(8544 == main_~s__state~0); 9891#L49 assume !(8560 == main_~s__state~0); 9839#L53 assume 8576 == main_~s__state~0; 9755#L54 [2019-01-01 22:10:55,310 INFO L796 eck$LassoCheckResult]: Loop: 9755#L54 main_~tmp___1~0 := main_#t~nondet4;havoc main_#t~nondet4; 9756#L136 assume !(2 == main_~tmp___1~0);main_~s__state~0 := 8592; 9777#L177 assume !false; 10018#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10017#L30 assume !(8466 == main_~s__state~0); 10016#L33 assume !(8496 == main_~s__state~0); 10014#L37 assume !(8512 == main_~s__state~0); 9948#L41 assume !(8528 == main_~s__state~0); 9835#L45 assume !(8544 == main_~s__state~0); 9828#L49 assume !(8560 == main_~s__state~0); 9829#L53 assume 8576 == main_~s__state~0; 9755#L54 [2019-01-01 22:10:55,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:55,312 INFO L82 PathProgramCache]: Analyzing trace with hash -682922250, now seen corresponding path program 1 times [2019-01-01 22:10:55,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:55,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:55,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:55,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:55,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:55,367 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-01 22:10:55,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:10:55,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:10:55,368 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:10:55,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:55,368 INFO L82 PathProgramCache]: Analyzing trace with hash -589369450, now seen corresponding path program 1 times [2019-01-01 22:10:55,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:55,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:55,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:55,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:55,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:55,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:10:55,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:10:55,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:10:55,394 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:10:55,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:10:55,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:10:55,395 INFO L87 Difference]: Start difference. First operand 440 states and 568 transitions. cyclomatic complexity: 137 Second operand 3 states. [2019-01-01 22:10:55,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:10:55,587 INFO L93 Difference]: Finished difference Result 465 states and 582 transitions. [2019-01-01 22:10:55,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:10:55,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 465 states and 582 transitions. [2019-01-01 22:10:55,590 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 165 [2019-01-01 22:10:55,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 465 states to 456 states and 573 transitions. [2019-01-01 22:10:55,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 240 [2019-01-01 22:10:55,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 240 [2019-01-01 22:10:55,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 456 states and 573 transitions. [2019-01-01 22:10:55,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:10:55,595 INFO L705 BuchiCegarLoop]: Abstraction has 456 states and 573 transitions. [2019-01-01 22:10:55,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states and 573 transitions. [2019-01-01 22:10:55,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 449. [2019-01-01 22:10:55,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-01-01 22:10:55,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 562 transitions. [2019-01-01 22:10:55,602 INFO L728 BuchiCegarLoop]: Abstraction has 449 states and 562 transitions. [2019-01-01 22:10:55,602 INFO L608 BuchiCegarLoop]: Abstraction has 449 states and 562 transitions. [2019-01-01 22:10:55,602 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-01 22:10:55,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 449 states and 562 transitions. [2019-01-01 22:10:55,607 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 165 [2019-01-01 22:10:55,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:10:55,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:10:55,610 INFO L866 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-01-01 22:10:55,610 INFO L867 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-01-01 22:10:55,610 INFO L794 eck$LassoCheckResult]: Stem: 10723#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; 10724#L177 assume !false; 10856#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10854#L30 assume 8466 == main_~s__state~0; 10852#L31 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 10851#L79-1 main_~s__state~0 := 8496; 10849#L177 assume !false; 10847#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10845#L30 assume !(8466 == main_~s__state~0); 10843#L33 assume 8496 == main_~s__state~0; 10841#L34 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 10838#L86-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 10839#L177 assume !false; 11070#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 11069#L30 assume !(8466 == main_~s__state~0); 11051#L33 assume !(8496 == main_~s__state~0); 10679#L37 assume 8512 == main_~s__state~0; 10680#L38 main_~s__state~0 := 8528; 10918#L177 assume !false; 10917#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10915#L30 assume !(8466 == main_~s__state~0); 10908#L33 assume !(8496 == main_~s__state~0); 10903#L37 assume !(8512 == main_~s__state~0); 10898#L41 assume 8528 == main_~s__state~0; 10895#L42 main_~s__state~0 := 8544; 10892#L177 assume !false; 10890#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10888#L30 assume !(8466 == main_~s__state~0); 10886#L33 assume !(8496 == main_~s__state~0); 10884#L37 assume !(8512 == main_~s__state~0); 10880#L41 assume !(8528 == main_~s__state~0); 10864#L45 assume !(8544 == main_~s__state~0); 10861#L49 assume !(8560 == main_~s__state~0); 10758#L53 assume 8576 == main_~s__state~0; 10665#L54 [2019-01-01 22:10:55,610 INFO L796 eck$LassoCheckResult]: Loop: 10665#L54 main_~tmp___1~0 := main_#t~nondet4;havoc main_#t~nondet4; 10666#L136 assume 2 == main_~tmp___1~0;main_~s__state~0 := 8466; 10693#L177 assume !false; 10899#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10896#L30 assume 8466 == main_~s__state~0; 10834#L31 assume !(0 == main_~blastFlag~0); 10891#L79-1 main_~s__state~0 := 8496; 10889#L177 assume !false; 10887#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10885#L30 assume !(8466 == main_~s__state~0); 10881#L33 assume 8496 == main_~s__state~0; 10831#L34 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 10860#L86-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 10859#L177 assume !false; 10858#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10857#L30 assume !(8466 == main_~s__state~0); 10855#L33 assume !(8496 == main_~s__state~0); 10853#L37 assume 8512 == main_~s__state~0; 10753#L38 main_~s__state~0 := 8528; 10850#L177 assume !false; 10848#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10846#L30 assume !(8466 == main_~s__state~0); 10844#L33 assume !(8496 == main_~s__state~0); 10842#L37 assume !(8512 == main_~s__state~0); 10840#L41 assume 8528 == main_~s__state~0; 10750#L42 main_~s__state~0 := 8544; 10687#L177 assume !false; 10836#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 10833#L30 assume !(8466 == main_~s__state~0); 10830#L33 assume !(8496 == main_~s__state~0); 10752#L37 assume !(8512 == main_~s__state~0); 10749#L41 assume !(8528 == main_~s__state~0); 10745#L45 assume !(8544 == main_~s__state~0); 10741#L49 assume !(8560 == main_~s__state~0); 10742#L53 assume 8576 == main_~s__state~0; 10665#L54 [2019-01-01 22:10:55,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:55,617 INFO L82 PathProgramCache]: Analyzing trace with hash -682922250, now seen corresponding path program 2 times [2019-01-01 22:10:55,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:55,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:55,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:55,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:55,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:55,697 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-01 22:10:55,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:10:55,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:10:55,698 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:10:55,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:55,698 INFO L82 PathProgramCache]: Analyzing trace with hash 2085672464, now seen corresponding path program 1 times [2019-01-01 22:10:55,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:55,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:55,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:55,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:10:55,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:55,757 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-01 22:10:55,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:10:55,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:10:55,759 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:10:55,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:10:55,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:10:55,759 INFO L87 Difference]: Start difference. First operand 449 states and 562 transitions. cyclomatic complexity: 123 Second operand 3 states. [2019-01-01 22:10:55,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:10:55,888 INFO L93 Difference]: Finished difference Result 453 states and 549 transitions. [2019-01-01 22:10:55,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:10:55,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 453 states and 549 transitions. [2019-01-01 22:10:55,894 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 147 [2019-01-01 22:10:55,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 453 states to 415 states and 506 transitions. [2019-01-01 22:10:55,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 217 [2019-01-01 22:10:55,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 219 [2019-01-01 22:10:55,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 415 states and 506 transitions. [2019-01-01 22:10:55,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:10:55,898 INFO L705 BuchiCegarLoop]: Abstraction has 415 states and 506 transitions. [2019-01-01 22:10:55,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states and 506 transitions. [2019-01-01 22:10:55,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 413. [2019-01-01 22:10:55,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-01-01 22:10:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 504 transitions. [2019-01-01 22:10:55,907 INFO L728 BuchiCegarLoop]: Abstraction has 413 states and 504 transitions. [2019-01-01 22:10:55,907 INFO L608 BuchiCegarLoop]: Abstraction has 413 states and 504 transitions. [2019-01-01 22:10:55,908 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-01 22:10:55,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 413 states and 504 transitions. [2019-01-01 22:10:55,913 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 146 [2019-01-01 22:10:55,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:10:55,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:10:55,915 INFO L866 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-01-01 22:10:55,916 INFO L867 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-01-01 22:10:55,916 INFO L794 eck$LassoCheckResult]: Stem: 11620#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; 11621#L177 assume !false; 11705#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 11703#L30 assume 8466 == main_~s__state~0; 11691#L31 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 11689#L79-1 main_~s__state~0 := 8496; 11687#L177 assume !false; 11685#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 11683#L30 assume !(8466 == main_~s__state~0); 11681#L33 assume 8496 == main_~s__state~0; 11679#L34 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 11676#L86-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 11674#L177 assume !false; 11672#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 11670#L30 assume !(8466 == main_~s__state~0); 11668#L33 assume !(8496 == main_~s__state~0); 11666#L37 assume !(8512 == main_~s__state~0); 11664#L41 assume !(8528 == main_~s__state~0); 11662#L45 assume !(8544 == main_~s__state~0); 11661#L49 assume !(8560 == main_~s__state~0); 11646#L53 assume !(8576 == main_~s__state~0); 11633#L57 assume !(8592 == main_~s__state~0); 11594#L61 assume !(8608 == main_~s__state~0); 11577#L65 assume !(8640 == main_~s__state~0); 11543#L69 assume 8656 == main_~s__state~0; 11544#L70 assume !(2 == main_~blastFlag~0); 11588#L163-1 main_~s__state~0 := 8672; 11627#L177 assume !false; 11916#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 11914#L30 assume !(8466 == main_~s__state~0); 11912#L33 assume !(8496 == main_~s__state~0); 11910#L37 assume !(8512 == main_~s__state~0); 11907#L41 assume !(8528 == main_~s__state~0); 11903#L45 assume !(8544 == main_~s__state~0); 11899#L49 assume !(8560 == main_~s__state~0); 11898#L53 assume !(8576 == main_~s__state~0); 11897#L57 assume !(8592 == main_~s__state~0); 11895#L61 assume !(8608 == main_~s__state~0); 11893#L65 assume !(8640 == main_~s__state~0); 11863#L69 assume !(8656 == main_~s__state~0); 11566#L73 [2019-01-01 22:10:55,916 INFO L796 eck$LassoCheckResult]: Loop: 11566#L73 assume 8672 == main_~s__state~0; 11567#L74 assume 4 == main_~blastFlag~0;main_~blastFlag~0 := 5; 11568#L170-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8640; 11565#L177 assume !false; 11924#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 11922#L30 assume !(8466 == main_~s__state~0); 11920#L33 assume !(8496 == main_~s__state~0); 11918#L37 assume !(8512 == main_~s__state~0); 11915#L41 assume !(8528 == main_~s__state~0); 11913#L45 assume !(8544 == main_~s__state~0); 11911#L49 assume !(8560 == main_~s__state~0); 11908#L53 assume !(8576 == main_~s__state~0); 11904#L57 assume !(8592 == main_~s__state~0); 11900#L61 assume !(8608 == main_~s__state~0); 11780#L65 assume 8640 == main_~s__state~0; 11625#L66 assume 3 == main_~blastFlag~0;main_~blastFlag~0 := 4; 11623#L152-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8656; 11624#L177 assume !false; 11941#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 11940#L30 assume !(8466 == main_~s__state~0); 11938#L33 assume !(8496 == main_~s__state~0); 11937#L37 assume !(8512 == main_~s__state~0); 11936#L41 assume !(8528 == main_~s__state~0); 11935#L45 assume !(8544 == main_~s__state~0); 11934#L49 assume !(8560 == main_~s__state~0); 11933#L53 assume !(8576 == main_~s__state~0); 11932#L57 assume !(8592 == main_~s__state~0); 11593#L61 assume !(8608 == main_~s__state~0); 11576#L65 assume !(8640 == main_~s__state~0); 11541#L69 assume 8656 == main_~s__state~0; 11542#L70 assume 2 == main_~blastFlag~0;main_~blastFlag~0 := 3; 11587#L163-1 main_~s__state~0 := 8672; 11626#L177 assume !false; 11951#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 11950#L30 assume !(8466 == main_~s__state~0); 11949#L33 assume !(8496 == main_~s__state~0); 11947#L37 assume !(8512 == main_~s__state~0); 11945#L41 assume !(8528 == main_~s__state~0); 11582#L45 assume !(8544 == main_~s__state~0); 11553#L49 assume !(8560 == main_~s__state~0); 11554#L53 assume !(8576 == main_~s__state~0); 11618#L57 assume !(8592 == main_~s__state~0); 11632#L61 assume !(8608 == main_~s__state~0); 11928#L65 assume !(8640 == main_~s__state~0); 11872#L69 assume !(8656 == main_~s__state~0); 11566#L73 [2019-01-01 22:10:55,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:55,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1636133345, now seen corresponding path program 1 times [2019-01-01 22:10:55,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:55,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:55,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:55,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:55,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:55,983 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 22:10:55,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:10:55,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:10:55,983 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:10:55,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:55,986 INFO L82 PathProgramCache]: Analyzing trace with hash -270758187, now seen corresponding path program 1 times [2019-01-01 22:10:55,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:55,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:55,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:55,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:55,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:56,052 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-01-01 22:10:56,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:10:56,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:10:56,052 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:10:56,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:10:56,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:10:56,056 INFO L87 Difference]: Start difference. First operand 413 states and 504 transitions. cyclomatic complexity: 99 Second operand 3 states. [2019-01-01 22:10:56,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:10:56,329 INFO L93 Difference]: Finished difference Result 429 states and 511 transitions. [2019-01-01 22:10:56,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:10:56,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 429 states and 511 transitions. [2019-01-01 22:10:56,336 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 134 [2019-01-01 22:10:56,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 429 states to 429 states and 511 transitions. [2019-01-01 22:10:56,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 239 [2019-01-01 22:10:56,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 239 [2019-01-01 22:10:56,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 429 states and 511 transitions. [2019-01-01 22:10:56,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:10:56,341 INFO L705 BuchiCegarLoop]: Abstraction has 429 states and 511 transitions. [2019-01-01 22:10:56,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states and 511 transitions. [2019-01-01 22:10:56,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-01-01 22:10:56,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-01-01 22:10:56,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 511 transitions. [2019-01-01 22:10:56,352 INFO L728 BuchiCegarLoop]: Abstraction has 429 states and 511 transitions. [2019-01-01 22:10:56,352 INFO L608 BuchiCegarLoop]: Abstraction has 429 states and 511 transitions. [2019-01-01 22:10:56,353 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-01 22:10:56,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 429 states and 511 transitions. [2019-01-01 22:10:56,357 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 134 [2019-01-01 22:10:56,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:10:56,357 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:10:56,358 INFO L866 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-01-01 22:10:56,358 INFO L867 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-01-01 22:10:56,358 INFO L794 eck$LassoCheckResult]: Stem: 12471#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; 12472#L177 assume !false; 12694#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 12692#L30 assume 8466 == main_~s__state~0; 12690#L31 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 12688#L79-1 main_~s__state~0 := 8496; 12682#L177 assume !false; 12681#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 12679#L30 assume !(8466 == main_~s__state~0); 12677#L33 assume 8496 == main_~s__state~0; 12675#L34 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 12673#L86-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 12469#L177 assume !false; 12776#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 12783#L30 assume !(8466 == main_~s__state~0); 12782#L33 assume !(8496 == main_~s__state~0); 12781#L37 assume !(8512 == main_~s__state~0); 12456#L41 assume !(8528 == main_~s__state~0); 12433#L45 assume !(8544 == main_~s__state~0); 12400#L49 assume !(8560 == main_~s__state~0); 12401#L53 assume !(8576 == main_~s__state~0); 12467#L57 assume !(8592 == main_~s__state~0); 12448#L61 assume !(8608 == main_~s__state~0); 12427#L65 assume !(8640 == main_~s__state~0); 12392#L69 assume 8656 == main_~s__state~0; 12393#L70 assume 2 == main_~blastFlag~0;main_~blastFlag~0 := 3; 12441#L163-1 main_~s__state~0 := 8672; 12476#L177 assume !false; 12735#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 12733#L30 assume !(8466 == main_~s__state~0); 12731#L33 assume !(8496 == main_~s__state~0); 12728#L37 assume !(8512 == main_~s__state~0); 12724#L41 assume !(8528 == main_~s__state~0); 12722#L45 assume !(8544 == main_~s__state~0); 12720#L49 assume !(8560 == main_~s__state~0); 12717#L53 assume !(8576 == main_~s__state~0); 12714#L57 assume !(8592 == main_~s__state~0); 12712#L61 assume !(8608 == main_~s__state~0); 12711#L65 assume !(8640 == main_~s__state~0); 12390#L69 assume !(8656 == main_~s__state~0); 12391#L73 [2019-01-01 22:10:56,358 INFO L796 eck$LassoCheckResult]: Loop: 12391#L73 assume 8672 == main_~s__state~0; 12754#L74 assume 4 == main_~blastFlag~0;main_~blastFlag~0 := 5; 12417#L170-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8640; 12402#L177 assume !false; 12403#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 12452#L30 assume !(8466 == main_~s__state~0); 12453#L33 assume !(8496 == main_~s__state~0); 12435#L37 assume !(8512 == main_~s__state~0); 12436#L41 assume !(8528 == main_~s__state~0); 12432#L45 assume !(8544 == main_~s__state~0); 12398#L49 assume !(8560 == main_~s__state~0); 12399#L53 assume !(8576 == main_~s__state~0); 12466#L57 assume !(8592 == main_~s__state~0); 12446#L61 assume !(8608 == main_~s__state~0); 12447#L65 assume 8640 == main_~s__state~0; 12477#L66 assume 3 == main_~blastFlag~0;main_~blastFlag~0 := 4; 12473#L152-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8656; 12474#L177 assume !false; 12802#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 12800#L30 assume !(8466 == main_~s__state~0); 12798#L33 assume !(8496 == main_~s__state~0); 12796#L37 assume !(8512 == main_~s__state~0); 12794#L41 assume !(8528 == main_~s__state~0); 12792#L45 assume !(8544 == main_~s__state~0); 12790#L49 assume !(8560 == main_~s__state~0); 12788#L53 assume !(8576 == main_~s__state~0); 12786#L57 assume !(8592 == main_~s__state~0); 12784#L61 assume !(8608 == main_~s__state~0); 12425#L65 assume !(8640 == main_~s__state~0); 12426#L69 assume 8656 == main_~s__state~0; 12685#L70 assume 2 == main_~blastFlag~0;main_~blastFlag~0 := 3; 12440#L163-1 main_~s__state~0 := 8672; 12475#L177 assume !false; 12775#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 12774#L30 assume !(8466 == main_~s__state~0); 12773#L33 assume !(8496 == main_~s__state~0); 12772#L37 assume !(8512 == main_~s__state~0); 12770#L41 assume !(8528 == main_~s__state~0); 12768#L45 assume !(8544 == main_~s__state~0); 12766#L49 assume !(8560 == main_~s__state~0); 12764#L53 assume !(8576 == main_~s__state~0); 12763#L57 assume !(8592 == main_~s__state~0); 12762#L61 assume !(8608 == main_~s__state~0); 12761#L65 assume !(8640 == main_~s__state~0); 12759#L69 assume !(8656 == main_~s__state~0); 12391#L73 [2019-01-01 22:10:56,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:56,358 INFO L82 PathProgramCache]: Analyzing trace with hash -356269667, now seen corresponding path program 1 times [2019-01-01 22:10:56,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:56,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:56,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:56,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:56,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:56,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:56,383 INFO L82 PathProgramCache]: Analyzing trace with hash -270758187, now seen corresponding path program 2 times [2019-01-01 22:10:56,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:56,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:56,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:56,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:56,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:56,449 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-01-01 22:10:56,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:10:56,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:10:56,449 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:10:56,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:10:56,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:10:56,450 INFO L87 Difference]: Start difference. First operand 429 states and 511 transitions. cyclomatic complexity: 90 Second operand 3 states. [2019-01-01 22:10:56,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:10:56,540 INFO L93 Difference]: Finished difference Result 475 states and 558 transitions. [2019-01-01 22:10:56,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:10:56,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 475 states and 558 transitions. [2019-01-01 22:10:56,546 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 180 [2019-01-01 22:10:56,549 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 475 states to 475 states and 558 transitions. [2019-01-01 22:10:56,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 285 [2019-01-01 22:10:56,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 285 [2019-01-01 22:10:56,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 475 states and 558 transitions. [2019-01-01 22:10:56,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:10:56,550 INFO L705 BuchiCegarLoop]: Abstraction has 475 states and 558 transitions. [2019-01-01 22:10:56,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states and 558 transitions. [2019-01-01 22:10:56,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2019-01-01 22:10:56,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-01-01 22:10:56,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 558 transitions. [2019-01-01 22:10:56,563 INFO L728 BuchiCegarLoop]: Abstraction has 475 states and 558 transitions. [2019-01-01 22:10:56,563 INFO L608 BuchiCegarLoop]: Abstraction has 475 states and 558 transitions. [2019-01-01 22:10:56,563 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-01 22:10:56,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 475 states and 558 transitions. [2019-01-01 22:10:56,568 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 180 [2019-01-01 22:10:56,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:10:56,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:10:56,571 INFO L866 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-01-01 22:10:56,571 INFO L867 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-01-01 22:10:56,571 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#L177 assume !false; 13608#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 13601#L30 assume 8466 == main_~s__state~0; 13591#L31 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 13590#L79-1 main_~s__state~0 := 8496; 13589#L177 assume !false; 13587#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 13585#L30 assume !(8466 == main_~s__state~0); 13584#L33 assume 8496 == main_~s__state~0; 13582#L34 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 13580#L86-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8656; 13382#L177 assume !false; 13626#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 13625#L30 assume !(8466 == main_~s__state~0); 13622#L33 assume !(8496 == main_~s__state~0); 13618#L37 assume !(8512 == main_~s__state~0); 13370#L41 assume !(8528 == main_~s__state~0); 13347#L45 assume !(8544 == main_~s__state~0); 13348#L49 assume !(8560 == main_~s__state~0); 13527#L53 assume !(8576 == main_~s__state~0); 13401#L57 assume !(8592 == main_~s__state~0); 13362#L61 assume !(8608 == main_~s__state~0); 13341#L65 assume !(8640 == main_~s__state~0); 13302#L69 assume 8656 == main_~s__state~0; 13303#L70 assume 2 == main_~blastFlag~0;main_~blastFlag~0 := 3; 13356#L163-1 main_~s__state~0 := 8672; 13391#L177 assume !false; 13524#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 13686#L30 assume !(8466 == main_~s__state~0); 13685#L33 assume !(8496 == main_~s__state~0); 13684#L37 assume !(8512 == main_~s__state~0); 13683#L41 assume !(8528 == main_~s__state~0); 13682#L45 assume !(8544 == main_~s__state~0); 13681#L49 assume !(8560 == main_~s__state~0); 13680#L53 assume !(8576 == main_~s__state~0); 13679#L57 assume !(8592 == main_~s__state~0); 13678#L61 assume !(8608 == main_~s__state~0); 13677#L65 assume !(8640 == main_~s__state~0); 13300#L69 assume !(8656 == main_~s__state~0); 13301#L73 [2019-01-01 22:10:56,571 INFO L796 eck$LassoCheckResult]: Loop: 13301#L73 assume 8672 == main_~s__state~0; 13744#L74 assume !(4 == main_~blastFlag~0); 13349#L173 assume !(5 == main_~blastFlag~0); 13329#L170-1 assume 0 != main_~s__hit~0;main_~s__state~0 := 8640; 13330#L177 assume !false; 13767#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 13765#L30 assume !(8466 == main_~s__state~0); 13763#L33 assume !(8496 == main_~s__state~0); 13761#L37 assume !(8512 == main_~s__state~0); 13759#L41 assume !(8528 == main_~s__state~0); 13756#L45 assume !(8544 == main_~s__state~0); 13753#L49 assume !(8560 == main_~s__state~0); 13750#L53 assume !(8576 == main_~s__state~0); 13748#L57 assume !(8592 == main_~s__state~0); 13361#L61 assume !(8608 == main_~s__state~0); 13339#L65 assume 8640 == main_~s__state~0; 13340#L66 assume 3 == main_~blastFlag~0;main_~blastFlag~0 := 4; 13717#L152-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8656; 13743#L177 assume !false; 13741#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 13739#L30 assume !(8466 == main_~s__state~0); 13737#L33 assume !(8496 == main_~s__state~0); 13735#L37 assume !(8512 == main_~s__state~0); 13733#L41 assume !(8528 == main_~s__state~0); 13731#L45 assume !(8544 == main_~s__state~0); 13729#L49 assume !(8560 == main_~s__state~0); 13727#L53 assume !(8576 == main_~s__state~0); 13725#L57 assume !(8592 == main_~s__state~0); 13723#L61 assume !(8608 == main_~s__state~0); 13721#L65 assume !(8640 == main_~s__state~0); 13671#L69 assume 8656 == main_~s__state~0; 13668#L70 assume 2 == main_~blastFlag~0;main_~blastFlag~0 := 3; 13390#L163-1 main_~s__state~0 := 8672; 13308#L177 assume !false; 13309#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 13366#L30 assume !(8466 == main_~s__state~0); 13367#L33 assume !(8496 == main_~s__state~0); 13350#L37 assume !(8512 == main_~s__state~0); 13351#L41 assume !(8528 == main_~s__state~0); 13346#L45 assume !(8544 == main_~s__state~0); 13312#L49 assume !(8560 == main_~s__state~0); 13313#L53 assume !(8576 == main_~s__state~0); 13384#L57 assume !(8592 == main_~s__state~0); 13746#L61 assume !(8608 == main_~s__state~0); 13675#L65 assume !(8640 == main_~s__state~0); 13676#L69 assume !(8656 == main_~s__state~0); 13301#L73 [2019-01-01 22:10:56,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:56,572 INFO L82 PathProgramCache]: Analyzing trace with hash -356269667, now seen corresponding path program 2 times [2019-01-01 22:10:56,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:56,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:56,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:56,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:10:56,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:56,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:56,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1348951222, now seen corresponding path program 1 times [2019-01-01 22:10:56,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:56,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:56,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:56,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:10:56,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:56,663 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-01-01 22:10:56,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:10:56,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:10:56,663 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:10:56,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:10:56,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:10:56,664 INFO L87 Difference]: Start difference. First operand 475 states and 558 transitions. cyclomatic complexity: 92 Second operand 3 states. [2019-01-01 22:10:56,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:10:56,734 INFO L93 Difference]: Finished difference Result 450 states and 530 transitions. [2019-01-01 22:10:56,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:10:56,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 450 states and 530 transitions. [2019-01-01 22:10:56,740 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 103 [2019-01-01 22:10:56,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 450 states to 352 states and 424 transitions. [2019-01-01 22:10:56,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 191 [2019-01-01 22:10:56,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 191 [2019-01-01 22:10:56,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 352 states and 424 transitions. [2019-01-01 22:10:56,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:10:56,744 INFO L705 BuchiCegarLoop]: Abstraction has 352 states and 424 transitions. [2019-01-01 22:10:56,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states and 424 transitions. [2019-01-01 22:10:56,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 351. [2019-01-01 22:10:56,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-01-01 22:10:56,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 423 transitions. [2019-01-01 22:10:56,753 INFO L728 BuchiCegarLoop]: Abstraction has 351 states and 423 transitions. [2019-01-01 22:10:56,754 INFO L608 BuchiCegarLoop]: Abstraction has 351 states and 423 transitions. [2019-01-01 22:10:56,756 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2019-01-01 22:10:56,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 351 states and 423 transitions. [2019-01-01 22:10:56,759 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 103 [2019-01-01 22:10:56,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:10:56,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:10:56,761 INFO L866 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-01-01 22:10:56,761 INFO L867 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-01-01 22:10:56,761 INFO L794 eck$LassoCheckResult]: Stem: 14301#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; 14302#L177 assume !false; 14481#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14480#L30 assume 8466 == main_~s__state~0; 14478#L31 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 14476#L79-1 main_~s__state~0 := 8496; 14475#L177 assume !false; 14473#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14471#L30 assume !(8466 == main_~s__state~0); 14469#L33 assume 8496 == main_~s__state~0; 14467#L34 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 14465#L86-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 14464#L177 assume !false; 14462#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14460#L30 assume !(8466 == main_~s__state~0); 14458#L33 assume !(8496 == main_~s__state~0); 14456#L37 assume 8512 == main_~s__state~0; 14454#L38 main_~s__state~0 := 8528; 14452#L177 assume !false; 14451#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14449#L30 assume !(8466 == main_~s__state~0); 14447#L33 assume !(8496 == main_~s__state~0); 14445#L37 assume !(8512 == main_~s__state~0); 14443#L41 assume 8528 == main_~s__state~0; 14441#L42 main_~s__state~0 := 8544; 14439#L177 assume !false; 14438#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14436#L30 assume !(8466 == main_~s__state~0); 14434#L33 assume !(8496 == main_~s__state~0); 14432#L37 assume !(8512 == main_~s__state~0); 14430#L41 assume !(8528 == main_~s__state~0); 14428#L45 assume 8544 == main_~s__state~0; 14309#L46 assume !(0 != 1 + main_~s__verify_mode~0);main_~s__state~0 := 8560; 14250#L177 assume !false; 14500#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14535#L30 assume !(8466 == main_~s__state~0); 14534#L33 assume !(8496 == main_~s__state~0); 14532#L37 assume !(8512 == main_~s__state~0); 14530#L41 assume !(8528 == main_~s__state~0); 14528#L45 assume !(8544 == main_~s__state~0); 14485#L49 assume !(8560 == main_~s__state~0); 14314#L53 assume 8576 == main_~s__state~0; 14255#L54 [2019-01-01 22:10:56,761 INFO L796 eck$LassoCheckResult]: Loop: 14255#L54 main_~tmp___1~0 := main_#t~nondet4;havoc main_#t~nondet4; 14256#L136 assume 2 == main_~tmp___1~0;main_~s__state~0 := 8466; 14276#L177 assume !false; 14418#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14416#L30 assume 8466 == main_~s__state~0; 14356#L31 assume !(0 == main_~blastFlag~0); 14411#L79-1 main_~s__state~0 := 8496; 14408#L177 assume !false; 14405#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14402#L30 assume !(8466 == main_~s__state~0); 14399#L33 assume 8496 == main_~s__state~0; 14353#L34 assume !(1 == main_~blastFlag~0); 14398#L86-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 14397#L177 assume !false; 14396#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14395#L30 assume !(8466 == main_~s__state~0); 14393#L33 assume !(8496 == main_~s__state~0); 14391#L37 assume 8512 == main_~s__state~0; 14350#L38 main_~s__state~0 := 8528; 14388#L177 assume !false; 14386#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14384#L30 assume !(8466 == main_~s__state~0); 14382#L33 assume !(8496 == main_~s__state~0); 14380#L37 assume !(8512 == main_~s__state~0); 14378#L41 assume 8528 == main_~s__state~0; 14347#L42 main_~s__state~0 := 8544; 14375#L177 assume !false; 14373#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14371#L30 assume !(8466 == main_~s__state~0); 14370#L33 assume !(8496 == main_~s__state~0); 14369#L37 assume !(8512 == main_~s__state~0); 14368#L41 assume !(8528 == main_~s__state~0); 14367#L45 assume 8544 == main_~s__state~0; 14345#L46 assume !(0 != 1 + main_~s__verify_mode~0);main_~s__state~0 := 8560; 14271#L177 assume !false; 14358#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 14355#L30 assume !(8466 == main_~s__state~0); 14352#L33 assume !(8496 == main_~s__state~0); 14349#L37 assume !(8512 == main_~s__state~0); 14346#L41 assume !(8528 == main_~s__state~0); 14344#L45 assume !(8544 == main_~s__state~0); 14343#L49 assume !(8560 == main_~s__state~0); 14313#L53 assume 8576 == main_~s__state~0; 14255#L54 [2019-01-01 22:10:56,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:56,768 INFO L82 PathProgramCache]: Analyzing trace with hash -2029459126, now seen corresponding path program 1 times [2019-01-01 22:10:56,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:56,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:56,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:56,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:56,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:56,837 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-01 22:10:56,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:10:56,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:10:56,838 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:10:56,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:56,838 INFO L82 PathProgramCache]: Analyzing trace with hash -16050654, now seen corresponding path program 1 times [2019-01-01 22:10:56,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:56,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:56,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:56,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:56,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:10:56,905 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-01 22:10:56,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:10:56,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:10:56,906 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:10:56,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:10:56,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:10:56,906 INFO L87 Difference]: Start difference. First operand 351 states and 423 transitions. cyclomatic complexity: 79 Second operand 3 states. [2019-01-01 22:10:56,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:10:56,978 INFO L93 Difference]: Finished difference Result 382 states and 443 transitions. [2019-01-01 22:10:56,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:10:56,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 382 states and 443 transitions. [2019-01-01 22:10:56,983 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 72 [2019-01-01 22:10:56,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 382 states to 336 states and 390 transitions. [2019-01-01 22:10:56,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 166 [2019-01-01 22:10:56,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2019-01-01 22:10:56,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 336 states and 390 transitions. [2019-01-01 22:10:56,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:10:56,985 INFO L705 BuchiCegarLoop]: Abstraction has 336 states and 390 transitions. [2019-01-01 22:10:56,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states and 390 transitions. [2019-01-01 22:10:56,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 335. [2019-01-01 22:10:56,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-01-01 22:10:56,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 389 transitions. [2019-01-01 22:10:56,993 INFO L728 BuchiCegarLoop]: Abstraction has 335 states and 389 transitions. [2019-01-01 22:10:56,993 INFO L608 BuchiCegarLoop]: Abstraction has 335 states and 389 transitions. [2019-01-01 22:10:56,993 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2019-01-01 22:10:56,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 335 states and 389 transitions. [2019-01-01 22:10:56,998 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 72 [2019-01-01 22:10:56,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:10:56,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:10:56,999 INFO L866 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-01-01 22:10:56,999 INFO L867 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-01-01 22:10:56,999 INFO L794 eck$LassoCheckResult]: Stem: 15045#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; 15046#L177 assume !false; 15232#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15230#L30 assume 8466 == main_~s__state~0; 15228#L31 assume 0 == main_~blastFlag~0;main_~blastFlag~0 := 1; 15226#L79-1 main_~s__state~0 := 8496; 15222#L177 assume !false; 15221#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15220#L30 assume !(8466 == main_~s__state~0); 15218#L33 assume 8496 == main_~s__state~0; 15216#L34 assume 1 == main_~blastFlag~0;main_~blastFlag~0 := 2; 15041#L86-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 15042#L177 assume !false; 15169#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15165#L30 assume !(8466 == main_~s__state~0); 15161#L33 assume !(8496 == main_~s__state~0); 15157#L37 assume 8512 == main_~s__state~0; 15153#L38 main_~s__state~0 := 8528; 15151#L177 assume !false; 15147#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15142#L30 assume !(8466 == main_~s__state~0); 15140#L33 assume !(8496 == main_~s__state~0); 15138#L37 assume !(8512 == main_~s__state~0); 15136#L41 assume 8528 == main_~s__state~0; 15032#L42 main_~s__state~0 := 8544; 15033#L177 assume !false; 15051#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15021#L30 assume !(8466 == main_~s__state~0); 15022#L33 assume !(8496 == main_~s__state~0); 15009#L37 assume !(8512 == main_~s__state~0); 15010#L41 assume !(8528 == main_~s__state~0); 15203#L45 assume 8544 == main_~s__state~0; 15200#L46 assume 0 != 1 + main_~s__verify_mode~0; 15198#L106 assume !(0 != main_~s__session__peer~0); 15195#L113 assume !(0 != (256 + main_~s__s3__tmp__new_cipher__algorithms~0) % 4294967296); 15191#L121 main_~s__state~0 := 8576; 15188#L177 assume !false; 15187#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15186#L30 assume !(8466 == main_~s__state~0); 15184#L33 assume !(8496 == main_~s__state~0); 15182#L37 assume !(8512 == main_~s__state~0); 15180#L41 assume !(8528 == main_~s__state~0); 15178#L45 assume !(8544 == main_~s__state~0); 15176#L49 assume !(8560 == main_~s__state~0); 15056#L53 assume 8576 == main_~s__state~0; 14997#L54 [2019-01-01 22:10:57,003 INFO L796 eck$LassoCheckResult]: Loop: 14997#L54 main_~tmp___1~0 := main_#t~nondet4;havoc main_#t~nondet4; 14998#L136 assume 2 == main_~tmp___1~0;main_~s__state~0 := 8466; 15018#L177 assume !false; 15246#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15135#L30 assume 8466 == main_~s__state~0; 15028#L31 assume !(0 == main_~blastFlag~0); 15029#L79-1 main_~s__state~0 := 8496; 15054#L177 assume !false; 15238#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15236#L30 assume !(8466 == main_~s__state~0); 15223#L33 assume 8496 == main_~s__state~0; 15003#L34 assume !(1 == main_~blastFlag~0); 15004#L86-1 assume !(0 != main_~s__hit~0);main_~s__state~0 := 8512; 15171#L177 assume !false; 15168#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15164#L30 assume !(8466 == main_~s__state~0); 15160#L33 assume !(8496 == main_~s__state~0); 15156#L37 assume 8512 == main_~s__state~0; 14973#L38 main_~s__state~0 := 8528; 14974#L177 assume !false; 15245#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15244#L30 assume !(8466 == main_~s__state~0); 15240#L33 assume !(8496 == main_~s__state~0); 15239#L37 assume !(8512 == main_~s__state~0); 15025#L41 assume 8528 == main_~s__state~0; 15026#L42 main_~s__state~0 := 8544; 15121#L177 assume !false; 15118#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15114#L30 assume !(8466 == main_~s__state~0); 15110#L33 assume !(8496 == main_~s__state~0); 15106#L37 assume !(8512 == main_~s__state~0); 15096#L41 assume !(8528 == main_~s__state~0); 15093#L45 assume 8544 == main_~s__state~0; 15052#L46 assume 0 != 1 + main_~s__verify_mode~0; 15036#L106 assume !(0 != main_~s__session__peer~0); 14985#L113 assume !(0 != (256 + main_~s__s3__tmp__new_cipher__algorithms~0) % 4294967296); 14987#L121 main_~s__state~0 := 8576; 15015#L177 assume !false; 15079#L24 assume !(main_~s__state~0 <= 8512 && main_~blastFlag~0 > 2); 15077#L30 assume !(8466 == main_~s__state~0); 15075#L33 assume !(8496 == main_~s__state~0); 15073#L37 assume !(8512 == main_~s__state~0); 15071#L41 assume !(8528 == main_~s__state~0); 15070#L45 assume !(8544 == main_~s__state~0); 15067#L49 assume !(8560 == main_~s__state~0); 15055#L53 assume 8576 == main_~s__state~0; 14997#L54 [2019-01-01 22:10:57,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:57,003 INFO L82 PathProgramCache]: Analyzing trace with hash -904822850, now seen corresponding path program 1 times [2019-01-01 22:10:57,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:57,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:57,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:57,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:57,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:57,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:57,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1328677862, now seen corresponding path program 1 times [2019-01-01 22:10:57,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:57,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:57,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:57,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:57,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:57,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:10:57,089 INFO L82 PathProgramCache]: Analyzing trace with hash 2007728355, now seen corresponding path program 1 times [2019-01-01 22:10:57,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:10:57,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:10:57,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:57,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:10:57,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:10:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:10:58,132 WARN L181 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 98 DAG size of output: 47 [2019-01-01 22:10:58,565 WARN L181 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 50 [2019-01-01 22:10:58,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:10:58 BoogieIcfgContainer [2019-01-01 22:10:58,628 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:10:58,628 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:10:58,629 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:10:58,629 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:10:58,629 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:10:44" (3/4) ... [2019-01-01 22:10:58,637 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 22:10:58,752 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 22:10:58,752 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:10:58,753 INFO L168 Benchmark]: Toolchain (without parser) took 15524.55 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.0 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 154.6 MB. Max. memory is 11.5 GB. [2019-01-01 22:10:58,754 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:10:58,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.18 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:10:58,754 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.11 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-01 22:10:58,759 INFO L168 Benchmark]: Boogie Preprocessor took 95.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-01-01 22:10:58,759 INFO L168 Benchmark]: RCFGBuilder took 620.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2019-01-01 22:10:58,760 INFO L168 Benchmark]: BuchiAutomizer took 14261.02 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -28.1 MB). Peak memory consumption was 156.4 MB. Max. memory is 11.5 GB. [2019-01-01 22:10:58,760 INFO L168 Benchmark]: Witness Printer took 123.43 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2019-01-01 22:10:58,768 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 377.18 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.11 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 95.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 620.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14261.02 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -28.1 MB). Peak memory consumption was 156.4 MB. Max. memory is 11.5 GB. * Witness Printer took 123.43 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 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 14.1s and 17 iterations. TraceHistogramMax:6. Analysis of lassos took 6.4s. Construction of modules took 4.9s. Büchi inclusion checks took 2.0s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 23. Automata minimization 0.2s 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, 4.9s 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: 4ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 53]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {\result=0, tmp___1=2, cb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1beeb1bf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3eb2c17c=2, s__session__peer=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@64a82a34=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6595b03=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7ddb48e7=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: 53]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L10] int s__state ; [L11] int s__hit = __VERIFIER_nondet_int() ; [L12] int s__verify_mode = __VERIFIER_nondet_int() ; [L13] int s__session__peer = __VERIFIER_nondet_int() ; [L14] unsigned long s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_long() ; [L15] int buf ; [L16] int cb ; [L17] int blastFlag ; [L18] int tmp___1; [L20] s__state = 8466 [L21] blastFlag = 0 [L23] COND TRUE 1 [L24] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L30] COND TRUE s__state == 8466 [L79] COND TRUE blastFlag == 0 [L80] blastFlag = 1 [L82] s__state = 8496 [L23] COND TRUE 1 [L24] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L30] COND FALSE !(s__state == 8466) [L33] COND TRUE s__state == 8496 [L86] COND TRUE blastFlag == 1 [L87] blastFlag = 2 [L89] COND FALSE !(\read(s__hit)) [L92] s__state = 8512 [L23] COND TRUE 1 [L24] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L30] COND FALSE !(s__state == 8466) [L33] COND FALSE !(s__state == 8496) [L37] COND TRUE s__state == 8512 [L97] s__state = 8528 [L23] COND TRUE 1 [L24] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L30] COND FALSE !(s__state == 8466) [L33] COND FALSE !(s__state == 8496) [L37] COND FALSE !(s__state == 8512) [L41] COND TRUE s__state == 8528 [L101] s__state = 8544 [L23] COND TRUE 1 [L24] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L30] COND FALSE !(s__state == 8466) [L33] COND FALSE !(s__state == 8496) [L37] COND FALSE !(s__state == 8512) [L41] COND FALSE !(s__state == 8528) [L45] COND TRUE s__state == 8544 [L105] COND TRUE s__verify_mode + 1 [L106] COND FALSE !(s__session__peer != 0) [L114] COND FALSE !(s__s3__tmp__new_cipher__algorithms + 256UL) [L122] s__state = 8576 [L23] COND TRUE 1 [L24] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L30] COND FALSE !(s__state == 8466) [L33] COND FALSE !(s__state == 8496) [L37] COND FALSE !(s__state == 8512) [L41] COND FALSE !(s__state == 8528) [L45] COND FALSE !(s__state == 8544) [L49] COND FALSE !(s__state == 8560) [L53] COND TRUE s__state == 8576 Loop: [L135] tmp___1 = __VERIFIER_nondet_int() [L136] COND TRUE tmp___1 == 2 [L137] s__state = 8466 [L23] COND TRUE 1 [L24] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L30] COND TRUE s__state == 8466 [L79] COND FALSE !(blastFlag == 0) [L82] s__state = 8496 [L23] COND TRUE 1 [L24] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L30] COND FALSE !(s__state == 8466) [L33] COND TRUE s__state == 8496 [L86] COND FALSE !(blastFlag == 1) [L89] COND FALSE !(\read(s__hit)) [L92] s__state = 8512 [L23] COND TRUE 1 [L24] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L30] COND FALSE !(s__state == 8466) [L33] COND FALSE !(s__state == 8496) [L37] COND TRUE s__state == 8512 [L97] s__state = 8528 [L23] COND TRUE 1 [L24] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L30] COND FALSE !(s__state == 8466) [L33] COND FALSE !(s__state == 8496) [L37] COND FALSE !(s__state == 8512) [L41] COND TRUE s__state == 8528 [L101] s__state = 8544 [L23] COND TRUE 1 [L24] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L30] COND FALSE !(s__state == 8466) [L33] COND FALSE !(s__state == 8496) [L37] COND FALSE !(s__state == 8512) [L41] COND FALSE !(s__state == 8528) [L45] COND TRUE s__state == 8544 [L105] COND TRUE s__verify_mode + 1 [L106] COND FALSE !(s__session__peer != 0) [L114] COND FALSE !(s__s3__tmp__new_cipher__algorithms + 256UL) [L122] s__state = 8576 [L23] COND TRUE 1 [L24] COND FALSE !(s__state <= 8512 && blastFlag > 2) [L30] COND FALSE !(s__state == 8466) [L33] COND FALSE !(s__state == 8496) [L37] COND FALSE !(s__state == 8512) [L41] COND FALSE !(s__state == 8528) [L45] COND FALSE !(s__state == 8544) [L49] COND FALSE !(s__state == 8560) [L53] COND TRUE s__state == 8576 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...