java -ea -Xmx8000000000 -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 ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:51:59,000 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:51:59,002 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:51:59,015 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:51:59,016 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:51:59,017 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:51:59,018 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:51:59,020 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:51:59,022 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:51:59,022 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:51:59,023 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:51:59,024 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:51:59,024 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:51:59,025 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:51:59,026 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:51:59,027 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:51:59,028 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:51:59,032 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:51:59,037 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:51:59,038 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:51:59,043 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:51:59,044 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:51:59,047 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:51:59,047 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:51:59,047 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:51:59,050 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:51:59,051 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:51:59,052 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:51:59,053 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:51:59,054 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:51:59,054 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:51:59,055 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:51:59,055 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:51:59,055 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:51:59,056 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:51:59,057 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:51:59,057 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 10:51:59,071 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:51:59,072 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:51:59,075 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:51:59,075 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:51:59,076 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:51:59,076 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:51:59,076 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:51:59,076 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:51:59,077 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:51:59,077 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:51:59,077 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:51:59,077 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:51:59,077 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:51:59,078 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:51:59,079 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:51:59,079 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:51:59,079 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:51:59,079 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:51:59,080 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:51:59,080 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:51:59,080 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:51:59,080 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:51:59,080 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:51:59,081 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:51:59,082 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:51:59,082 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:51:59,082 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:51:59,083 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:51:59,083 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:51:59,083 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:51:59,083 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:51:59,083 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:51:59,085 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:51:59,134 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:51:59,145 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:51:59,149 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:51:59,151 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:51:59,151 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:51:59,153 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.cil.c [2018-11-23 10:51:59,233 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3103fba00/396e4e25fcea4f3c9c0ac97778862460/FLAGa0d7bf2d9 [2018-11-23 10:51:59,754 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:51:59,755 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.cil.c [2018-11-23 10:51:59,768 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3103fba00/396e4e25fcea4f3c9c0ac97778862460/FLAGa0d7bf2d9 [2018-11-23 10:52:00,059 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3103fba00/396e4e25fcea4f3c9c0ac97778862460 [2018-11-23 10:52:00,070 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:52:00,071 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:52:00,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:52:00,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:52:00,078 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:52:00,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:52:00" (1/1) ... [2018-11-23 10:52:00,083 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54e05182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:52:00, skipping insertion in model container [2018-11-23 10:52:00,083 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:52:00" (1/1) ... [2018-11-23 10:52:00,092 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:52:00,128 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:52:00,334 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:52:00,338 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:52:00,378 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:52:00,394 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:52:00,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:52:00 WrapperNode [2018-11-23 10:52:00,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:52:00,395 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:52:00,395 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:52:00,396 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:52:00,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:52:00" (1/1) ... [2018-11-23 10:52:00,411 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:52:00" (1/1) ... [2018-11-23 10:52:00,417 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:52:00,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:52:00,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:52:00,418 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:52:00,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:52:00" (1/1) ... [2018-11-23 10:52:00,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:52:00" (1/1) ... [2018-11-23 10:52:00,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:52:00" (1/1) ... [2018-11-23 10:52:00,428 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:52:00" (1/1) ... [2018-11-23 10:52:00,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:52:00" (1/1) ... [2018-11-23 10:52:00,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:52:00" (1/1) ... [2018-11-23 10:52:00,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:52:00" (1/1) ... [2018-11-23 10:52:00,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:52:00,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:52:00,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:52:00,462 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:52:00,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:52:00" (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:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:52:00,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:52:00,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:52:00,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:52:00,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:52:00,592 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:52:00,593 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:52:01,416 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:52:01,416 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 10:52:01,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:52:01 BoogieIcfgContainer [2018-11-23 10:52:01,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:52:01,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:52:01,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:52:01,422 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:52:01,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:52:00" (1/3) ... [2018-11-23 10:52:01,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e8a6554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:52:01, skipping insertion in model container [2018-11-23 10:52:01,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:52:00" (2/3) ... [2018-11-23 10:52:01,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e8a6554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:52:01, skipping insertion in model container [2018-11-23 10:52:01,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:52:01" (3/3) ... [2018-11-23 10:52:01,426 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a_true-unreach-call_false-termination.cil.c [2018-11-23 10:52:01,437 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:52:01,445 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:52:01,460 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:52:01,489 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:52:01,490 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:52:01,490 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:52:01,490 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:52:01,490 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:52:01,490 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:52:01,490 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:52:01,491 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:52:01,491 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:52:01,510 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-11-23 10:52:01,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 10:52:01,517 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:52:01,518 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:52:01,521 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:52:01,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:52:01,527 INFO L82 PathProgramCache]: Analyzing trace with hash 2008919768, now seen corresponding path program 1 times [2018-11-23 10:52:01,532 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:52:01,533 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:52:01,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:52:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:52:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:52:01,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:52:01,707 INFO L256 TraceCheckUtils]: 0: Hoare triple {53#true} call ULTIMATE.init(); {53#true} is VALID [2018-11-23 10:52:01,710 INFO L273 TraceCheckUtils]: 1: Hoare triple {53#true} assume true; {53#true} is VALID [2018-11-23 10:52:01,711 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {53#true} {53#true} #197#return; {53#true} is VALID [2018-11-23 10:52:01,711 INFO L256 TraceCheckUtils]: 3: Hoare triple {53#true} call #t~ret5 := main(); {53#true} is VALID [2018-11-23 10:52:01,713 INFO L273 TraceCheckUtils]: 4: Hoare triple {53#true} havoc ~s__state~0;~s__hit~0 := #t~nondet0;havoc #t~nondet0;~s__verify_mode~0 := #t~nondet1;havoc #t~nondet1;~s__session__peer~0 := #t~nondet2;havoc #t~nondet2;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet3;havoc #t~nondet3;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466bv32;~blastFlag~0 := 0bv32; {70#(= (_ bv0 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:01,715 INFO L273 TraceCheckUtils]: 5: Hoare triple {70#(= (_ bv0 32) main_~blastFlag~0)} assume !false; {70#(= (_ bv0 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:01,716 INFO L273 TraceCheckUtils]: 6: Hoare triple {70#(= (_ bv0 32) main_~blastFlag~0)} assume ~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32); {54#false} is VALID [2018-11-23 10:52:01,717 INFO L273 TraceCheckUtils]: 7: Hoare triple {54#false} assume !false; {54#false} is VALID [2018-11-23 10:52:01,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:52:01,719 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:52:01,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:52:01,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:52:01,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-23 10:52:01,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:52:01,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:52:01,781 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:52:01,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:52:01,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:52:01,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:52:01,795 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2018-11-23 10:52:02,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:02,815 INFO L93 Difference]: Finished difference Result 135 states and 223 transitions. [2018-11-23 10:52:02,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:52:02,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-23 10:52:02,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:52:02,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:52:02,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2018-11-23 10:52:02,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:52:02,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2018-11-23 10:52:02,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 223 transitions. [2018-11-23 10:52:03,452 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:52:03,469 INFO L225 Difference]: With dead ends: 135 [2018-11-23 10:52:03,470 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 10:52:03,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:52:03,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 10:52:03,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-23 10:52:03,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:52:03,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 82 states. [2018-11-23 10:52:03,587 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2018-11-23 10:52:03,588 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2018-11-23 10:52:03,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:03,597 INFO L93 Difference]: Finished difference Result 82 states and 124 transitions. [2018-11-23 10:52:03,597 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 124 transitions. [2018-11-23 10:52:03,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:52:03,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:52:03,599 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2018-11-23 10:52:03,599 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2018-11-23 10:52:03,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:03,608 INFO L93 Difference]: Finished difference Result 82 states and 124 transitions. [2018-11-23 10:52:03,608 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 124 transitions. [2018-11-23 10:52:03,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:52:03,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:52:03,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:52:03,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:52:03,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 10:52:03,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 124 transitions. [2018-11-23 10:52:03,618 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 124 transitions. Word has length 8 [2018-11-23 10:52:03,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:52:03,619 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 124 transitions. [2018-11-23 10:52:03,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:52:03,620 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 124 transitions. [2018-11-23 10:52:03,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 10:52:03,620 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:52:03,621 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:52:03,621 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:52:03,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:52:03,624 INFO L82 PathProgramCache]: Analyzing trace with hash 2066454160, now seen corresponding path program 1 times [2018-11-23 10:52:03,624 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:52:03,624 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:52:03,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:52:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:52:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:52:03,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:52:03,727 INFO L256 TraceCheckUtils]: 0: Hoare triple {549#true} call ULTIMATE.init(); {549#true} is VALID [2018-11-23 10:52:03,727 INFO L273 TraceCheckUtils]: 1: Hoare triple {549#true} assume true; {549#true} is VALID [2018-11-23 10:52:03,728 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {549#true} {549#true} #197#return; {549#true} is VALID [2018-11-23 10:52:03,728 INFO L256 TraceCheckUtils]: 3: Hoare triple {549#true} call #t~ret5 := main(); {549#true} is VALID [2018-11-23 10:52:03,729 INFO L273 TraceCheckUtils]: 4: Hoare triple {549#true} havoc ~s__state~0;~s__hit~0 := #t~nondet0;havoc #t~nondet0;~s__verify_mode~0 := #t~nondet1;havoc #t~nondet1;~s__session__peer~0 := #t~nondet2;havoc #t~nondet2;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet3;havoc #t~nondet3;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466bv32;~blastFlag~0 := 0bv32; {549#true} is VALID [2018-11-23 10:52:03,729 INFO L273 TraceCheckUtils]: 5: Hoare triple {549#true} assume !false; {549#true} is VALID [2018-11-23 10:52:03,729 INFO L273 TraceCheckUtils]: 6: Hoare triple {549#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {549#true} is VALID [2018-11-23 10:52:03,730 INFO L273 TraceCheckUtils]: 7: Hoare triple {549#true} assume 8466bv32 == ~s__state~0; {549#true} is VALID [2018-11-23 10:52:03,739 INFO L273 TraceCheckUtils]: 8: Hoare triple {549#true} assume 0bv32 == ~blastFlag~0;~blastFlag~0 := 1bv32; {578#(= (_ bv1 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:03,748 INFO L273 TraceCheckUtils]: 9: Hoare triple {578#(= (_ bv1 32) main_~blastFlag~0)} ~s__state~0 := 8496bv32; {578#(= (_ bv1 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:03,749 INFO L273 TraceCheckUtils]: 10: Hoare triple {578#(= (_ bv1 32) main_~blastFlag~0)} assume !false; {578#(= (_ bv1 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:03,761 INFO L273 TraceCheckUtils]: 11: Hoare triple {578#(= (_ bv1 32) main_~blastFlag~0)} assume ~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32); {550#false} is VALID [2018-11-23 10:52:03,761 INFO L273 TraceCheckUtils]: 12: Hoare triple {550#false} assume !false; {550#false} is VALID [2018-11-23 10:52:03,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:52:03,763 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:52:03,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:52:03,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:52:03,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 10:52:03,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:52:03,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:52:03,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:52:03,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:52:03,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:52:03,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:52:03,852 INFO L87 Difference]: Start difference. First operand 82 states and 124 transitions. Second operand 3 states. [2018-11-23 10:52:04,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:04,445 INFO L93 Difference]: Finished difference Result 159 states and 249 transitions. [2018-11-23 10:52:04,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:52:04,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 10:52:04,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:52:04,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:52:04,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2018-11-23 10:52:04,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:52:04,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2018-11-23 10:52:04,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 194 transitions. [2018-11-23 10:52:04,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:52:04,754 INFO L225 Difference]: With dead ends: 159 [2018-11-23 10:52:04,755 INFO L226 Difference]: Without dead ends: 119 [2018-11-23 10:52:04,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:52:04,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-23 10:52:04,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-11-23 10:52:04,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:52:04,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 119 states. [2018-11-23 10:52:04,844 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 119 states. [2018-11-23 10:52:04,844 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 119 states. [2018-11-23 10:52:04,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:04,851 INFO L93 Difference]: Finished difference Result 119 states and 178 transitions. [2018-11-23 10:52:04,851 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 178 transitions. [2018-11-23 10:52:04,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:52:04,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:52:04,853 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 119 states. [2018-11-23 10:52:04,854 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 119 states. [2018-11-23 10:52:04,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:04,861 INFO L93 Difference]: Finished difference Result 119 states and 178 transitions. [2018-11-23 10:52:04,861 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 178 transitions. [2018-11-23 10:52:04,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:52:04,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:52:04,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:52:04,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:52:04,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-23 10:52:04,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 178 transitions. [2018-11-23 10:52:04,870 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 178 transitions. Word has length 13 [2018-11-23 10:52:04,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:52:04,871 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 178 transitions. [2018-11-23 10:52:04,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:52:04,871 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 178 transitions. [2018-11-23 10:52:04,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 10:52:04,872 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:52:04,872 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:52:04,873 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:52:04,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:52:04,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1216248382, now seen corresponding path program 1 times [2018-11-23 10:52:04,874 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:52:04,874 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:52:04,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:52:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:52:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:52:04,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:52:05,008 INFO L256 TraceCheckUtils]: 0: Hoare triple {1222#true} call ULTIMATE.init(); {1222#true} is VALID [2018-11-23 10:52:05,008 INFO L273 TraceCheckUtils]: 1: Hoare triple {1222#true} assume true; {1222#true} is VALID [2018-11-23 10:52:05,008 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1222#true} {1222#true} #197#return; {1222#true} is VALID [2018-11-23 10:52:05,009 INFO L256 TraceCheckUtils]: 3: Hoare triple {1222#true} call #t~ret5 := main(); {1222#true} is VALID [2018-11-23 10:52:05,009 INFO L273 TraceCheckUtils]: 4: Hoare triple {1222#true} havoc ~s__state~0;~s__hit~0 := #t~nondet0;havoc #t~nondet0;~s__verify_mode~0 := #t~nondet1;havoc #t~nondet1;~s__session__peer~0 := #t~nondet2;havoc #t~nondet2;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet3;havoc #t~nondet3;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466bv32;~blastFlag~0 := 0bv32; {1222#true} is VALID [2018-11-23 10:52:05,009 INFO L273 TraceCheckUtils]: 5: Hoare triple {1222#true} assume !false; {1222#true} is VALID [2018-11-23 10:52:05,009 INFO L273 TraceCheckUtils]: 6: Hoare triple {1222#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {1222#true} is VALID [2018-11-23 10:52:05,010 INFO L273 TraceCheckUtils]: 7: Hoare triple {1222#true} assume 8466bv32 == ~s__state~0; {1222#true} is VALID [2018-11-23 10:52:05,010 INFO L273 TraceCheckUtils]: 8: Hoare triple {1222#true} assume 0bv32 == ~blastFlag~0;~blastFlag~0 := 1bv32; {1222#true} is VALID [2018-11-23 10:52:05,010 INFO L273 TraceCheckUtils]: 9: Hoare triple {1222#true} ~s__state~0 := 8496bv32; {1222#true} is VALID [2018-11-23 10:52:05,011 INFO L273 TraceCheckUtils]: 10: Hoare triple {1222#true} assume !false; {1222#true} is VALID [2018-11-23 10:52:05,011 INFO L273 TraceCheckUtils]: 11: Hoare triple {1222#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {1222#true} is VALID [2018-11-23 10:52:05,011 INFO L273 TraceCheckUtils]: 12: Hoare triple {1222#true} assume !(8466bv32 == ~s__state~0); {1222#true} is VALID [2018-11-23 10:52:05,012 INFO L273 TraceCheckUtils]: 13: Hoare triple {1222#true} assume 8496bv32 == ~s__state~0; {1222#true} is VALID [2018-11-23 10:52:05,012 INFO L273 TraceCheckUtils]: 14: Hoare triple {1222#true} assume 1bv32 == ~blastFlag~0;~blastFlag~0 := 2bv32; {1269#(= (_ bv2 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:05,013 INFO L273 TraceCheckUtils]: 15: Hoare triple {1269#(= (_ bv2 32) main_~blastFlag~0)} assume 0bv32 != ~s__hit~0;~s__state~0 := 8656bv32; {1269#(= (_ bv2 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:05,013 INFO L273 TraceCheckUtils]: 16: Hoare triple {1269#(= (_ bv2 32) main_~blastFlag~0)} assume !false; {1269#(= (_ bv2 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:05,014 INFO L273 TraceCheckUtils]: 17: Hoare triple {1269#(= (_ bv2 32) main_~blastFlag~0)} assume ~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32); {1223#false} is VALID [2018-11-23 10:52:05,014 INFO L273 TraceCheckUtils]: 18: Hoare triple {1223#false} assume !false; {1223#false} is VALID [2018-11-23 10:52:05,017 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 10:52:05,017 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:52:05,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:52:05,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:52:05,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:52:05,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:52:05,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:52:05,047 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:52:05,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:52:05,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:52:05,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:52:05,048 INFO L87 Difference]: Start difference. First operand 119 states and 178 transitions. Second operand 3 states. [2018-11-23 10:52:05,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:05,532 INFO L93 Difference]: Finished difference Result 233 states and 358 transitions. [2018-11-23 10:52:05,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:52:05,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:52:05,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:52:05,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:52:05,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 195 transitions. [2018-11-23 10:52:05,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:52:05,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 195 transitions. [2018-11-23 10:52:05,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 195 transitions. [2018-11-23 10:52:05,819 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:52:05,825 INFO L225 Difference]: With dead ends: 233 [2018-11-23 10:52:05,825 INFO L226 Difference]: Without dead ends: 156 [2018-11-23 10:52:05,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:52:05,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-23 10:52:05,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-11-23 10:52:05,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:52:05,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand 156 states. [2018-11-23 10:52:05,957 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 156 states. [2018-11-23 10:52:05,957 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 156 states. [2018-11-23 10:52:05,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:05,965 INFO L93 Difference]: Finished difference Result 156 states and 233 transitions. [2018-11-23 10:52:05,965 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 233 transitions. [2018-11-23 10:52:05,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:52:05,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:52:05,967 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 156 states. [2018-11-23 10:52:05,967 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 156 states. [2018-11-23 10:52:05,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:05,975 INFO L93 Difference]: Finished difference Result 156 states and 233 transitions. [2018-11-23 10:52:05,975 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 233 transitions. [2018-11-23 10:52:05,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:52:05,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:52:05,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:52:05,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:52:05,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-23 10:52:05,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 233 transitions. [2018-11-23 10:52:05,984 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 233 transitions. Word has length 19 [2018-11-23 10:52:05,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:52:05,984 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 233 transitions. [2018-11-23 10:52:05,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:52:05,984 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 233 transitions. [2018-11-23 10:52:05,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 10:52:05,986 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:52:05,986 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:52:05,986 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:52:05,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:52:05,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1623728883, now seen corresponding path program 1 times [2018-11-23 10:52:05,987 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:52:05,988 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:52:06,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:52:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:52:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:52:06,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:52:06,123 INFO L256 TraceCheckUtils]: 0: Hoare triple {2143#true} call ULTIMATE.init(); {2143#true} is VALID [2018-11-23 10:52:06,123 INFO L273 TraceCheckUtils]: 1: Hoare triple {2143#true} assume true; {2143#true} is VALID [2018-11-23 10:52:06,124 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2143#true} {2143#true} #197#return; {2143#true} is VALID [2018-11-23 10:52:06,124 INFO L256 TraceCheckUtils]: 3: Hoare triple {2143#true} call #t~ret5 := main(); {2143#true} is VALID [2018-11-23 10:52:06,124 INFO L273 TraceCheckUtils]: 4: Hoare triple {2143#true} havoc ~s__state~0;~s__hit~0 := #t~nondet0;havoc #t~nondet0;~s__verify_mode~0 := #t~nondet1;havoc #t~nondet1;~s__session__peer~0 := #t~nondet2;havoc #t~nondet2;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet3;havoc #t~nondet3;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466bv32;~blastFlag~0 := 0bv32; {2143#true} is VALID [2018-11-23 10:52:06,125 INFO L273 TraceCheckUtils]: 5: Hoare triple {2143#true} assume !false; {2143#true} is VALID [2018-11-23 10:52:06,125 INFO L273 TraceCheckUtils]: 6: Hoare triple {2143#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {2143#true} is VALID [2018-11-23 10:52:06,125 INFO L273 TraceCheckUtils]: 7: Hoare triple {2143#true} assume 8466bv32 == ~s__state~0; {2143#true} is VALID [2018-11-23 10:52:06,125 INFO L273 TraceCheckUtils]: 8: Hoare triple {2143#true} assume 0bv32 == ~blastFlag~0;~blastFlag~0 := 1bv32; {2143#true} is VALID [2018-11-23 10:52:06,126 INFO L273 TraceCheckUtils]: 9: Hoare triple {2143#true} ~s__state~0 := 8496bv32; {2143#true} is VALID [2018-11-23 10:52:06,126 INFO L273 TraceCheckUtils]: 10: Hoare triple {2143#true} assume !false; {2143#true} is VALID [2018-11-23 10:52:06,126 INFO L273 TraceCheckUtils]: 11: Hoare triple {2143#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {2143#true} is VALID [2018-11-23 10:52:06,127 INFO L273 TraceCheckUtils]: 12: Hoare triple {2143#true} assume !(8466bv32 == ~s__state~0); {2143#true} is VALID [2018-11-23 10:52:06,127 INFO L273 TraceCheckUtils]: 13: Hoare triple {2143#true} assume 8496bv32 == ~s__state~0; {2143#true} is VALID [2018-11-23 10:52:06,127 INFO L273 TraceCheckUtils]: 14: Hoare triple {2143#true} assume 1bv32 == ~blastFlag~0;~blastFlag~0 := 2bv32; {2143#true} is VALID [2018-11-23 10:52:06,127 INFO L273 TraceCheckUtils]: 15: Hoare triple {2143#true} assume 0bv32 != ~s__hit~0;~s__state~0 := 8656bv32; {2143#true} is VALID [2018-11-23 10:52:06,128 INFO L273 TraceCheckUtils]: 16: Hoare triple {2143#true} assume !false; {2143#true} is VALID [2018-11-23 10:52:06,128 INFO L273 TraceCheckUtils]: 17: Hoare triple {2143#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {2143#true} is VALID [2018-11-23 10:52:06,128 INFO L273 TraceCheckUtils]: 18: Hoare triple {2143#true} assume !(8466bv32 == ~s__state~0); {2143#true} is VALID [2018-11-23 10:52:06,129 INFO L273 TraceCheckUtils]: 19: Hoare triple {2143#true} assume !(8496bv32 == ~s__state~0); {2143#true} is VALID [2018-11-23 10:52:06,129 INFO L273 TraceCheckUtils]: 20: Hoare triple {2143#true} assume !(8512bv32 == ~s__state~0); {2143#true} is VALID [2018-11-23 10:52:06,129 INFO L273 TraceCheckUtils]: 21: Hoare triple {2143#true} assume !(8528bv32 == ~s__state~0); {2143#true} is VALID [2018-11-23 10:52:06,130 INFO L273 TraceCheckUtils]: 22: Hoare triple {2143#true} assume !(8544bv32 == ~s__state~0); {2143#true} is VALID [2018-11-23 10:52:06,130 INFO L273 TraceCheckUtils]: 23: Hoare triple {2143#true} assume !(8560bv32 == ~s__state~0); {2143#true} is VALID [2018-11-23 10:52:06,130 INFO L273 TraceCheckUtils]: 24: Hoare triple {2143#true} assume !(8576bv32 == ~s__state~0); {2143#true} is VALID [2018-11-23 10:52:06,131 INFO L273 TraceCheckUtils]: 25: Hoare triple {2143#true} assume !(8592bv32 == ~s__state~0); {2143#true} is VALID [2018-11-23 10:52:06,131 INFO L273 TraceCheckUtils]: 26: Hoare triple {2143#true} assume !(8608bv32 == ~s__state~0); {2143#true} is VALID [2018-11-23 10:52:06,131 INFO L273 TraceCheckUtils]: 27: Hoare triple {2143#true} assume !(8640bv32 == ~s__state~0); {2143#true} is VALID [2018-11-23 10:52:06,132 INFO L273 TraceCheckUtils]: 28: Hoare triple {2143#true} assume 8656bv32 == ~s__state~0; {2143#true} is VALID [2018-11-23 10:52:06,132 INFO L273 TraceCheckUtils]: 29: Hoare triple {2143#true} assume 2bv32 == ~blastFlag~0;~blastFlag~0 := 3bv32; {2143#true} is VALID [2018-11-23 10:52:06,143 INFO L273 TraceCheckUtils]: 30: Hoare triple {2143#true} ~s__state~0 := 8672bv32; {2238#(= (_ bv8672 32) main_~s__state~0)} is VALID [2018-11-23 10:52:06,145 INFO L273 TraceCheckUtils]: 31: Hoare triple {2238#(= (_ bv8672 32) main_~s__state~0)} assume !false; {2238#(= (_ bv8672 32) main_~s__state~0)} is VALID [2018-11-23 10:52:06,146 INFO L273 TraceCheckUtils]: 32: Hoare triple {2238#(= (_ bv8672 32) main_~s__state~0)} assume ~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32); {2144#false} is VALID [2018-11-23 10:52:06,147 INFO L273 TraceCheckUtils]: 33: Hoare triple {2144#false} assume !false; {2144#false} is VALID [2018-11-23 10:52:06,149 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 10:52:06,149 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:52:06,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:52:06,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:52:06,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-23 10:52:06,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:52:06,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:52:06,183 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:52:06,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:52:06,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:52:06,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:52:06,184 INFO L87 Difference]: Start difference. First operand 156 states and 233 transitions. Second operand 3 states. [2018-11-23 10:52:06,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:06,542 INFO L93 Difference]: Finished difference Result 351 states and 538 transitions. [2018-11-23 10:52:06,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:52:06,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-23 10:52:06,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:52:06,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:52:06,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2018-11-23 10:52:06,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:52:06,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2018-11-23 10:52:06,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 160 transitions. [2018-11-23 10:52:06,826 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:52:06,831 INFO L225 Difference]: With dead ends: 351 [2018-11-23 10:52:06,832 INFO L226 Difference]: Without dead ends: 200 [2018-11-23 10:52:06,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:52:06,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-23 10:52:06,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 195. [2018-11-23 10:52:06,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:52:06,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand 195 states. [2018-11-23 10:52:06,954 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 195 states. [2018-11-23 10:52:06,954 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 195 states. [2018-11-23 10:52:06,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:06,963 INFO L93 Difference]: Finished difference Result 200 states and 276 transitions. [2018-11-23 10:52:06,963 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 276 transitions. [2018-11-23 10:52:06,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:52:06,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:52:06,964 INFO L74 IsIncluded]: Start isIncluded. First operand 195 states. Second operand 200 states. [2018-11-23 10:52:06,964 INFO L87 Difference]: Start difference. First operand 195 states. Second operand 200 states. [2018-11-23 10:52:06,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:06,972 INFO L93 Difference]: Finished difference Result 200 states and 276 transitions. [2018-11-23 10:52:06,972 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 276 transitions. [2018-11-23 10:52:06,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:52:06,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:52:06,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:52:06,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:52:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-23 10:52:06,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 272 transitions. [2018-11-23 10:52:06,980 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 272 transitions. Word has length 34 [2018-11-23 10:52:06,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:52:06,981 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 272 transitions. [2018-11-23 10:52:06,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:52:06,981 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 272 transitions. [2018-11-23 10:52:06,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 10:52:06,982 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:52:06,983 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:52:06,983 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:52:06,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:52:06,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1694730092, now seen corresponding path program 1 times [2018-11-23 10:52:06,984 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:52:06,984 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:52:07,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:52:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:52:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:52:07,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:52:07,140 INFO L256 TraceCheckUtils]: 0: Hoare triple {3391#true} call ULTIMATE.init(); {3391#true} is VALID [2018-11-23 10:52:07,141 INFO L273 TraceCheckUtils]: 1: Hoare triple {3391#true} assume true; {3391#true} is VALID [2018-11-23 10:52:07,141 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3391#true} {3391#true} #197#return; {3391#true} is VALID [2018-11-23 10:52:07,142 INFO L256 TraceCheckUtils]: 3: Hoare triple {3391#true} call #t~ret5 := main(); {3391#true} is VALID [2018-11-23 10:52:07,142 INFO L273 TraceCheckUtils]: 4: Hoare triple {3391#true} havoc ~s__state~0;~s__hit~0 := #t~nondet0;havoc #t~nondet0;~s__verify_mode~0 := #t~nondet1;havoc #t~nondet1;~s__session__peer~0 := #t~nondet2;havoc #t~nondet2;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet3;havoc #t~nondet3;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466bv32;~blastFlag~0 := 0bv32; {3391#true} is VALID [2018-11-23 10:52:07,142 INFO L273 TraceCheckUtils]: 5: Hoare triple {3391#true} assume !false; {3391#true} is VALID [2018-11-23 10:52:07,143 INFO L273 TraceCheckUtils]: 6: Hoare triple {3391#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {3391#true} is VALID [2018-11-23 10:52:07,143 INFO L273 TraceCheckUtils]: 7: Hoare triple {3391#true} assume 8466bv32 == ~s__state~0; {3391#true} is VALID [2018-11-23 10:52:07,143 INFO L273 TraceCheckUtils]: 8: Hoare triple {3391#true} assume 0bv32 == ~blastFlag~0;~blastFlag~0 := 1bv32; {3391#true} is VALID [2018-11-23 10:52:07,144 INFO L273 TraceCheckUtils]: 9: Hoare triple {3391#true} ~s__state~0 := 8496bv32; {3391#true} is VALID [2018-11-23 10:52:07,144 INFO L273 TraceCheckUtils]: 10: Hoare triple {3391#true} assume !false; {3391#true} is VALID [2018-11-23 10:52:07,144 INFO L273 TraceCheckUtils]: 11: Hoare triple {3391#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {3391#true} is VALID [2018-11-23 10:52:07,144 INFO L273 TraceCheckUtils]: 12: Hoare triple {3391#true} assume !(8466bv32 == ~s__state~0); {3391#true} is VALID [2018-11-23 10:52:07,145 INFO L273 TraceCheckUtils]: 13: Hoare triple {3391#true} assume 8496bv32 == ~s__state~0; {3391#true} is VALID [2018-11-23 10:52:07,145 INFO L273 TraceCheckUtils]: 14: Hoare triple {3391#true} assume 1bv32 == ~blastFlag~0;~blastFlag~0 := 2bv32; {3391#true} is VALID [2018-11-23 10:52:07,145 INFO L273 TraceCheckUtils]: 15: Hoare triple {3391#true} assume 0bv32 != ~s__hit~0;~s__state~0 := 8656bv32; {3391#true} is VALID [2018-11-23 10:52:07,145 INFO L273 TraceCheckUtils]: 16: Hoare triple {3391#true} assume !false; {3391#true} is VALID [2018-11-23 10:52:07,146 INFO L273 TraceCheckUtils]: 17: Hoare triple {3391#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {3391#true} is VALID [2018-11-23 10:52:07,146 INFO L273 TraceCheckUtils]: 18: Hoare triple {3391#true} assume !(8466bv32 == ~s__state~0); {3391#true} is VALID [2018-11-23 10:52:07,146 INFO L273 TraceCheckUtils]: 19: Hoare triple {3391#true} assume !(8496bv32 == ~s__state~0); {3391#true} is VALID [2018-11-23 10:52:07,147 INFO L273 TraceCheckUtils]: 20: Hoare triple {3391#true} assume !(8512bv32 == ~s__state~0); {3391#true} is VALID [2018-11-23 10:52:07,147 INFO L273 TraceCheckUtils]: 21: Hoare triple {3391#true} assume !(8528bv32 == ~s__state~0); {3391#true} is VALID [2018-11-23 10:52:07,147 INFO L273 TraceCheckUtils]: 22: Hoare triple {3391#true} assume !(8544bv32 == ~s__state~0); {3391#true} is VALID [2018-11-23 10:52:07,148 INFO L273 TraceCheckUtils]: 23: Hoare triple {3391#true} assume !(8560bv32 == ~s__state~0); {3391#true} is VALID [2018-11-23 10:52:07,148 INFO L273 TraceCheckUtils]: 24: Hoare triple {3391#true} assume !(8576bv32 == ~s__state~0); {3391#true} is VALID [2018-11-23 10:52:07,148 INFO L273 TraceCheckUtils]: 25: Hoare triple {3391#true} assume !(8592bv32 == ~s__state~0); {3391#true} is VALID [2018-11-23 10:52:07,148 INFO L273 TraceCheckUtils]: 26: Hoare triple {3391#true} assume !(8608bv32 == ~s__state~0); {3391#true} is VALID [2018-11-23 10:52:07,149 INFO L273 TraceCheckUtils]: 27: Hoare triple {3391#true} assume !(8640bv32 == ~s__state~0); {3391#true} is VALID [2018-11-23 10:52:07,149 INFO L273 TraceCheckUtils]: 28: Hoare triple {3391#true} assume 8656bv32 == ~s__state~0; {3391#true} is VALID [2018-11-23 10:52:07,150 INFO L273 TraceCheckUtils]: 29: Hoare triple {3391#true} assume 2bv32 == ~blastFlag~0;~blastFlag~0 := 3bv32; {3483#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:07,150 INFO L273 TraceCheckUtils]: 30: Hoare triple {3483#(= (_ bv3 32) main_~blastFlag~0)} ~s__state~0 := 8672bv32; {3483#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:07,150 INFO L273 TraceCheckUtils]: 31: Hoare triple {3483#(= (_ bv3 32) main_~blastFlag~0)} assume !false; {3483#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:07,155 INFO L273 TraceCheckUtils]: 32: Hoare triple {3483#(= (_ bv3 32) main_~blastFlag~0)} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {3483#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:07,155 INFO L273 TraceCheckUtils]: 33: Hoare triple {3483#(= (_ bv3 32) main_~blastFlag~0)} assume !(8466bv32 == ~s__state~0); {3483#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:07,156 INFO L273 TraceCheckUtils]: 34: Hoare triple {3483#(= (_ bv3 32) main_~blastFlag~0)} assume !(8496bv32 == ~s__state~0); {3483#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:07,159 INFO L273 TraceCheckUtils]: 35: Hoare triple {3483#(= (_ bv3 32) main_~blastFlag~0)} assume !(8512bv32 == ~s__state~0); {3483#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:07,160 INFO L273 TraceCheckUtils]: 36: Hoare triple {3483#(= (_ bv3 32) main_~blastFlag~0)} assume !(8528bv32 == ~s__state~0); {3483#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:07,161 INFO L273 TraceCheckUtils]: 37: Hoare triple {3483#(= (_ bv3 32) main_~blastFlag~0)} assume !(8544bv32 == ~s__state~0); {3483#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:07,161 INFO L273 TraceCheckUtils]: 38: Hoare triple {3483#(= (_ bv3 32) main_~blastFlag~0)} assume !(8560bv32 == ~s__state~0); {3483#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:07,164 INFO L273 TraceCheckUtils]: 39: Hoare triple {3483#(= (_ bv3 32) main_~blastFlag~0)} assume !(8576bv32 == ~s__state~0); {3483#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:07,164 INFO L273 TraceCheckUtils]: 40: Hoare triple {3483#(= (_ bv3 32) main_~blastFlag~0)} assume !(8592bv32 == ~s__state~0); {3483#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:07,167 INFO L273 TraceCheckUtils]: 41: Hoare triple {3483#(= (_ bv3 32) main_~blastFlag~0)} assume !(8608bv32 == ~s__state~0); {3483#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:07,167 INFO L273 TraceCheckUtils]: 42: Hoare triple {3483#(= (_ bv3 32) main_~blastFlag~0)} assume !(8640bv32 == ~s__state~0); {3483#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:07,170 INFO L273 TraceCheckUtils]: 43: Hoare triple {3483#(= (_ bv3 32) main_~blastFlag~0)} assume !(8656bv32 == ~s__state~0); {3483#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:07,170 INFO L273 TraceCheckUtils]: 44: Hoare triple {3483#(= (_ bv3 32) main_~blastFlag~0)} assume 8672bv32 == ~s__state~0; {3483#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:07,173 INFO L273 TraceCheckUtils]: 45: Hoare triple {3483#(= (_ bv3 32) main_~blastFlag~0)} assume !(4bv32 == ~blastFlag~0); {3483#(= (_ bv3 32) main_~blastFlag~0)} is VALID [2018-11-23 10:52:07,173 INFO L273 TraceCheckUtils]: 46: Hoare triple {3483#(= (_ bv3 32) main_~blastFlag~0)} assume 5bv32 == ~blastFlag~0; {3392#false} is VALID [2018-11-23 10:52:07,173 INFO L273 TraceCheckUtils]: 47: Hoare triple {3392#false} assume !false; {3392#false} is VALID [2018-11-23 10:52:07,178 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 10:52:07,178 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:52:07,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:52:07,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:52:07,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-23 10:52:07,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:52:07,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:52:07,273 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:52:07,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:52:07,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:52:07,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:52:07,274 INFO L87 Difference]: Start difference. First operand 195 states and 272 transitions. Second operand 3 states. [2018-11-23 10:52:07,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:07,790 INFO L93 Difference]: Finished difference Result 387 states and 547 transitions. [2018-11-23 10:52:07,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:52:07,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-23 10:52:07,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:52:07,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:52:07,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2018-11-23 10:52:07,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:52:07,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2018-11-23 10:52:07,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 196 transitions. [2018-11-23 10:52:08,521 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:52:08,527 INFO L225 Difference]: With dead ends: 387 [2018-11-23 10:52:08,527 INFO L226 Difference]: Without dead ends: 247 [2018-11-23 10:52:08,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:52:08,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-23 10:52:08,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2018-11-23 10:52:08,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:52:08,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 247 states. Second operand 245 states. [2018-11-23 10:52:08,996 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand 245 states. [2018-11-23 10:52:08,997 INFO L87 Difference]: Start difference. First operand 247 states. Second operand 245 states. [2018-11-23 10:52:09,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:09,005 INFO L93 Difference]: Finished difference Result 247 states and 342 transitions. [2018-11-23 10:52:09,005 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 342 transitions. [2018-11-23 10:52:09,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:52:09,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:52:09,006 INFO L74 IsIncluded]: Start isIncluded. First operand 245 states. Second operand 247 states. [2018-11-23 10:52:09,006 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 247 states. [2018-11-23 10:52:09,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:09,015 INFO L93 Difference]: Finished difference Result 247 states and 342 transitions. [2018-11-23 10:52:09,016 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 342 transitions. [2018-11-23 10:52:09,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:52:09,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:52:09,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:52:09,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:52:09,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-11-23 10:52:09,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 341 transitions. [2018-11-23 10:52:09,026 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 341 transitions. Word has length 48 [2018-11-23 10:52:09,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:52:09,026 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 341 transitions. [2018-11-23 10:52:09,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:52:09,027 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 341 transitions. [2018-11-23 10:52:09,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 10:52:09,028 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:52:09,028 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:52:09,028 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:52:09,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:52:09,029 INFO L82 PathProgramCache]: Analyzing trace with hash 365198397, now seen corresponding path program 1 times [2018-11-23 10:52:09,029 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:52:09,029 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:52:09,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:52:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:52:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:52:09,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:52:09,180 INFO L256 TraceCheckUtils]: 0: Hoare triple {4880#true} call ULTIMATE.init(); {4880#true} is VALID [2018-11-23 10:52:09,181 INFO L273 TraceCheckUtils]: 1: Hoare triple {4880#true} assume true; {4880#true} is VALID [2018-11-23 10:52:09,181 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4880#true} {4880#true} #197#return; {4880#true} is VALID [2018-11-23 10:52:09,182 INFO L256 TraceCheckUtils]: 3: Hoare triple {4880#true} call #t~ret5 := main(); {4880#true} is VALID [2018-11-23 10:52:09,182 INFO L273 TraceCheckUtils]: 4: Hoare triple {4880#true} havoc ~s__state~0;~s__hit~0 := #t~nondet0;havoc #t~nondet0;~s__verify_mode~0 := #t~nondet1;havoc #t~nondet1;~s__session__peer~0 := #t~nondet2;havoc #t~nondet2;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet3;havoc #t~nondet3;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466bv32;~blastFlag~0 := 0bv32; {4880#true} is VALID [2018-11-23 10:52:09,182 INFO L273 TraceCheckUtils]: 5: Hoare triple {4880#true} assume !false; {4880#true} is VALID [2018-11-23 10:52:09,184 INFO L273 TraceCheckUtils]: 6: Hoare triple {4880#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {4880#true} is VALID [2018-11-23 10:52:09,184 INFO L273 TraceCheckUtils]: 7: Hoare triple {4880#true} assume 8466bv32 == ~s__state~0; {4880#true} is VALID [2018-11-23 10:52:09,184 INFO L273 TraceCheckUtils]: 8: Hoare triple {4880#true} assume 0bv32 == ~blastFlag~0;~blastFlag~0 := 1bv32; {4880#true} is VALID [2018-11-23 10:52:09,185 INFO L273 TraceCheckUtils]: 9: Hoare triple {4880#true} ~s__state~0 := 8496bv32; {4880#true} is VALID [2018-11-23 10:52:09,185 INFO L273 TraceCheckUtils]: 10: Hoare triple {4880#true} assume !false; {4880#true} is VALID [2018-11-23 10:52:09,185 INFO L273 TraceCheckUtils]: 11: Hoare triple {4880#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {4880#true} is VALID [2018-11-23 10:52:09,185 INFO L273 TraceCheckUtils]: 12: Hoare triple {4880#true} assume !(8466bv32 == ~s__state~0); {4880#true} is VALID [2018-11-23 10:52:09,185 INFO L273 TraceCheckUtils]: 13: Hoare triple {4880#true} assume 8496bv32 == ~s__state~0; {4880#true} is VALID [2018-11-23 10:52:09,186 INFO L273 TraceCheckUtils]: 14: Hoare triple {4880#true} assume 1bv32 == ~blastFlag~0;~blastFlag~0 := 2bv32; {4880#true} is VALID [2018-11-23 10:52:09,186 INFO L273 TraceCheckUtils]: 15: Hoare triple {4880#true} assume 0bv32 != ~s__hit~0;~s__state~0 := 8656bv32; {4880#true} is VALID [2018-11-23 10:52:09,186 INFO L273 TraceCheckUtils]: 16: Hoare triple {4880#true} assume !false; {4880#true} is VALID [2018-11-23 10:52:09,186 INFO L273 TraceCheckUtils]: 17: Hoare triple {4880#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {4880#true} is VALID [2018-11-23 10:52:09,187 INFO L273 TraceCheckUtils]: 18: Hoare triple {4880#true} assume !(8466bv32 == ~s__state~0); {4880#true} is VALID [2018-11-23 10:52:09,187 INFO L273 TraceCheckUtils]: 19: Hoare triple {4880#true} assume !(8496bv32 == ~s__state~0); {4880#true} is VALID [2018-11-23 10:52:09,187 INFO L273 TraceCheckUtils]: 20: Hoare triple {4880#true} assume !(8512bv32 == ~s__state~0); {4880#true} is VALID [2018-11-23 10:52:09,187 INFO L273 TraceCheckUtils]: 21: Hoare triple {4880#true} assume !(8528bv32 == ~s__state~0); {4880#true} is VALID [2018-11-23 10:52:09,187 INFO L273 TraceCheckUtils]: 22: Hoare triple {4880#true} assume !(8544bv32 == ~s__state~0); {4880#true} is VALID [2018-11-23 10:52:09,188 INFO L273 TraceCheckUtils]: 23: Hoare triple {4880#true} assume !(8560bv32 == ~s__state~0); {4880#true} is VALID [2018-11-23 10:52:09,188 INFO L273 TraceCheckUtils]: 24: Hoare triple {4880#true} assume !(8576bv32 == ~s__state~0); {4880#true} is VALID [2018-11-23 10:52:09,188 INFO L273 TraceCheckUtils]: 25: Hoare triple {4880#true} assume !(8592bv32 == ~s__state~0); {4880#true} is VALID [2018-11-23 10:52:09,188 INFO L273 TraceCheckUtils]: 26: Hoare triple {4880#true} assume !(8608bv32 == ~s__state~0); {4880#true} is VALID [2018-11-23 10:52:09,188 INFO L273 TraceCheckUtils]: 27: Hoare triple {4880#true} assume !(8640bv32 == ~s__state~0); {4880#true} is VALID [2018-11-23 10:52:09,188 INFO L273 TraceCheckUtils]: 28: Hoare triple {4880#true} assume 8656bv32 == ~s__state~0; {4880#true} is VALID [2018-11-23 10:52:09,189 INFO L273 TraceCheckUtils]: 29: Hoare triple {4880#true} assume 2bv32 == ~blastFlag~0;~blastFlag~0 := 3bv32; {4880#true} is VALID [2018-11-23 10:52:09,189 INFO L273 TraceCheckUtils]: 30: Hoare triple {4880#true} ~s__state~0 := 8672bv32; {4880#true} is VALID [2018-11-23 10:52:09,189 INFO L273 TraceCheckUtils]: 31: Hoare triple {4880#true} assume !false; {4880#true} is VALID [2018-11-23 10:52:09,189 INFO L273 TraceCheckUtils]: 32: Hoare triple {4880#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {4880#true} is VALID [2018-11-23 10:52:09,189 INFO L273 TraceCheckUtils]: 33: Hoare triple {4880#true} assume !(8466bv32 == ~s__state~0); {4880#true} is VALID [2018-11-23 10:52:09,189 INFO L273 TraceCheckUtils]: 34: Hoare triple {4880#true} assume !(8496bv32 == ~s__state~0); {4880#true} is VALID [2018-11-23 10:52:09,190 INFO L273 TraceCheckUtils]: 35: Hoare triple {4880#true} assume !(8512bv32 == ~s__state~0); {4880#true} is VALID [2018-11-23 10:52:09,190 INFO L273 TraceCheckUtils]: 36: Hoare triple {4880#true} assume !(8528bv32 == ~s__state~0); {4880#true} is VALID [2018-11-23 10:52:09,190 INFO L273 TraceCheckUtils]: 37: Hoare triple {4880#true} assume !(8544bv32 == ~s__state~0); {4880#true} is VALID [2018-11-23 10:52:09,190 INFO L273 TraceCheckUtils]: 38: Hoare triple {4880#true} assume !(8560bv32 == ~s__state~0); {4880#true} is VALID [2018-11-23 10:52:09,190 INFO L273 TraceCheckUtils]: 39: Hoare triple {4880#true} assume !(8576bv32 == ~s__state~0); {4880#true} is VALID [2018-11-23 10:52:09,190 INFO L273 TraceCheckUtils]: 40: Hoare triple {4880#true} assume !(8592bv32 == ~s__state~0); {4880#true} is VALID [2018-11-23 10:52:09,191 INFO L273 TraceCheckUtils]: 41: Hoare triple {4880#true} assume !(8608bv32 == ~s__state~0); {4880#true} is VALID [2018-11-23 10:52:09,191 INFO L273 TraceCheckUtils]: 42: Hoare triple {4880#true} assume !(8640bv32 == ~s__state~0); {4880#true} is VALID [2018-11-23 10:52:09,191 INFO L273 TraceCheckUtils]: 43: Hoare triple {4880#true} assume !(8656bv32 == ~s__state~0); {4880#true} is VALID [2018-11-23 10:52:09,191 INFO L273 TraceCheckUtils]: 44: Hoare triple {4880#true} assume 8672bv32 == ~s__state~0; {4880#true} is VALID [2018-11-23 10:52:09,191 INFO L273 TraceCheckUtils]: 45: Hoare triple {4880#true} assume !(4bv32 == ~blastFlag~0); {4880#true} is VALID [2018-11-23 10:52:09,191 INFO L273 TraceCheckUtils]: 46: Hoare triple {4880#true} assume !(5bv32 == ~blastFlag~0); {4880#true} is VALID [2018-11-23 10:52:09,194 INFO L273 TraceCheckUtils]: 47: Hoare triple {4880#true} assume 0bv32 != ~s__hit~0;~s__state~0 := 8640bv32; {5026#(= (_ bv8640 32) main_~s__state~0)} is VALID [2018-11-23 10:52:09,194 INFO L273 TraceCheckUtils]: 48: Hoare triple {5026#(= (_ bv8640 32) main_~s__state~0)} assume !false; {5026#(= (_ bv8640 32) main_~s__state~0)} is VALID [2018-11-23 10:52:09,195 INFO L273 TraceCheckUtils]: 49: Hoare triple {5026#(= (_ bv8640 32) main_~s__state~0)} assume ~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32); {4881#false} is VALID [2018-11-23 10:52:09,195 INFO L273 TraceCheckUtils]: 50: Hoare triple {4881#false} assume !false; {4881#false} is VALID [2018-11-23 10:52:09,197 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 10:52:09,197 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:52:09,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:52:09,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:52:09,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-11-23 10:52:09,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:52:09,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:52:09,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:52:09,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:52:09,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:52:09,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:52:09,236 INFO L87 Difference]: Start difference. First operand 245 states and 341 transitions. Second operand 3 states. [2018-11-23 10:52:09,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:09,621 INFO L93 Difference]: Finished difference Result 514 states and 739 transitions. [2018-11-23 10:52:09,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:52:09,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-11-23 10:52:09,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:52:09,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:52:09,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2018-11-23 10:52:09,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:52:09,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2018-11-23 10:52:09,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 156 transitions. [2018-11-23 10:52:09,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:52:09,783 INFO L225 Difference]: With dead ends: 514 [2018-11-23 10:52:09,783 INFO L226 Difference]: Without dead ends: 274 [2018-11-23 10:52:09,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:52:09,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-11-23 10:52:09,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2018-11-23 10:52:09,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:52:09,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 274 states. Second operand 274 states. [2018-11-23 10:52:09,929 INFO L74 IsIncluded]: Start isIncluded. First operand 274 states. Second operand 274 states. [2018-11-23 10:52:09,929 INFO L87 Difference]: Start difference. First operand 274 states. Second operand 274 states. [2018-11-23 10:52:09,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:09,938 INFO L93 Difference]: Finished difference Result 274 states and 351 transitions. [2018-11-23 10:52:09,939 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 351 transitions. [2018-11-23 10:52:09,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:52:09,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:52:09,940 INFO L74 IsIncluded]: Start isIncluded. First operand 274 states. Second operand 274 states. [2018-11-23 10:52:09,940 INFO L87 Difference]: Start difference. First operand 274 states. Second operand 274 states. [2018-11-23 10:52:09,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:09,948 INFO L93 Difference]: Finished difference Result 274 states and 351 transitions. [2018-11-23 10:52:09,948 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 351 transitions. [2018-11-23 10:52:09,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:52:09,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:52:09,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:52:09,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:52:09,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-11-23 10:52:09,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 351 transitions. [2018-11-23 10:52:09,957 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 351 transitions. Word has length 51 [2018-11-23 10:52:09,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:52:09,958 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 351 transitions. [2018-11-23 10:52:09,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:52:09,958 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 351 transitions. [2018-11-23 10:52:09,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 10:52:09,959 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:52:09,959 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:52:09,960 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:52:09,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:52:09,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1747736199, now seen corresponding path program 1 times [2018-11-23 10:52:09,960 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:52:09,961 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:52:09,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:52:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:52:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:52:10,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:52:10,396 INFO L256 TraceCheckUtils]: 0: Hoare triple {6603#true} call ULTIMATE.init(); {6603#true} is VALID [2018-11-23 10:52:10,396 INFO L273 TraceCheckUtils]: 1: Hoare triple {6603#true} assume true; {6603#true} is VALID [2018-11-23 10:52:10,396 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6603#true} {6603#true} #197#return; {6603#true} is VALID [2018-11-23 10:52:10,397 INFO L256 TraceCheckUtils]: 3: Hoare triple {6603#true} call #t~ret5 := main(); {6603#true} is VALID [2018-11-23 10:52:10,397 INFO L273 TraceCheckUtils]: 4: Hoare triple {6603#true} havoc ~s__state~0;~s__hit~0 := #t~nondet0;havoc #t~nondet0;~s__verify_mode~0 := #t~nondet1;havoc #t~nondet1;~s__session__peer~0 := #t~nondet2;havoc #t~nondet2;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet3;havoc #t~nondet3;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466bv32;~blastFlag~0 := 0bv32; {6603#true} is VALID [2018-11-23 10:52:10,397 INFO L273 TraceCheckUtils]: 5: Hoare triple {6603#true} assume !false; {6603#true} is VALID [2018-11-23 10:52:10,397 INFO L273 TraceCheckUtils]: 6: Hoare triple {6603#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {6603#true} is VALID [2018-11-23 10:52:10,397 INFO L273 TraceCheckUtils]: 7: Hoare triple {6603#true} assume 8466bv32 == ~s__state~0; {6603#true} is VALID [2018-11-23 10:52:10,397 INFO L273 TraceCheckUtils]: 8: Hoare triple {6603#true} assume 0bv32 == ~blastFlag~0;~blastFlag~0 := 1bv32; {6603#true} is VALID [2018-11-23 10:52:10,398 INFO L273 TraceCheckUtils]: 9: Hoare triple {6603#true} ~s__state~0 := 8496bv32; {6603#true} is VALID [2018-11-23 10:52:10,398 INFO L273 TraceCheckUtils]: 10: Hoare triple {6603#true} assume !false; {6603#true} is VALID [2018-11-23 10:52:10,398 INFO L273 TraceCheckUtils]: 11: Hoare triple {6603#true} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {6603#true} is VALID [2018-11-23 10:52:10,398 INFO L273 TraceCheckUtils]: 12: Hoare triple {6603#true} assume !(8466bv32 == ~s__state~0); {6603#true} is VALID [2018-11-23 10:52:10,398 INFO L273 TraceCheckUtils]: 13: Hoare triple {6603#true} assume 8496bv32 == ~s__state~0; {6603#true} is VALID [2018-11-23 10:52:10,398 INFO L273 TraceCheckUtils]: 14: Hoare triple {6603#true} assume 1bv32 == ~blastFlag~0;~blastFlag~0 := 2bv32; {6603#true} is VALID [2018-11-23 10:52:10,399 INFO L273 TraceCheckUtils]: 15: Hoare triple {6603#true} assume 0bv32 != ~s__hit~0;~s__state~0 := 8656bv32; {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,400 INFO L273 TraceCheckUtils]: 16: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !false; {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,401 INFO L273 TraceCheckUtils]: 17: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,401 INFO L273 TraceCheckUtils]: 18: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8466bv32 == ~s__state~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,402 INFO L273 TraceCheckUtils]: 19: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8496bv32 == ~s__state~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,403 INFO L273 TraceCheckUtils]: 20: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8512bv32 == ~s__state~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,403 INFO L273 TraceCheckUtils]: 21: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8528bv32 == ~s__state~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,404 INFO L273 TraceCheckUtils]: 22: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8544bv32 == ~s__state~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,404 INFO L273 TraceCheckUtils]: 23: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8560bv32 == ~s__state~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,405 INFO L273 TraceCheckUtils]: 24: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8576bv32 == ~s__state~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,405 INFO L273 TraceCheckUtils]: 25: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8592bv32 == ~s__state~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,405 INFO L273 TraceCheckUtils]: 26: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8608bv32 == ~s__state~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,406 INFO L273 TraceCheckUtils]: 27: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8640bv32 == ~s__state~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,406 INFO L273 TraceCheckUtils]: 28: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume 8656bv32 == ~s__state~0; {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,407 INFO L273 TraceCheckUtils]: 29: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume 2bv32 == ~blastFlag~0;~blastFlag~0 := 3bv32; {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,407 INFO L273 TraceCheckUtils]: 30: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} ~s__state~0 := 8672bv32; {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,414 INFO L273 TraceCheckUtils]: 31: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !false; {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,414 INFO L273 TraceCheckUtils]: 32: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,415 INFO L273 TraceCheckUtils]: 33: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8466bv32 == ~s__state~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,415 INFO L273 TraceCheckUtils]: 34: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8496bv32 == ~s__state~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,415 INFO L273 TraceCheckUtils]: 35: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8512bv32 == ~s__state~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,416 INFO L273 TraceCheckUtils]: 36: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8528bv32 == ~s__state~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,416 INFO L273 TraceCheckUtils]: 37: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8544bv32 == ~s__state~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,417 INFO L273 TraceCheckUtils]: 38: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8560bv32 == ~s__state~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,417 INFO L273 TraceCheckUtils]: 39: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8576bv32 == ~s__state~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,418 INFO L273 TraceCheckUtils]: 40: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8592bv32 == ~s__state~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,419 INFO L273 TraceCheckUtils]: 41: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8608bv32 == ~s__state~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,419 INFO L273 TraceCheckUtils]: 42: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8640bv32 == ~s__state~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,420 INFO L273 TraceCheckUtils]: 43: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8656bv32 == ~s__state~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,420 INFO L273 TraceCheckUtils]: 44: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume 8672bv32 == ~s__state~0; {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,420 INFO L273 TraceCheckUtils]: 45: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(4bv32 == ~blastFlag~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,421 INFO L273 TraceCheckUtils]: 46: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(5bv32 == ~blastFlag~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,422 INFO L273 TraceCheckUtils]: 47: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume 0bv32 != ~s__hit~0;~s__state~0 := 8640bv32; {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,426 INFO L273 TraceCheckUtils]: 48: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !false; {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,426 INFO L273 TraceCheckUtils]: 49: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32)); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,426 INFO L273 TraceCheckUtils]: 50: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8466bv32 == ~s__state~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,427 INFO L273 TraceCheckUtils]: 51: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8496bv32 == ~s__state~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,427 INFO L273 TraceCheckUtils]: 52: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8512bv32 == ~s__state~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,433 INFO L273 TraceCheckUtils]: 53: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8528bv32 == ~s__state~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,433 INFO L273 TraceCheckUtils]: 54: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8544bv32 == ~s__state~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,434 INFO L273 TraceCheckUtils]: 55: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8560bv32 == ~s__state~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,434 INFO L273 TraceCheckUtils]: 56: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8576bv32 == ~s__state~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,434 INFO L273 TraceCheckUtils]: 57: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8592bv32 == ~s__state~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,436 INFO L273 TraceCheckUtils]: 58: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(8608bv32 == ~s__state~0); {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,436 INFO L273 TraceCheckUtils]: 59: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume 8640bv32 == ~s__state~0; {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,437 INFO L273 TraceCheckUtils]: 60: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume 3bv32 == ~blastFlag~0;~blastFlag~0 := 4bv32; {6653#(not (= (_ bv0 32) main_~s__hit~0))} is VALID [2018-11-23 10:52:10,437 INFO L273 TraceCheckUtils]: 61: Hoare triple {6653#(not (= (_ bv0 32) main_~s__hit~0))} assume !(0bv32 != ~s__hit~0);~s__state~0 := 8656bv32; {6604#false} is VALID [2018-11-23 10:52:10,438 INFO L273 TraceCheckUtils]: 62: Hoare triple {6604#false} assume !false; {6604#false} is VALID [2018-11-23 10:52:10,438 INFO L273 TraceCheckUtils]: 63: Hoare triple {6604#false} assume ~bvsle32(~s__state~0, 8512bv32) && ~bvsgt32(~blastFlag~0, 2bv32); {6604#false} is VALID [2018-11-23 10:52:10,438 INFO L273 TraceCheckUtils]: 64: Hoare triple {6604#false} assume !false; {6604#false} is VALID [2018-11-23 10:52:10,443 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 10:52:10,443 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:52:10,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:52:10,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:52:10,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-11-23 10:52:10,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:52:10,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:52:10,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:52:10,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:52:10,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:52:10,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:52:10,515 INFO L87 Difference]: Start difference. First operand 274 states and 351 transitions. Second operand 3 states. [2018-11-23 10:52:11,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:11,195 INFO L93 Difference]: Finished difference Result 670 states and 853 transitions. [2018-11-23 10:52:11,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:52:11,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-11-23 10:52:11,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:52:11,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:52:11,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2018-11-23 10:52:11,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:52:11,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2018-11-23 10:52:11,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 188 transitions. [2018-11-23 10:52:11,951 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:52:11,951 INFO L225 Difference]: With dead ends: 670 [2018-11-23 10:52:11,951 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 10:52:11,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:52:11,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 10:52:11,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 10:52:11,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:52:11,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 10:52:11,954 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 10:52:11,954 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 10:52:11,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:11,954 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 10:52:11,954 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 10:52:11,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:52:11,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:52:11,954 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 10:52:11,954 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 10:52:11,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:52:11,955 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 10:52:11,955 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 10:52:11,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:52:11,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:52:11,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:52:11,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:52:11,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 10:52:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 10:52:11,956 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2018-11-23 10:52:11,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:52:11,956 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 10:52:11,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:52:11,956 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 10:52:11,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:52:11,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 10:52:12,516 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 10:52:12,516 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 10:52:12,517 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 10:52:12,517 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 10:52:12,517 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 10:52:12,517 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 10:52:12,517 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 9 218) no Hoare annotation was computed. [2018-11-23 10:52:12,517 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 186) no Hoare annotation was computed. [2018-11-23 10:52:12,517 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 190) no Hoare annotation was computed. [2018-11-23 10:52:12,517 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 75 184) no Hoare annotation was computed. [2018-11-23 10:52:12,517 INFO L448 ceAbstractionStarter]: For program point L53(lines 53 194) no Hoare annotation was computed. [2018-11-23 10:52:12,517 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 75 184) no Hoare annotation was computed. [2018-11-23 10:52:12,518 INFO L444 ceAbstractionStarter]: At program point L177(lines 23 212) the Hoare annotation is: (let ((.cse0 (= (_ bv3 32) main_~blastFlag~0))) (or (= (_ bv0 32) main_~blastFlag~0) (= (_ bv1 32) main_~blastFlag~0) (= (_ bv2 32) main_~blastFlag~0) (and (= (_ bv8672 32) main_~s__state~0) .cse0) (and .cse0 (not (= (_ bv0 32) main_~s__hit~0)) (= (_ bv8640 32) main_~s__state~0)))) [2018-11-23 10:52:12,518 INFO L448 ceAbstractionStarter]: For program point L45(lines 45 198) no Hoare annotation was computed. [2018-11-23 10:52:12,518 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 140) no Hoare annotation was computed. [2018-11-23 10:52:12,518 INFO L444 ceAbstractionStarter]: At program point L70(lines 69 186) the Hoare annotation is: (or (= (_ bv0 32) main_~blastFlag~0) (= (_ bv1 32) main_~blastFlag~0) (= (_ bv2 32) main_~blastFlag~0)) [2018-11-23 10:52:12,518 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 202) no Hoare annotation was computed. [2018-11-23 10:52:12,518 INFO L444 ceAbstractionStarter]: At program point L62(lines 61 190) the Hoare annotation is: (or (= (_ bv1 32) main_~blastFlag~0) (= (_ bv0 32) main_~blastFlag~0) (= (_ bv2 32) main_~blastFlag~0)) [2018-11-23 10:52:12,518 INFO L444 ceAbstractionStarter]: At program point L54(lines 53 194) the Hoare annotation is: (or (= (_ bv0 32) main_~blastFlag~0) (= (_ bv1 32) main_~blastFlag~0) (= (_ bv2 32) main_~blastFlag~0)) [2018-11-23 10:52:12,518 INFO L444 ceAbstractionStarter]: At program point L46(lines 45 198) the Hoare annotation is: (or (= (_ bv1 32) main_~blastFlag~0) (= (_ bv0 32) main_~blastFlag~0) (= (_ bv2 32) main_~blastFlag~0)) [2018-11-23 10:52:12,518 INFO L448 ceAbstractionStarter]: For program point L79-1(lines 79 81) no Hoare annotation was computed. [2018-11-23 10:52:12,519 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 9 218) no Hoare annotation was computed. [2018-11-23 10:52:12,519 INFO L448 ceAbstractionStarter]: For program point L170-1(lines 75 184) no Hoare annotation was computed. [2018-11-23 10:52:12,519 INFO L444 ceAbstractionStarter]: At program point L38(lines 37 202) the Hoare annotation is: (or (= (_ bv1 32) main_~blastFlag~0) (= (_ bv0 32) main_~blastFlag~0) (= (_ bv2 32) main_~blastFlag~0)) [2018-11-23 10:52:12,519 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 205) no Hoare annotation was computed. [2018-11-23 10:52:12,519 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 9 218) the Hoare annotation is: true [2018-11-23 10:52:12,519 INFO L444 ceAbstractionStarter]: At program point L121(lines 114 123) the Hoare annotation is: (or (= (_ bv0 32) main_~blastFlag~0) (= (_ bv1 32) main_~blastFlag~0) (= (_ bv2 32) main_~blastFlag~0)) [2018-11-23 10:52:12,520 INFO L444 ceAbstractionStarter]: At program point L113(lines 106 124) the Hoare annotation is: (or (= (_ bv0 32) main_~blastFlag~0) (= (_ bv1 32) main_~blastFlag~0) (= (_ bv2 32) main_~blastFlag~0)) [2018-11-23 10:52:12,520 INFO L448 ceAbstractionStarter]: For program point L163-1(lines 163 165) no Hoare annotation was computed. [2018-11-23 10:52:12,520 INFO L444 ceAbstractionStarter]: At program point L31(lines 30 205) the Hoare annotation is: (or (= (_ bv0 32) main_~blastFlag~0) (= (_ bv1 32) main_~blastFlag~0) (= (_ bv2 32) main_~blastFlag~0)) [2018-11-23 10:52:12,520 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 124) no Hoare annotation was computed. [2018-11-23 10:52:12,520 INFO L448 ceAbstractionStarter]: For program point L73(lines 73 184) no Hoare annotation was computed. [2018-11-23 10:52:12,520 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 188) no Hoare annotation was computed. [2018-11-23 10:52:12,520 INFO L448 ceAbstractionStarter]: For program point L57(lines 57 192) no Hoare annotation was computed. [2018-11-23 10:52:12,520 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-11-23 10:52:12,521 INFO L451 ceAbstractionStarter]: At program point L214(lines 9 218) the Hoare annotation is: true [2018-11-23 10:52:12,521 INFO L448 ceAbstractionStarter]: For program point L115(lines 115 119) no Hoare annotation was computed. [2018-11-23 10:52:12,521 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 196) no Hoare annotation was computed. [2018-11-23 10:52:12,521 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 216) no Hoare annotation was computed. [2018-11-23 10:52:12,521 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 175) no Hoare annotation was computed. [2018-11-23 10:52:12,521 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 111) no Hoare annotation was computed. [2018-11-23 10:52:12,522 INFO L444 ceAbstractionStarter]: At program point L74(lines 73 184) the Hoare annotation is: (let ((.cse0 (= (_ bv8672 32) main_~s__state~0))) (or (and .cse0 (= (_ bv2 32) main_~blastFlag~0)) (and (= (_ bv0 32) main_~blastFlag~0) .cse0) (and .cse0 (= (_ bv3 32) main_~blastFlag~0)) (and (= (_ bv1 32) main_~blastFlag~0) .cse0))) [2018-11-23 10:52:12,522 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 200) no Hoare annotation was computed. [2018-11-23 10:52:12,522 INFO L444 ceAbstractionStarter]: At program point L66(lines 65 188) the Hoare annotation is: (let ((.cse0 (= (_ bv8640 32) main_~s__state~0))) (or (and (= (_ bv3 32) main_~blastFlag~0) (not (= (_ bv0 32) main_~s__hit~0)) .cse0) (and (= (_ bv1 32) main_~blastFlag~0) .cse0) (and (= (_ bv0 32) main_~blastFlag~0) .cse0) (and (= (_ bv2 32) main_~blastFlag~0) .cse0))) [2018-11-23 10:52:12,522 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 204) no Hoare annotation was computed. [2018-11-23 10:52:12,522 INFO L444 ceAbstractionStarter]: At program point L58(lines 57 192) the Hoare annotation is: (or (= (_ bv0 32) main_~blastFlag~0) (= (_ bv1 32) main_~blastFlag~0) (= (_ bv2 32) main_~blastFlag~0)) [2018-11-23 10:52:12,522 INFO L444 ceAbstractionStarter]: At program point L50(lines 49 196) the Hoare annotation is: (or (= (_ bv0 32) main_~blastFlag~0) (= (_ bv1 32) main_~blastFlag~0) (= (_ bv2 32) main_~blastFlag~0)) [2018-11-23 10:52:12,523 INFO L444 ceAbstractionStarter]: At program point L174(lines 9 218) the Hoare annotation is: false [2018-11-23 10:52:12,523 INFO L444 ceAbstractionStarter]: At program point L42(lines 41 200) the Hoare annotation is: (or (= (_ bv1 32) main_~blastFlag~0) (= (_ bv0 32) main_~blastFlag~0) (= (_ bv2 32) main_~blastFlag~0)) [2018-11-23 10:52:12,523 INFO L444 ceAbstractionStarter]: At program point L34(lines 33 204) the Hoare annotation is: (or (= (_ bv0 32) main_~blastFlag~0) (= (_ bv1 32) main_~blastFlag~0) (= (_ bv2 32) main_~blastFlag~0)) [2018-11-23 10:52:12,525 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 10:52:12,541 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 10:52:12,541 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 10:52:12,541 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 10:52:12,541 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 10:52:12,541 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 10:52:12,542 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 10:52:12,542 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 10:52:12,542 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 10:52:12,542 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-23 10:52:12,542 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 10:52:12,542 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2018-11-23 10:52:12,542 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2018-11-23 10:52:12,542 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 10:52:12,543 WARN L170 areAnnotationChecker]: L79-1 has no Hoare annotation [2018-11-23 10:52:12,543 WARN L170 areAnnotationChecker]: L79-1 has no Hoare annotation [2018-11-23 10:52:12,543 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2018-11-23 10:52:12,543 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2018-11-23 10:52:12,543 WARN L170 areAnnotationChecker]: L79-1 has no Hoare annotation [2018-11-23 10:52:12,543 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2018-11-23 10:52:12,543 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2018-11-23 10:52:12,543 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2018-11-23 10:52:12,543 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2018-11-23 10:52:12,543 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2018-11-23 10:52:12,544 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2018-11-23 10:52:12,558 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-23 10:52:12,558 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-23 10:52:12,572 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2018-11-23 10:52:12,572 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2018-11-23 10:52:12,572 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2018-11-23 10:52:12,586 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2018-11-23 10:52:12,586 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2018-11-23 10:52:12,586 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2018-11-23 10:52:12,586 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2018-11-23 10:52:12,595 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2018-11-23 10:52:12,595 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2018-11-23 10:52:12,595 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2018-11-23 10:52:12,596 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2018-11-23 10:52:12,596 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2018-11-23 10:52:12,608 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2018-11-23 10:52:12,608 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2018-11-23 10:52:12,608 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2018-11-23 10:52:12,608 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2018-11-23 10:52:12,608 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2018-11-23 10:52:12,609 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2018-11-23 10:52:12,609 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2018-11-23 10:52:12,610 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2018-11-23 10:52:12,610 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2018-11-23 10:52:12,610 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2018-11-23 10:52:12,610 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2018-11-23 10:52:12,610 WARN L170 areAnnotationChecker]: L152-1 has no Hoare annotation [2018-11-23 10:52:12,610 WARN L170 areAnnotationChecker]: L152-1 has no Hoare annotation [2018-11-23 10:52:12,611 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2018-11-23 10:52:12,611 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2018-11-23 10:52:12,611 WARN L170 areAnnotationChecker]: L152-1 has no Hoare annotation [2018-11-23 10:52:12,611 WARN L170 areAnnotationChecker]: L152-1 has no Hoare annotation [2018-11-23 10:52:12,611 WARN L170 areAnnotationChecker]: L163-1 has no Hoare annotation [2018-11-23 10:52:12,611 WARN L170 areAnnotationChecker]: L163-1 has no Hoare annotation [2018-11-23 10:52:12,611 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2018-11-23 10:52:12,611 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2018-11-23 10:52:12,611 WARN L170 areAnnotationChecker]: L163-1 has no Hoare annotation [2018-11-23 10:52:12,611 WARN L170 areAnnotationChecker]: L170-1 has no Hoare annotation [2018-11-23 10:52:12,611 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2018-11-23 10:52:12,611 WARN L170 areAnnotationChecker]: L170-1 has no Hoare annotation [2018-11-23 10:52:12,611 WARN L170 areAnnotationChecker]: L170-1 has no Hoare annotation [2018-11-23 10:52:12,611 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2018-11-23 10:52:12,612 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2018-11-23 10:52:12,612 INFO L163 areAnnotationChecker]: CFG has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 10:52:12,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:52:12 BoogieIcfgContainer [2018-11-23 10:52:12,630 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 10:52:12,630 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 10:52:12,630 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 10:52:12,631 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 10:52:12,631 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:52:01" (3/4) ... [2018-11-23 10:52:12,635 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 10:52:12,646 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 10:52:12,646 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 10:52:12,654 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 10:52:12,654 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 10:52:12,656 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 10:52:12,749 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.cil.c-witness.graphml [2018-11-23 10:52:12,749 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 10:52:12,751 INFO L168 Benchmark]: Toolchain (without parser) took 12680.24 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 841.5 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -512.0 MB). Peak memory consumption was 329.5 MB. Max. memory is 7.1 GB. [2018-11-23 10:52:12,752 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 10:52:12,752 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 10:52:12,753 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 10:52:12,753 INFO L168 Benchmark]: Boogie Preprocessor took 43.81 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 10:52:12,754 INFO L168 Benchmark]: RCFGBuilder took 955.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 723.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -756.0 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2018-11-23 10:52:12,754 INFO L168 Benchmark]: TraceAbstraction took 11211.63 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 118.5 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 219.6 MB). Peak memory consumption was 338.1 MB. Max. memory is 7.1 GB. [2018-11-23 10:52:12,755 INFO L168 Benchmark]: Witness Printer took 118.99 ms. Allocated memory is still 2.4 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2018-11-23 10:52:12,757 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 322.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 22.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.81 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 955.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 723.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -756.0 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11211.63 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 118.5 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 219.6 MB). Peak memory consumption was 338.1 MB. Max. memory is 7.1 GB. * Witness Printer took 118.99 ms. Allocated memory is still 2.4 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 216]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: (0bv32 == blastFlag || 1bv32 == blastFlag) || 2bv32 == blastFlag - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (0bv32 == blastFlag || 1bv32 == blastFlag) || 2bv32 == blastFlag - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((((3bv32 == blastFlag && !(0bv32 == s__hit)) && 8640bv32 == s__state) || (1bv32 == blastFlag && 8640bv32 == s__state)) || (0bv32 == blastFlag && 8640bv32 == s__state)) || (2bv32 == blastFlag && 8640bv32 == s__state) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: (1bv32 == blastFlag || 0bv32 == blastFlag) || 2bv32 == blastFlag - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: (0bv32 == blastFlag || 1bv32 == blastFlag) || 2bv32 == blastFlag - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (0bv32 == blastFlag || 1bv32 == blastFlag) || 2bv32 == blastFlag - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: (1bv32 == blastFlag || 0bv32 == blastFlag) || 2bv32 == blastFlag - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: (0bv32 == blastFlag || 1bv32 == blastFlag) || 2bv32 == blastFlag - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: (0bv32 == blastFlag || 1bv32 == blastFlag) || 2bv32 == blastFlag - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((0bv32 == blastFlag || 1bv32 == blastFlag) || 2bv32 == blastFlag) || (8672bv32 == s__state && 3bv32 == blastFlag)) || ((3bv32 == blastFlag && !(0bv32 == s__hit)) && 8640bv32 == s__state) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (0bv32 == blastFlag || 1bv32 == blastFlag) || 2bv32 == blastFlag - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: (1bv32 == blastFlag || 0bv32 == blastFlag) || 2bv32 == blastFlag - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (0bv32 == blastFlag || 1bv32 == blastFlag) || 2bv32 == blastFlag - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (1bv32 == blastFlag || 0bv32 == blastFlag) || 2bv32 == blastFlag - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: (((8672bv32 == s__state && 2bv32 == blastFlag) || (0bv32 == blastFlag && 8672bv32 == s__state)) || (8672bv32 == s__state && 3bv32 == blastFlag)) || (1bv32 == blastFlag && 8672bv32 == s__state) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 50 locations, 1 error locations. SAFE Result, 11.0s OverallTime, 7 OverallIterations, 6 TraceHistogramMax, 7.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 672 SDtfs, 265 SDslu, 328 SDs, 0 SdLazy, 195 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 231 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=274occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 21 PreInvPairs, 129 NumberOfFragments, 216 HoareAnnotationTreeSize, 21 FomulaSimplifications, 490 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 21 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 21381 SizeOfPredicates, 6 NumberOfNonLiveVariables, 345 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 164/164 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...