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_2.cil.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:56:00,435 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:56:00,437 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:56:00,448 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:56:00,448 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:56:00,450 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:56:00,452 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:56:00,454 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:56:00,455 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:56:00,456 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:56:00,457 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:56:00,457 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:56:00,458 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:56:00,459 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:56:00,460 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:56:00,464 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:56:00,465 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:56:00,470 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:56:00,475 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:56:00,477 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:56:00,478 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:56:00,479 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:56:00,483 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:56:00,484 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:56:00,484 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:56:00,485 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:56:00,486 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:56:00,489 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:56:00,490 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:56:00,491 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:56:00,491 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:56:00,492 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:56:00,492 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:56:00,495 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:56:00,496 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:56:00,497 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:56:00,497 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-01 00:56:00,514 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:56:00,515 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:56:00,516 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:56:00,516 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:56:00,516 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:56:00,517 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:56:00,517 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:56:00,517 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:56:00,517 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:56:00,518 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:56:00,518 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:56:00,518 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:56:00,518 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:56:00,518 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:56:00,518 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:56:00,519 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:56:00,519 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:56:00,519 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:56:00,519 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:56:00,519 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:56:00,520 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:56:00,520 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:56:00,520 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:56:00,520 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:56:00,520 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:56:00,521 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:56:00,521 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:56:00,521 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:56:00,521 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:56:00,521 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:56:00,521 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:56:00,585 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:56:00,598 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:56:00,606 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:56:00,608 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:56:00,609 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:56:00,609 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_2.cil.c_21.bpl [2018-10-01 00:56:00,610 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_2.cil.c_21.bpl' [2018-10-01 00:56:00,697 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:56:00,701 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:56:00,702 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:56:00,702 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:56:00,702 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:56:00,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:56:00" (1/1) ... [2018-10-01 00:56:00,744 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:56:00" (1/1) ... [2018-10-01 00:56:00,761 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:56:00,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:56:00,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:56:00,762 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:56:00,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:56:00" (1/1) ... [2018-10-01 00:56:00,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:56:00" (1/1) ... [2018-10-01 00:56:00,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:56:00" (1/1) ... [2018-10-01 00:56:00,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:56:00" (1/1) ... [2018-10-01 00:56:00,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:56:00" (1/1) ... [2018-10-01 00:56:00,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:56:00" (1/1) ... [2018-10-01 00:56:00,819 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:56:00" (1/1) ... [2018-10-01 00:56:00,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:56:00,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:56:00,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:56:00,834 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:56:00,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:56:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:56:00,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 00:56:00,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 00:56:01,630 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 00:56:01,631 INFO L202 PluginConnector]: Adding new model s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:56:01 BoogieIcfgContainer [2018-10-01 00:56:01,631 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:56:01,632 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:56:01,632 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:56:01,635 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:56:01,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:56:00" (1/2) ... [2018-10-01 00:56:01,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@108d3607 and model type s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:56:01, skipping insertion in model container [2018-10-01 00:56:01,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:56:01" (2/2) ... [2018-10-01 00:56:01,639 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.cil.c_21.bpl [2018-10-01 00:56:01,648 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:56:01,659 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:56:01,706 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:56:01,707 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:56:01,707 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:56:01,707 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:56:01,707 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:56:01,708 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:56:01,708 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:56:01,708 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:56:01,708 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:56:01,725 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-10-01 00:56:01,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 00:56:01,732 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:01,733 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:01,734 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:01,741 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:01,741 INFO L82 PathProgramCache]: Analyzing trace with hash 2097985007, now seen corresponding path program 1 times [2018-10-01 00:56:01,743 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:01,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:01,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:01,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:01,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:01,962 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-01 00:56:01,964 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:01,965 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:56:01,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:01,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:01,983 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:01,985 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2018-10-01 00:56:02,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:02,459 INFO L93 Difference]: Finished difference Result 49 states and 80 transitions. [2018-10-01 00:56:02,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:02,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-01 00:56:02,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:02,476 INFO L225 Difference]: With dead ends: 49 [2018-10-01 00:56:02,476 INFO L226 Difference]: Without dead ends: 26 [2018-10-01 00:56:02,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:02,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-01 00:56:02,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-01 00:56:02,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-01 00:56:02,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2018-10-01 00:56:02,523 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 40 transitions. Word has length 10 [2018-10-01 00:56:02,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:02,524 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 40 transitions. [2018-10-01 00:56:02,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:02,524 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 40 transitions. [2018-10-01 00:56:02,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 00:56:02,525 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:02,525 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:02,526 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:02,526 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:02,526 INFO L82 PathProgramCache]: Analyzing trace with hash -509365433, now seen corresponding path program 1 times [2018-10-01 00:56:02,526 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:02,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:02,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:02,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:02,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:02,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:56:02,646 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:02,646 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:02,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:02,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:02,648 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:02,648 INFO L87 Difference]: Start difference. First operand 26 states and 40 transitions. Second operand 3 states. [2018-10-01 00:56:03,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:03,038 INFO L93 Difference]: Finished difference Result 53 states and 83 transitions. [2018-10-01 00:56:03,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:03,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-10-01 00:56:03,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:03,043 INFO L225 Difference]: With dead ends: 53 [2018-10-01 00:56:03,043 INFO L226 Difference]: Without dead ends: 30 [2018-10-01 00:56:03,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:03,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-01 00:56:03,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-01 00:56:03,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-01 00:56:03,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2018-10-01 00:56:03,060 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 44 transitions. Word has length 13 [2018-10-01 00:56:03,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:03,063 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 44 transitions. [2018-10-01 00:56:03,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:03,063 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 44 transitions. [2018-10-01 00:56:03,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-01 00:56:03,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:03,064 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:03,064 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:03,064 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:03,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1912029775, now seen corresponding path program 1 times [2018-10-01 00:56:03,065 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:03,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:03,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:03,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:03,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:03,182 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-01 00:56:03,182 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:03,182 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:03,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:03,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:03,183 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:03,183 INFO L87 Difference]: Start difference. First operand 30 states and 44 transitions. Second operand 3 states. [2018-10-01 00:56:03,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:03,780 INFO L93 Difference]: Finished difference Result 62 states and 93 transitions. [2018-10-01 00:56:03,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:03,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-01 00:56:03,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:03,782 INFO L225 Difference]: With dead ends: 62 [2018-10-01 00:56:03,782 INFO L226 Difference]: Without dead ends: 35 [2018-10-01 00:56:03,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:03,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-01 00:56:03,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-01 00:56:03,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-01 00:56:03,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-10-01 00:56:03,791 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 19 [2018-10-01 00:56:03,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:03,791 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-10-01 00:56:03,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:03,792 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-10-01 00:56:03,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-01 00:56:03,792 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:03,793 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:03,793 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:03,793 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:03,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1719277757, now seen corresponding path program 1 times [2018-10-01 00:56:03,794 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:03,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:03,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:03,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:03,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:03,892 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-01 00:56:03,893 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:03,893 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:03,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:03,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:03,894 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:03,894 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-10-01 00:56:04,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:04,255 INFO L93 Difference]: Finished difference Result 73 states and 105 transitions. [2018-10-01 00:56:04,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:04,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-01 00:56:04,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:04,258 INFO L225 Difference]: With dead ends: 73 [2018-10-01 00:56:04,258 INFO L226 Difference]: Without dead ends: 41 [2018-10-01 00:56:04,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:04,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-01 00:56:04,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-01 00:56:04,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-01 00:56:04,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2018-10-01 00:56:04,267 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 55 transitions. Word has length 26 [2018-10-01 00:56:04,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:04,267 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 55 transitions. [2018-10-01 00:56:04,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:04,267 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2018-10-01 00:56:04,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 00:56:04,269 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:04,269 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:04,269 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:04,269 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:04,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1612801811, now seen corresponding path program 1 times [2018-10-01 00:56:04,270 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:04,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:04,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:04,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:04,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:04,353 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-01 00:56:04,354 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:04,354 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:04,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:04,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:04,355 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:04,355 INFO L87 Difference]: Start difference. First operand 41 states and 55 transitions. Second operand 3 states. [2018-10-01 00:56:04,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:04,577 INFO L93 Difference]: Finished difference Result 86 states and 119 transitions. [2018-10-01 00:56:04,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:04,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-01 00:56:04,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:04,580 INFO L225 Difference]: With dead ends: 86 [2018-10-01 00:56:04,580 INFO L226 Difference]: Without dead ends: 48 [2018-10-01 00:56:04,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:04,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-01 00:56:04,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-10-01 00:56:04,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-01 00:56:04,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2018-10-01 00:56:04,590 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 34 [2018-10-01 00:56:04,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:04,591 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2018-10-01 00:56:04,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:04,591 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2018-10-01 00:56:04,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-01 00:56:04,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:04,592 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, 1, 1] [2018-10-01 00:56:04,593 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:04,593 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:04,593 INFO L82 PathProgramCache]: Analyzing trace with hash -168763707, now seen corresponding path program 1 times [2018-10-01 00:56:04,593 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:04,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:04,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:04,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:04,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:04,733 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-01 00:56:04,734 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:04,734 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:04,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:04,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:04,735 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:04,735 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand 3 states. [2018-10-01 00:56:04,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:04,965 INFO L93 Difference]: Finished difference Result 136 states and 179 transitions. [2018-10-01 00:56:04,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:04,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-10-01 00:56:04,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:04,970 INFO L225 Difference]: With dead ends: 136 [2018-10-01 00:56:04,971 INFO L226 Difference]: Without dead ends: 91 [2018-10-01 00:56:04,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:04,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-01 00:56:04,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-10-01 00:56:04,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-01 00:56:04,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2018-10-01 00:56:04,994 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 117 transitions. Word has length 43 [2018-10-01 00:56:04,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:04,994 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 117 transitions. [2018-10-01 00:56:04,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:04,994 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2018-10-01 00:56:04,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-01 00:56:04,997 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:04,997 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, 1, 1] [2018-10-01 00:56:04,997 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:04,998 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:04,998 INFO L82 PathProgramCache]: Analyzing trace with hash 253938119, now seen corresponding path program 1 times [2018-10-01 00:56:04,998 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:04,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:04,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:05,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:05,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:05,151 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-01 00:56:05,152 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:05,152 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:05,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:05,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:05,153 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:05,153 INFO L87 Difference]: Start difference. First operand 91 states and 117 transitions. Second operand 3 states. [2018-10-01 00:56:05,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:05,269 INFO L93 Difference]: Finished difference Result 188 states and 241 transitions. [2018-10-01 00:56:05,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:05,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-10-01 00:56:05,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:05,271 INFO L225 Difference]: With dead ends: 188 [2018-10-01 00:56:05,271 INFO L226 Difference]: Without dead ends: 100 [2018-10-01 00:56:05,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:05,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-01 00:56:05,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-10-01 00:56:05,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-01 00:56:05,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 126 transitions. [2018-10-01 00:56:05,285 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 126 transitions. Word has length 43 [2018-10-01 00:56:05,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:05,286 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 126 transitions. [2018-10-01 00:56:05,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:05,286 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 126 transitions. [2018-10-01 00:56:05,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-01 00:56:05,287 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:05,287 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, 1, 1] [2018-10-01 00:56:05,288 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:05,288 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:05,288 INFO L82 PathProgramCache]: Analyzing trace with hash -4227319, now seen corresponding path program 1 times [2018-10-01 00:56:05,288 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:05,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:05,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:05,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:05,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:05,370 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-01 00:56:05,370 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:05,370 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:05,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:05,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:05,372 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:05,372 INFO L87 Difference]: Start difference. First operand 100 states and 126 transitions. Second operand 3 states. [2018-10-01 00:56:05,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:05,489 INFO L93 Difference]: Finished difference Result 139 states and 179 transitions. [2018-10-01 00:56:05,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:05,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-10-01 00:56:05,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:05,495 INFO L225 Difference]: With dead ends: 139 [2018-10-01 00:56:05,495 INFO L226 Difference]: Without dead ends: 137 [2018-10-01 00:56:05,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:05,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-01 00:56:05,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 132. [2018-10-01 00:56:05,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-01 00:56:05,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 171 transitions. [2018-10-01 00:56:05,517 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 171 transitions. Word has length 43 [2018-10-01 00:56:05,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:05,517 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 171 transitions. [2018-10-01 00:56:05,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:05,517 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 171 transitions. [2018-10-01 00:56:05,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-01 00:56:05,519 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:05,519 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 7, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:05,520 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:05,520 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:05,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1562207431, now seen corresponding path program 1 times [2018-10-01 00:56:05,520 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:05,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:05,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:05,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:05,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:05,599 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-01 00:56:05,599 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:05,599 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:05,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:05,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:05,600 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:05,600 INFO L87 Difference]: Start difference. First operand 132 states and 171 transitions. Second operand 3 states. [2018-10-01 00:56:05,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:05,827 INFO L93 Difference]: Finished difference Result 297 states and 405 transitions. [2018-10-01 00:56:05,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:05,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-10-01 00:56:05,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:05,830 INFO L225 Difference]: With dead ends: 297 [2018-10-01 00:56:05,830 INFO L226 Difference]: Without dead ends: 168 [2018-10-01 00:56:05,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:05,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-10-01 00:56:05,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-10-01 00:56:05,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-10-01 00:56:05,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 222 transitions. [2018-10-01 00:56:05,852 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 222 transitions. Word has length 73 [2018-10-01 00:56:05,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:05,852 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 222 transitions. [2018-10-01 00:56:05,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:05,852 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 222 transitions. [2018-10-01 00:56:05,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-01 00:56:05,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:05,855 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 9, 7, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:05,855 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:05,855 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:05,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1926453931, now seen corresponding path program 2 times [2018-10-01 00:56:05,856 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:05,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:05,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:05,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:05,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:05,991 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-01 00:56:05,991 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:05,991 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:05,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:05,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:05,992 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:05,993 INFO L87 Difference]: Start difference. First operand 168 states and 222 transitions. Second operand 3 states. [2018-10-01 00:56:06,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:06,630 INFO L93 Difference]: Finished difference Result 405 states and 558 transitions. [2018-10-01 00:56:06,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:06,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2018-10-01 00:56:06,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:06,632 INFO L225 Difference]: With dead ends: 405 [2018-10-01 00:56:06,632 INFO L226 Difference]: Without dead ends: 228 [2018-10-01 00:56:06,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:06,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-10-01 00:56:06,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-10-01 00:56:06,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-10-01 00:56:06,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 297 transitions. [2018-10-01 00:56:06,659 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 297 transitions. Word has length 76 [2018-10-01 00:56:06,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:06,659 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 297 transitions. [2018-10-01 00:56:06,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:06,660 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 297 transitions. [2018-10-01 00:56:06,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-01 00:56:06,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:06,662 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:06,662 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:06,662 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:06,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1254900833, now seen corresponding path program 1 times [2018-10-01 00:56:06,663 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:06,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:06,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:06,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:56:06,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:06,792 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-10-01 00:56:06,793 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:06,793 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:06,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:06,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:06,794 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:06,794 INFO L87 Difference]: Start difference. First operand 228 states and 297 transitions. Second operand 3 states. [2018-10-01 00:56:07,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:07,584 INFO L93 Difference]: Finished difference Result 489 states and 642 transitions. [2018-10-01 00:56:07,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:07,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-10-01 00:56:07,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:07,587 INFO L225 Difference]: With dead ends: 489 [2018-10-01 00:56:07,587 INFO L226 Difference]: Without dead ends: 255 [2018-10-01 00:56:07,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:07,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-10-01 00:56:07,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-10-01 00:56:07,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-01 00:56:07,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 327 transitions. [2018-10-01 00:56:07,609 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 327 transitions. Word has length 85 [2018-10-01 00:56:07,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:07,609 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 327 transitions. [2018-10-01 00:56:07,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:07,610 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 327 transitions. [2018-10-01 00:56:07,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-01 00:56:07,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:07,612 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 11, 9, 7, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:07,612 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:07,612 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:07,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1359801879, now seen corresponding path program 1 times [2018-10-01 00:56:07,612 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:07,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:07,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:07,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:07,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:07,732 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-01 00:56:07,733 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:07,733 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:07,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:07,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:07,734 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:07,734 INFO L87 Difference]: Start difference. First operand 255 states and 327 transitions. Second operand 3 states. [2018-10-01 00:56:08,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:08,823 INFO L93 Difference]: Finished difference Result 543 states and 702 transitions. [2018-10-01 00:56:08,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:08,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2018-10-01 00:56:08,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:08,825 INFO L225 Difference]: With dead ends: 543 [2018-10-01 00:56:08,825 INFO L226 Difference]: Without dead ends: 285 [2018-10-01 00:56:08,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:08,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-10-01 00:56:08,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-10-01 00:56:08,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-10-01 00:56:08,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 363 transitions. [2018-10-01 00:56:08,847 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 363 transitions. Word has length 94 [2018-10-01 00:56:08,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:08,848 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 363 transitions. [2018-10-01 00:56:08,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:08,848 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 363 transitions. [2018-10-01 00:56:08,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-01 00:56:08,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:08,850 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 12, 10, 8, 6, 4, 2, 2, 2, 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-01 00:56:08,850 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:08,850 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:08,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1195726822, now seen corresponding path program 1 times [2018-10-01 00:56:08,851 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:08,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:08,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:08,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:08,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:08,976 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-10-01 00:56:08,977 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:08,977 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:08,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:08,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:08,978 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:08,978 INFO L87 Difference]: Start difference. First operand 285 states and 363 transitions. Second operand 3 states. [2018-10-01 00:56:09,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:09,707 INFO L93 Difference]: Finished difference Result 603 states and 774 transitions. [2018-10-01 00:56:09,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:09,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-10-01 00:56:09,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:09,731 INFO L225 Difference]: With dead ends: 603 [2018-10-01 00:56:09,731 INFO L226 Difference]: Without dead ends: 318 [2018-10-01 00:56:09,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:09,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-10-01 00:56:09,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-10-01 00:56:09,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-10-01 00:56:09,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 405 transitions. [2018-10-01 00:56:09,756 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 405 transitions. Word has length 104 [2018-10-01 00:56:09,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:09,757 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 405 transitions. [2018-10-01 00:56:09,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:09,757 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 405 transitions. [2018-10-01 00:56:09,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-01 00:56:09,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:09,759 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 13, 11, 9, 7, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:09,760 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:09,760 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:09,760 INFO L82 PathProgramCache]: Analyzing trace with hash -32649186, now seen corresponding path program 1 times [2018-10-01 00:56:09,760 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:09,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:09,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:09,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:09,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:09,892 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-10-01 00:56:09,893 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:09,893 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:09,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:09,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:09,894 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:09,894 INFO L87 Difference]: Start difference. First operand 318 states and 405 transitions. Second operand 3 states. [2018-10-01 00:56:10,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:10,456 INFO L93 Difference]: Finished difference Result 633 states and 807 transitions. [2018-10-01 00:56:10,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:10,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2018-10-01 00:56:10,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:10,459 INFO L225 Difference]: With dead ends: 633 [2018-10-01 00:56:10,459 INFO L226 Difference]: Without dead ends: 318 [2018-10-01 00:56:10,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:10,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-10-01 00:56:10,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-10-01 00:56:10,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-10-01 00:56:10,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 402 transitions. [2018-10-01 00:56:10,483 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 402 transitions. Word has length 115 [2018-10-01 00:56:10,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:10,483 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 402 transitions. [2018-10-01 00:56:10,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:10,483 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 402 transitions. [2018-10-01 00:56:10,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-01 00:56:10,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:10,485 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 12, 10, 8, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:10,486 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:10,486 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:10,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1066373693, now seen corresponding path program 1 times [2018-10-01 00:56:10,486 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:10,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:10,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:10,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:10,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:10,622 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-10-01 00:56:10,622 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:56:10,622 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:56:10,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:56:10,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:56:10,623 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:10,623 INFO L87 Difference]: Start difference. First operand 318 states and 402 transitions. Second operand 3 states. [2018-10-01 00:56:11,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:11,745 INFO L93 Difference]: Finished difference Result 633 states and 801 transitions. [2018-10-01 00:56:11,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:56:11,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2018-10-01 00:56:11,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:11,749 INFO L225 Difference]: With dead ends: 633 [2018-10-01 00:56:11,749 INFO L226 Difference]: Without dead ends: 318 [2018-10-01 00:56:11,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:56:11,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-10-01 00:56:11,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-10-01 00:56:11,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-10-01 00:56:11,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 387 transitions. [2018-10-01 00:56:11,774 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 387 transitions. Word has length 124 [2018-10-01 00:56:11,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:11,774 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 387 transitions. [2018-10-01 00:56:11,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:56:11,774 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 387 transitions. [2018-10-01 00:56:11,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-01 00:56:11,776 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:11,776 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 13, 11, 9, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:11,777 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:11,777 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:11,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1427413192, now seen corresponding path program 1 times [2018-10-01 00:56:11,777 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:11,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:11,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:11,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:11,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:11,916 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 385 proven. 4 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-10-01 00:56:11,917 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:56:11,917 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-01 00:56:11,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:12,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:56:12,711 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 385 proven. 4 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-10-01 00:56:12,744 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:56:12,744 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-01 00:56:12,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:56:12,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:56:12,745 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:12,746 INFO L87 Difference]: Start difference. First operand 318 states and 387 transitions. Second operand 4 states. [2018-10-01 00:56:14,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:14,176 INFO L93 Difference]: Finished difference Result 757 states and 914 transitions. [2018-10-01 00:56:14,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:56:14,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2018-10-01 00:56:14,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:14,179 INFO L225 Difference]: With dead ends: 757 [2018-10-01 00:56:14,179 INFO L226 Difference]: Without dead ends: 415 [2018-10-01 00:56:14,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:56:14,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-10-01 00:56:14,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 255. [2018-10-01 00:56:14,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-01 00:56:14,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 291 transitions. [2018-10-01 00:56:14,216 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 291 transitions. Word has length 136 [2018-10-01 00:56:14,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:14,216 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 291 transitions. [2018-10-01 00:56:14,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:56:14,216 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 291 transitions. [2018-10-01 00:56:14,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-01 00:56:14,218 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:56:14,218 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 15, 13, 11, 9, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-01 00:56:14,218 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:56:14,219 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:56:14,219 INFO L82 PathProgramCache]: Analyzing trace with hash 2065701642, now seen corresponding path program 2 times [2018-10-01 00:56:14,219 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:56:14,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:56:14,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:14,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:56:14,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:56:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:56:14,457 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 417 proven. 3 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2018-10-01 00:56:14,458 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:56:14,458 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:56:14,471 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:56:14,608 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:56:14,608 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:56:14,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:56:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 417 proven. 3 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2018-10-01 00:56:15,033 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:56:15,034 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-01 00:56:15,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:56:15,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:56:15,035 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:56:15,035 INFO L87 Difference]: Start difference. First operand 255 states and 291 transitions. Second operand 4 states. [2018-10-01 00:56:16,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:56:16,428 INFO L93 Difference]: Finished difference Result 429 states and 487 transitions. [2018-10-01 00:56:16,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:56:16,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-10-01 00:56:16,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:56:16,429 INFO L225 Difference]: With dead ends: 429 [2018-10-01 00:56:16,429 INFO L226 Difference]: Without dead ends: 0 [2018-10-01 00:56:16,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:56:16,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-01 00:56:16,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-01 00:56:16,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-01 00:56:16,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-01 00:56:16,431 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 139 [2018-10-01 00:56:16,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:56:16,431 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-01 00:56:16,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:56:16,432 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-01 00:56:16,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-01 00:56:16,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-01 00:56:16,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:16,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-01 00:56:17,019 WARN L178 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 7 [2018-10-01 00:56:18,189 WARN L178 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2018-10-01 00:56:18,623 WARN L178 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2018-10-01 00:56:18,919 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2018-10-01 00:56:19,820 WARN L178 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2018-10-01 00:56:20,687 WARN L178 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2018-10-01 00:56:20,831 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 11 [2018-10-01 00:56:21,282 WARN L178 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2018-10-01 00:56:21,425 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2018-10-01 00:56:21,444 INFO L422 ceAbstractionStarter]: At program point L415(lines 415 432) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4432) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-10-01 00:56:21,444 INFO L422 ceAbstractionStarter]: At program point L382(lines 373 395) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) .cse0) (and .cse0 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)))) [2018-10-01 00:56:21,444 INFO L422 ceAbstractionStarter]: At program point L407(lines 404 420) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4416)) [2018-10-01 00:56:21,444 INFO L422 ceAbstractionStarter]: At program point L300(lines 261 300) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560)) (.cse3 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4)) (.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2)) (.cse4 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 12292)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4368)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4560) .cse3 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 .cse4))) [2018-10-01 00:56:21,445 INFO L422 ceAbstractionStarter]: At program point L296(lines 296 310) the Hoare annotation is: (let ((.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4368)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse2 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse1) (and .cse0 .cse2))) [2018-10-01 00:56:21,445 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 526) no Hoare annotation was computed. [2018-10-01 00:56:21,445 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 526) no Hoare annotation was computed. [2018-10-01 00:56:21,445 INFO L422 ceAbstractionStarter]: At program point L313(lines 313 333) the Hoare annotation is: (let ((.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse2 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse1) (and .cse0 .cse2))) [2018-10-01 00:56:21,445 INFO L422 ceAbstractionStarter]: At program point L309(lines 309 320) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368)) [2018-10-01 00:56:21,445 INFO L422 ceAbstractionStarter]: At program point L499(lines 499 516) the Hoare annotation is: (let ((.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4))) (or (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) .cse1) (and .cse0 .cse1 .cse2))) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse2))) [2018-10-01 00:56:21,446 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 526) no Hoare annotation was computed. [2018-10-01 00:56:21,446 INFO L422 ceAbstractionStarter]: At program point L351(lines 348 362) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) [2018-10-01 00:56:21,446 INFO L422 ceAbstractionStarter]: At program point L479(lines 479 496) the Hoare annotation is: (let ((.cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) .cse0) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse1))) [2018-10-01 00:56:21,446 INFO L422 ceAbstractionStarter]: At program point L525(lines 289 525) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560)) (.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2)) (.cse3 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4368)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4560) (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse2) (and .cse3 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 .cse3))) [2018-10-01 00:56:21,446 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 459) no Hoare annotation was computed. [2018-10-01 00:56:21,446 INFO L422 ceAbstractionStarter]: At program point L336(lines 336 358) the Hoare annotation is: (let ((.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse2 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse1) (and .cse0 .cse2))) [2018-10-01 00:56:21,446 INFO L422 ceAbstractionStarter]: At program point L431(lines 431 458) the Hoare annotation is: false [2018-10-01 00:56:21,446 INFO L422 ceAbstractionStarter]: At program point L332(lines 332 349) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) [2018-10-01 00:56:21,447 INFO L422 ceAbstractionStarter]: At program point L460(lines 457 474) the Hoare annotation is: (let ((.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) .cse0) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4448)))) [2018-10-01 00:56:21,447 INFO L422 ceAbstractionStarter]: At program point L266(lines 266 290) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560)) (.cse3 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4)) (.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2)) (.cse4 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 12292)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4368)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4560) .cse3 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 .cse4))) [2018-10-01 00:56:21,447 INFO L422 ceAbstractionStarter]: At program point L394(lines 394 416) the Hoare annotation is: (let ((.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse0))) [2018-10-01 00:56:21,447 INFO L422 ceAbstractionStarter]: At program point L361(lines 361 391) the Hoare annotation is: (let ((.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse1 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse1 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse0) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) .cse1))) [2018-10-01 00:56:21,447 INFO L422 ceAbstractionStarter]: At program point L390(lines 390 405) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) .cse0))) [2018-10-01 00:56:21,447 INFO L422 ceAbstractionStarter]: At program point L357(lines 357 374) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) [2018-10-01 00:56:21,447 INFO L422 ceAbstractionStarter]: At program point L324(lines 319 337) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368)) [2018-10-01 00:56:21,447 INFO L422 ceAbstractionStarter]: At program point L419(lines 419 450) the Hoare annotation is: (let ((.cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) .cse0) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4432) .cse0) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse1))) [2018-10-01 00:56:21,465 INFO L202 PluginConnector]: Adding new model s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:56:21 BoogieIcfgContainer [2018-10-01 00:56:21,466 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:56:21,467 INFO L168 Benchmark]: Toolchain (without parser) took 20768.45 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 104.9 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 43.3 MB). Peak memory consumption was 586.3 MB. Max. memory is 7.1 GB. [2018-10-01 00:56:21,468 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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-01 00:56:21,469 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.61 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-01 00:56:21,470 INFO L168 Benchmark]: Boogie Preprocessor took 68.85 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-01 00:56:21,470 INFO L168 Benchmark]: RCFGBuilder took 799.68 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-01 00:56:21,472 INFO L168 Benchmark]: TraceAbstraction took 19833.92 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 104.9 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 11.6 MB). Peak memory consumption was 554.6 MB. Max. memory is 7.1 GB. [2018-10-01 00:56:21,477 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.21 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 59.61 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 68.85 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 799.68 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 19833.92 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 104.9 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 11.6 MB). Peak memory consumption was 554.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 459]: 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: 319]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4368 - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: (((((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 419]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~s__state~4 <= 4432 && 4432 <= ssl3_connect_~s__state~4)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: ((((((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4368)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && ssl3_connect_~s__state~4 <= 4560) && 4560 <= ssl3_connect_~s__state~4) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4416 - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4384 - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (4432 <= ssl3_connect_~s__state~4 && ssl3_connect_~s__state~4 <= 4448) - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: ((((((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4368)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4368 - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: (((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) - InvariantResult [Line: 348]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4384 - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: (ssl3_connect_~s__state~4 <= 4432 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 479]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || (4432 <= ssl3_connect_~s__state~4 && ssl3_connect_~s__state~4 <= 4480)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: ((((((((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 12292)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4368)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && ssl3_connect_~s__state~4 <= 4560) && 4560 <= ssl3_connect_~s__state~4) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || ((ssl3_connect_~blastFlag~4 <= 2 && 4560 <= ssl3_connect_~s__state~4) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400) || (ssl3_connect_~s__state~4 == 4400 && ssl3_connect_~blastFlag~4 == 3) - InvariantResult [Line: 499]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || ((ssl3_connect_~s__state~4 <= 4528 && 4432 <= ssl3_connect_~s__state~4) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (4432 <= ssl3_connect_~s__state~4 && ssl3_connect_~s__state~4 <= 4512)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: ((((((((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 12292)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4368)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && ssl3_connect_~s__state~4 <= 4560) && 4560 <= ssl3_connect_~s__state~4) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || ((ssl3_connect_~blastFlag~4 <= 2 && 4560 <= ssl3_connect_~s__state~4) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: ((((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 357]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400 - InvariantResult [Line: 431]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 26 locations, 1 error locations. SAFE Result, 19.7s OverallTime, 17 OverallIterations, 17 TraceHistogramMax, 10.6s AutomataDifference, 0.0s DeadEndRemovalTime, 5.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 545 SDtfs, 240 SDslu, 220 SDs, 0 SdLazy, 533 SolverSat, 139 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 327 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=318occurred 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, 17 MinimizatonAttempts, 165 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 253 NumberOfFragments, 713 HoareAnnotationTreeSize, 22 FomulaSimplifications, 6566 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 22 FomulaSimplificationsInter, 1150 FormulaSimplificationTreeSizeReductionInter, 4.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1452 NumberOfCodeBlocks, 1452 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1433 ConstructedInterpolants, 0 QuantifiedInterpolants, 173573 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1255 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 5594/5608 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_2.cil.c_21.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-56-21-497.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_2.cil.c_21.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_00-56-21-497.csv Received shutdown request...