java -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 --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.cil.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:53:03,483 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:53:03,486 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:53:03,498 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:53:03,498 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:53:03,499 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:53:03,500 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:53:03,502 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:53:03,504 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:53:03,505 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:53:03,506 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:53:03,506 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:53:03,507 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:53:03,508 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:53:03,509 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:53:03,510 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:53:03,511 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:53:03,513 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:53:03,515 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:53:03,516 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:53:03,518 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:53:03,519 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:53:03,521 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:53:03,522 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:53:03,522 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:53:03,523 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:53:03,524 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:53:03,525 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:53:03,526 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:53:03,527 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:53:03,527 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:53:03,528 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:53:03,528 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:53:03,529 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:53:03,530 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:53:03,530 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:53:03,531 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 12:53:03,547 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:53:03,547 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:53:03,548 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:53:03,548 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:53:03,549 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:53:03,549 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:53:03,549 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:53:03,549 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:53:03,549 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:53:03,550 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:53:03,550 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:53:03,550 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:53:03,550 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:53:03,550 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:53:03,551 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:53:03,551 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:53:03,551 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:53:03,551 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:53:03,551 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:53:03,552 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:53:03,552 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:53:03,552 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:53:03,552 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:53:03,552 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:53:03,553 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:53:03,553 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:53:03,553 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:53:03,553 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:53:03,553 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:53:03,554 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:53:03,554 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:53:03,621 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:53:03,634 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:53:03,638 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:53:03,640 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:53:03,640 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:53:03,641 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.cil.c_21.bpl [2018-10-04 12:53:03,642 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.cil.c_21.bpl' [2018-10-04 12:53:03,725 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:53:03,727 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:53:03,728 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:53:03,728 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:53:03,728 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:53:03,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:03" (1/1) ... [2018-10-04 12:53:03,773 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:03" (1/1) ... [2018-10-04 12:53:03,785 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:53:03,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:53:03,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:53:03,786 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:53:03,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:03" (1/1) ... [2018-10-04 12:53:03,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:03" (1/1) ... [2018-10-04 12:53:03,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:03" (1/1) ... [2018-10-04 12:53:03,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:03" (1/1) ... [2018-10-04 12:53:03,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:03" (1/1) ... [2018-10-04 12:53:03,816 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:03" (1/1) ... [2018-10-04 12:53:03,819 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:03" (1/1) ... [2018-10-04 12:53:03,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:53:03,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:53:03,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:53:03,833 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:53:03,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:03" (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-10-04 12:53:03,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:53:03,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:53:04,663 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:53:04,664 INFO L202 PluginConnector]: Adding new model s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:53:04 BoogieIcfgContainer [2018-10-04 12:53:04,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:53:04,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:53:04,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:53:04,671 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:53:04,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:03" (1/2) ... [2018-10-04 12:53:04,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc47587 and model type s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:53:04, skipping insertion in model container [2018-10-04 12:53:04,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:53:04" (2/2) ... [2018-10-04 12:53:04,682 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil.c_21.bpl [2018-10-04 12:53:04,695 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:53:04,708 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:53:04,764 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:53:04,765 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:53:04,765 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:53:04,765 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:53:04,766 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:53:04,766 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:53:04,766 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:53:04,766 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:53:04,766 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:53:04,781 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-10-04 12:53:04,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:53:04,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:04,789 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:04,790 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:04,797 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:04,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1918575661, now seen corresponding path program 1 times [2018-10-04 12:53:04,800 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:04,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:04,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:04,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:04,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:05,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:53:05,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:05,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:53:05,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:05,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:05,057 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:05,059 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2018-10-04 12:53:05,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:05,370 INFO L93 Difference]: Finished difference Result 51 states and 85 transitions. [2018-10-04 12:53:05,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:05,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-04 12:53:05,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:05,386 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:53:05,386 INFO L226 Difference]: Without dead ends: 30 [2018-10-04 12:53:05,390 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:05,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-04 12:53:05,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-04 12:53:05,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:53:05,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 48 transitions. [2018-10-04 12:53:05,429 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 48 transitions. Word has length 10 [2018-10-04 12:53:05,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:05,430 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 48 transitions. [2018-10-04 12:53:05,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:05,430 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 48 transitions. [2018-10-04 12:53:05,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:53:05,431 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:05,431 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:05,432 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:05,432 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:05,432 INFO L82 PathProgramCache]: Analyzing trace with hash -469243037, now seen corresponding path program 1 times [2018-10-04 12:53:05,433 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:05,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:05,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:05,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:05,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:05,524 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:53:05,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:05,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:53:05,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:05,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:05,527 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:05,527 INFO L87 Difference]: Start difference. First operand 30 states and 48 transitions. Second operand 3 states. [2018-10-04 12:53:05,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:05,905 INFO L93 Difference]: Finished difference Result 73 states and 119 transitions. [2018-10-04 12:53:05,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:05,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-04 12:53:05,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:05,907 INFO L225 Difference]: With dead ends: 73 [2018-10-04 12:53:05,907 INFO L226 Difference]: Without dead ends: 44 [2018-10-04 12:53:05,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:05,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-04 12:53:05,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-04 12:53:05,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-04 12:53:05,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 70 transitions. [2018-10-04 12:53:05,920 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 70 transitions. Word has length 19 [2018-10-04 12:53:05,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:05,924 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 70 transitions. [2018-10-04 12:53:05,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:05,925 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 70 transitions. [2018-10-04 12:53:05,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 12:53:05,926 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:05,926 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:05,928 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:05,928 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:05,928 INFO L82 PathProgramCache]: Analyzing trace with hash -215353290, now seen corresponding path program 1 times [2018-10-04 12:53:05,929 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:05,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:05,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:05,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:05,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:06,045 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:53:06,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:06,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:53:06,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:06,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:06,048 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:06,048 INFO L87 Difference]: Start difference. First operand 44 states and 70 transitions. Second operand 3 states. [2018-10-04 12:53:06,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:06,303 INFO L93 Difference]: Finished difference Result 100 states and 161 transitions. [2018-10-04 12:53:06,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:06,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-04 12:53:06,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:06,306 INFO L225 Difference]: With dead ends: 100 [2018-10-04 12:53:06,306 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:53:06,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:06,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:53:06,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-04 12:53:06,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-04 12:53:06,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 91 transitions. [2018-10-04 12:53:06,320 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 91 transitions. Word has length 22 [2018-10-04 12:53:06,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:06,320 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 91 transitions. [2018-10-04 12:53:06,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:06,321 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 91 transitions. [2018-10-04 12:53:06,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-04 12:53:06,322 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:06,322 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:06,322 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:06,323 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:06,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1101636687, now seen corresponding path program 1 times [2018-10-04 12:53:06,323 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:06,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:06,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:06,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:06,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:06,413 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-04 12:53:06,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:06,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:53:06,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:06,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:06,417 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:06,417 INFO L87 Difference]: Start difference. First operand 57 states and 91 transitions. Second operand 3 states. [2018-10-04 12:53:06,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:06,903 INFO L93 Difference]: Finished difference Result 119 states and 191 transitions. [2018-10-04 12:53:06,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:06,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-10-04 12:53:06,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:06,905 INFO L225 Difference]: With dead ends: 119 [2018-10-04 12:53:06,905 INFO L226 Difference]: Without dead ends: 63 [2018-10-04 12:53:06,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:06,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-04 12:53:06,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-10-04 12:53:06,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-04 12:53:06,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 97 transitions. [2018-10-04 12:53:06,928 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 97 transitions. Word has length 27 [2018-10-04 12:53:06,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:06,928 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 97 transitions. [2018-10-04 12:53:06,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:06,928 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 97 transitions. [2018-10-04 12:53:06,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:53:06,932 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:06,933 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:06,934 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:06,934 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:06,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1650874841, now seen corresponding path program 1 times [2018-10-04 12:53:06,934 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:06,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:06,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:06,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:06,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:07,007 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-04 12:53:07,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:07,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:53:07,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:07,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:07,009 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:07,009 INFO L87 Difference]: Start difference. First operand 63 states and 97 transitions. Second operand 3 states. [2018-10-04 12:53:07,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:07,201 INFO L93 Difference]: Finished difference Result 130 states and 201 transitions. [2018-10-04 12:53:07,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:07,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 12:53:07,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:07,202 INFO L225 Difference]: With dead ends: 130 [2018-10-04 12:53:07,203 INFO L226 Difference]: Without dead ends: 68 [2018-10-04 12:53:07,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:07,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-04 12:53:07,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-10-04 12:53:07,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-04 12:53:07,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 100 transitions. [2018-10-04 12:53:07,216 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 100 transitions. Word has length 34 [2018-10-04 12:53:07,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:07,216 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 100 transitions. [2018-10-04 12:53:07,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:07,217 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 100 transitions. [2018-10-04 12:53:07,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:53:07,218 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:07,218 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:07,219 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:07,220 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:07,220 INFO L82 PathProgramCache]: Analyzing trace with hash -23931843, now seen corresponding path program 1 times [2018-10-04 12:53:07,220 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:07,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:07,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:07,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:07,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:07,322 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-04 12:53:07,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:07,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:53:07,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:07,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:07,324 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:07,324 INFO L87 Difference]: Start difference. First operand 68 states and 100 transitions. Second operand 3 states. [2018-10-04 12:53:07,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:07,492 INFO L93 Difference]: Finished difference Result 151 states and 224 transitions. [2018-10-04 12:53:07,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:07,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-04 12:53:07,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:07,497 INFO L225 Difference]: With dead ends: 151 [2018-10-04 12:53:07,497 INFO L226 Difference]: Without dead ends: 83 [2018-10-04 12:53:07,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:07,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-04 12:53:07,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-10-04 12:53:07,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-04 12:53:07,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 122 transitions. [2018-10-04 12:53:07,514 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 122 transitions. Word has length 34 [2018-10-04 12:53:07,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:07,514 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 122 transitions. [2018-10-04 12:53:07,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:07,514 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 122 transitions. [2018-10-04 12:53:07,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-04 12:53:07,516 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:07,516 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:07,516 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:07,516 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:07,517 INFO L82 PathProgramCache]: Analyzing trace with hash -870093467, now seen corresponding path program 1 times [2018-10-04 12:53:07,517 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:07,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:07,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:07,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:07,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:07,565 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-04 12:53:07,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:07,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:53:07,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:07,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:07,567 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:07,567 INFO L87 Difference]: Start difference. First operand 83 states and 122 transitions. Second operand 3 states. [2018-10-04 12:53:07,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:07,714 INFO L93 Difference]: Finished difference Result 169 states and 249 transitions. [2018-10-04 12:53:07,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:07,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-10-04 12:53:07,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:07,715 INFO L225 Difference]: With dead ends: 169 [2018-10-04 12:53:07,716 INFO L226 Difference]: Without dead ends: 87 [2018-10-04 12:53:07,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:07,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-04 12:53:07,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-10-04 12:53:07,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-04 12:53:07,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 121 transitions. [2018-10-04 12:53:07,733 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 121 transitions. Word has length 38 [2018-10-04 12:53:07,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:07,733 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 121 transitions. [2018-10-04 12:53:07,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:07,734 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 121 transitions. [2018-10-04 12:53:07,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 12:53:07,735 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:07,736 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:07,736 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:07,736 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:07,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1006859965, now seen corresponding path program 1 times [2018-10-04 12:53:07,736 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:07,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:07,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:07,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:07,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:07,873 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-04 12:53:07,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:07,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:07,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:07,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:07,875 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:07,875 INFO L87 Difference]: Start difference. First operand 87 states and 121 transitions. Second operand 3 states. [2018-10-04 12:53:08,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:08,121 INFO L93 Difference]: Finished difference Result 252 states and 353 transitions. [2018-10-04 12:53:08,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:08,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-04 12:53:08,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:08,128 INFO L225 Difference]: With dead ends: 252 [2018-10-04 12:53:08,128 INFO L226 Difference]: Without dead ends: 166 [2018-10-04 12:53:08,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:08,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-04 12:53:08,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-10-04 12:53:08,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-04 12:53:08,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 230 transitions. [2018-10-04 12:53:08,173 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 230 transitions. Word has length 41 [2018-10-04 12:53:08,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:08,174 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 230 transitions. [2018-10-04 12:53:08,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:08,174 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 230 transitions. [2018-10-04 12:53:08,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 12:53:08,179 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:08,179 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:08,184 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:08,184 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:08,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1429561791, now seen corresponding path program 1 times [2018-10-04 12:53:08,184 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:08,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:08,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:08,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:08,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:08,264 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-04 12:53:08,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:08,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:08,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:08,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:08,267 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:08,267 INFO L87 Difference]: Start difference. First operand 166 states and 230 transitions. Second operand 3 states. [2018-10-04 12:53:08,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:08,494 INFO L93 Difference]: Finished difference Result 240 states and 334 transitions. [2018-10-04 12:53:08,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:08,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-04 12:53:08,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:08,500 INFO L225 Difference]: With dead ends: 240 [2018-10-04 12:53:08,501 INFO L226 Difference]: Without dead ends: 238 [2018-10-04 12:53:08,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:08,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-04 12:53:08,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2018-10-04 12:53:08,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-04 12:53:08,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 330 transitions. [2018-10-04 12:53:08,540 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 330 transitions. Word has length 41 [2018-10-04 12:53:08,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:08,541 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 330 transitions. [2018-10-04 12:53:08,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:08,541 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 330 transitions. [2018-10-04 12:53:08,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-04 12:53:08,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:08,544 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 7, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:08,544 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:08,544 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:08,545 INFO L82 PathProgramCache]: Analyzing trace with hash -159729293, now seen corresponding path program 1 times [2018-10-04 12:53:08,545 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:08,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:08,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:08,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:08,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:08,674 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-10-04 12:53:08,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:08,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:08,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:08,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:08,676 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:08,677 INFO L87 Difference]: Start difference. First operand 237 states and 330 transitions. Second operand 3 states. [2018-10-04 12:53:09,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:09,083 INFO L93 Difference]: Finished difference Result 473 states and 659 transitions. [2018-10-04 12:53:09,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:09,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2018-10-04 12:53:09,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:09,085 INFO L225 Difference]: With dead ends: 473 [2018-10-04 12:53:09,085 INFO L226 Difference]: Without dead ends: 237 [2018-10-04 12:53:09,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:09,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-04 12:53:09,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-10-04 12:53:09,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-04 12:53:09,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 324 transitions. [2018-10-04 12:53:09,121 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 324 transitions. Word has length 91 [2018-10-04 12:53:09,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:09,122 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 324 transitions. [2018-10-04 12:53:09,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:09,122 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 324 transitions. [2018-10-04 12:53:09,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-04 12:53:09,124 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:09,125 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 8, 6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:09,126 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:09,126 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:09,126 INFO L82 PathProgramCache]: Analyzing trace with hash -2023902907, now seen corresponding path program 1 times [2018-10-04 12:53:09,126 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:09,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:09,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:09,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:09,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:09,278 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-10-04 12:53:09,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:09,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:09,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:09,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:09,281 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:09,281 INFO L87 Difference]: Start difference. First operand 237 states and 324 transitions. Second operand 3 states. [2018-10-04 12:53:09,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:09,442 INFO L93 Difference]: Finished difference Result 473 states and 647 transitions. [2018-10-04 12:53:09,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:09,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2018-10-04 12:53:09,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:09,445 INFO L225 Difference]: With dead ends: 473 [2018-10-04 12:53:09,445 INFO L226 Difference]: Without dead ends: 237 [2018-10-04 12:53:09,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:09,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-04 12:53:09,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-10-04 12:53:09,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-04 12:53:09,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 318 transitions. [2018-10-04 12:53:09,473 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 318 transitions. Word has length 100 [2018-10-04 12:53:09,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:09,474 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 318 transitions. [2018-10-04 12:53:09,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:09,474 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 318 transitions. [2018-10-04 12:53:09,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-04 12:53:09,476 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:09,476 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 9, 7, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:09,476 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:09,476 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:09,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1040365903, now seen corresponding path program 1 times [2018-10-04 12:53:09,477 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:09,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:09,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:09,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:09,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:09,613 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-10-04 12:53:09,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:09,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:09,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:09,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:09,615 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:09,615 INFO L87 Difference]: Start difference. First operand 237 states and 318 transitions. Second operand 3 states. [2018-10-04 12:53:09,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:09,824 INFO L93 Difference]: Finished difference Result 500 states and 668 transitions. [2018-10-04 12:53:09,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:09,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2018-10-04 12:53:09,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:09,827 INFO L225 Difference]: With dead ends: 500 [2018-10-04 12:53:09,827 INFO L226 Difference]: Without dead ends: 264 [2018-10-04 12:53:09,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:09,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-10-04 12:53:09,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2018-10-04 12:53:09,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-10-04 12:53:09,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 345 transitions. [2018-10-04 12:53:09,856 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 345 transitions. Word has length 109 [2018-10-04 12:53:09,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:09,857 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 345 transitions. [2018-10-04 12:53:09,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:09,857 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 345 transitions. [2018-10-04 12:53:09,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-04 12:53:09,859 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:09,859 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 10, 8, 6, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:53:09,859 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:09,859 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:09,860 INFO L82 PathProgramCache]: Analyzing trace with hash -2115374141, now seen corresponding path program 1 times [2018-10-04 12:53:09,860 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:09,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:09,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:09,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:09,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:09,999 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-10-04 12:53:10,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:10,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:53:10,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:10,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:10,001 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:10,001 INFO L87 Difference]: Start difference. First operand 264 states and 345 transitions. Second operand 3 states. [2018-10-04 12:53:10,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:10,288 INFO L93 Difference]: Finished difference Result 557 states and 728 transitions. [2018-10-04 12:53:10,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:10,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2018-10-04 12:53:10,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:10,292 INFO L225 Difference]: With dead ends: 557 [2018-10-04 12:53:10,292 INFO L226 Difference]: Without dead ends: 294 [2018-10-04 12:53:10,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:53:10,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-10-04 12:53:10,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2018-10-04 12:53:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-10-04 12:53:10,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 375 transitions. [2018-10-04 12:53:10,324 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 375 transitions. Word has length 118 [2018-10-04 12:53:10,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:10,324 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 375 transitions. [2018-10-04 12:53:10,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:10,325 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 375 transitions. [2018-10-04 12:53:10,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-04 12:53:10,326 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:10,327 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 11, 9, 7, 5, 4, 3, 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] [2018-10-04 12:53:10,327 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:10,327 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:10,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1302152706, now seen corresponding path program 1 times [2018-10-04 12:53:10,328 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:10,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:10,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:10,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:10,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:10,625 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 339 proven. 5 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2018-10-04 12:53:10,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:53:10,625 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:53:10,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:10,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:53:11,522 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 339 proven. 5 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2018-10-04 12:53:11,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:53:11,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:53:11,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:53:11,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:53:11,564 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:11,565 INFO L87 Difference]: Start difference. First operand 294 states and 375 transitions. Second operand 4 states. [2018-10-04 12:53:12,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:12,752 INFO L93 Difference]: Finished difference Result 640 states and 800 transitions. [2018-10-04 12:53:12,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:53:12,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-10-04 12:53:12,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:12,753 INFO L225 Difference]: With dead ends: 640 [2018-10-04 12:53:12,753 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:53:12,754 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.1s impTime 3 [2018-10-04 12:53:12,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:53:12,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:53:12,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:53:12,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:53:12,755 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 128 [2018-10-04 12:53:12,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:12,756 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:53:12,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:53:12,759 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:53:12,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:53:12,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:53:14,373 WARN L178 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 35 DAG size of output: 25 [2018-10-04 12:53:14,662 WARN L178 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 7 [2018-10-04 12:53:15,689 WARN L178 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2018-10-04 12:53:16,047 WARN L178 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 25 [2018-10-04 12:53:16,707 WARN L178 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 22 [2018-10-04 12:53:16,942 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 22 [2018-10-04 12:53:17,067 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-10-04 12:53:17,379 WARN L178 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 25 [2018-10-04 12:53:17,570 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 22 [2018-10-04 12:53:17,679 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2018-10-04 12:53:17,904 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2018-10-04 12:53:17,907 INFO L421 ceAbstractionStarter]: At program point L539(lines 310 539) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse3) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) .cse2))) [2018-10-04 12:53:17,908 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 473) no Hoare annotation was computed. [2018-10-04 12:53:17,908 INFO L421 ceAbstractionStarter]: At program point L354(lines 354 372) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse4 (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) .cse2 .cse3 .cse4))) [2018-10-04 12:53:17,908 INFO L421 ceAbstractionStarter]: At program point L321(lines 279 321) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse3) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) .cse2))) [2018-10-04 12:53:17,908 INFO L421 ceAbstractionStarter]: At program point L350(lines 350 361) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4416 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4528 ULTIMATE.start_ssl3_connect_~s__state~4))) [2018-10-04 12:53:17,908 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 540) no Hoare annotation was computed. [2018-10-04 12:53:17,908 INFO L421 ceAbstractionStarter]: At program point L317(lines 317 339) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse3) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) .cse2))) [2018-10-04 12:53:17,908 INFO L421 ceAbstractionStarter]: At program point L445(lines 445 472) the Hoare annotation is: false [2018-10-04 12:53:17,908 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 540) no Hoare annotation was computed. [2018-10-04 12:53:17,909 INFO L421 ceAbstractionStarter]: At program point L284(lines 284 311) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse3) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) .cse2))) [2018-10-04 12:53:17,909 INFO L421 ceAbstractionStarter]: At program point L474(lines 471 488) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4432 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4416 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse4 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse5 (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse4 .cse5))) [2018-10-04 12:53:17,909 INFO L421 ceAbstractionStarter]: At program point L408(lines 408 430) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4416 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse4 (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse3 .cse4))) [2018-10-04 12:53:17,909 INFO L421 ceAbstractionStarter]: At program point L375(lines 375 405) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)) .cse2 .cse3) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse2 .cse3))) [2018-10-04 12:53:17,909 INFO L421 ceAbstractionStarter]: At program point L342(lines 342 351) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse4 (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) .cse2 .cse4))) [2018-10-04 12:53:17,909 INFO L421 ceAbstractionStarter]: At program point L404(lines 404 419) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4416)) [2018-10-04 12:53:17,909 INFO L421 ceAbstractionStarter]: At program point L371(lines 371 388) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4416 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4528 ULTIMATE.start_ssl3_connect_~s__state~4))) [2018-10-04 12:53:17,910 INFO L421 ceAbstractionStarter]: At program point L433(lines 433 464) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4432 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4416 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse4 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse5 (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse4 .cse5))) [2018-10-04 12:53:17,910 INFO L421 ceAbstractionStarter]: At program point L429(lines 429 446) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) [2018-10-04 12:53:17,910 INFO L421 ceAbstractionStarter]: At program point L396(lines 387 409) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4416 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4528 ULTIMATE.start_ssl3_connect_~s__state~4))) [2018-10-04 12:53:17,910 INFO L421 ceAbstractionStarter]: At program point L421(lines 418 434) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4416)) [2018-10-04 12:53:17,910 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 540) no Hoare annotation was computed. [2018-10-04 12:53:17,910 INFO L421 ceAbstractionStarter]: At program point L513(lines 513 530) the Hoare annotation is: (let ((.cse2 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4432 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse4 (not (= 4416 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse5 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 4528 ULTIMATE.start_ssl3_connect_~s__state~4))) (and .cse0 .cse1 .cse3 .cse4 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse5))) [2018-10-04 12:53:17,910 INFO L421 ceAbstractionStarter]: At program point L365(lines 360 376) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4416 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4528 ULTIMATE.start_ssl3_connect_~s__state~4))) [2018-10-04 12:53:17,910 INFO L421 ceAbstractionStarter]: At program point L493(lines 493 510) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)) (.cse1 (not (= 4400 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4432 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse3 (not (= 4416 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse4 (not (= 4384 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse5 (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)))) (or (and .cse0 .cse1 (not (= 4352 ULTIMATE.start_ssl3_connect_~s__state~4)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) .cse4 .cse5))) [2018-10-04 12:53:17,928 INFO L202 PluginConnector]: Adding new model s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:53:17 BoogieIcfgContainer [2018-10-04 12:53:17,929 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:53:17,930 INFO L168 Benchmark]: Toolchain (without parser) took 14203.63 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 48.2 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 287.2 MB). Peak memory consumption was 335.5 MB. Max. memory is 7.1 GB. [2018-10-04 12:53:17,931 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 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-10-04 12:53:17,932 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.23 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-10-04 12:53:17,933 INFO L168 Benchmark]: Boogie Preprocessor took 43.16 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-10-04 12:53:17,933 INFO L168 Benchmark]: RCFGBuilder took 834.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 12:53:17,935 INFO L168 Benchmark]: TraceAbstraction took 13263.99 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 48.2 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 255.5 MB). Peak memory consumption was 303.8 MB. Max. memory is 7.1 GB. [2018-10-04 12:53:17,940 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 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. * Boogie Procedure Inliner took 57.23 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. * Boogie Preprocessor took 43.16 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. * RCFGBuilder took 834.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13263.99 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 48.2 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 255.5 MB). Peak memory consumption was 303.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 473]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) || (((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 360]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 <= 2 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) && !(4528 == ssl3_connect_~s__state~4) - InvariantResult [Line: 429]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432 - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: ((((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) || ((((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) || ((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4))) || (((ssl3_connect_~blastFlag~4 <= 2 && !(4352 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 284]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) || (((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4))) || (ssl3_connect_~blastFlag~4 <= 2 && !(4352 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) || ((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 <= 4 && !(4352 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) && !(4528 == ssl3_connect_~s__state~4) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) || (((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4))) || (ssl3_connect_~blastFlag~4 <= 2 && !(4352 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 513]: Loop Invariant Derived loop invariant: ((((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) || (((((!(4400 == ssl3_connect_~s__state~4) && !(4352 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4528 == ssl3_connect_~s__state~4))) || (((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) || ((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4))) || ((ssl3_connect_~blastFlag~4 <= 2 && !(4352 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4416 - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 <= 2 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) && !(4528 == ssl3_connect_~s__state~4) - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 <= 2 && !(4352 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) && !(4528 == ssl3_connect_~s__state~4) - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) || (((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4))) || (ssl3_connect_~blastFlag~4 <= 2 && !(4352 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 445]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 433]: Loop Invariant Derived loop invariant: ((((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) || ((((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) || (((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4))) || (ssl3_connect_~blastFlag~4 <= 2 && !(4352 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4416 - InvariantResult [Line: 471]: Loop Invariant Derived loop invariant: ((((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4352 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) || ((((((ssl3_connect_~blastFlag~4 <= 4 && !(4400 == ssl3_connect_~s__state~4)) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && !(4384 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 1 error locations. SAFE Result, 13.1s OverallTime, 14 OverallIterations, 15 TraceHistogramMax, 4.7s AutomataDifference, 0.0s DeadEndRemovalTime, 5.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 358 SDtfs, 175 SDslu, 130 SDs, 0 SdLazy, 432 SolverSat, 127 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 164 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=294occurred in iteration=13, 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: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 367 NumberOfFragments, 731 HoareAnnotationTreeSize, 20 FomulaSimplifications, 9497 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 20 FomulaSimplificationsInter, 1387 FormulaSimplificationTreeSizeReductionInter, 4.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 940 NumberOfCodeBlocks, 940 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 925 ConstructedInterpolants, 0 QuantifiedInterpolants, 105119 SizeOfPredicates, 2 NumberOfNonLiveVariables, 600 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 15 InterpolantComputations, 13 PerfectInterpolantSequences, 3039/3049 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_3.cil.c_21.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-53-17-963.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_3.cil.c_21.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-53-17-963.csv Received shutdown request...