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.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_2.cil.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 20:20:05,975 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:20:05,977 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:20:05,994 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:20:05,995 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:20:05,995 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:20:05,999 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:20:06,001 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:20:06,003 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:20:06,004 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:20:06,006 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:20:06,007 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:20:06,008 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:20:06,009 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:20:06,010 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:20:06,011 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:20:06,012 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:20:06,014 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:20:06,017 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:20:06,022 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:20:06,026 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:20:06,030 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:20:06,034 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:20:06,035 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:20:06,035 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:20:06,036 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:20:06,040 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:20:06,041 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:20:06,043 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:20:06,044 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:20:06,044 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:20:06,047 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:20:06,047 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:20:06,047 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:20:06,048 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:20:06,049 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:20:06,049 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 20:20:06,072 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:20:06,072 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:20:06,073 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:20:06,073 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:20:06,074 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:20:06,074 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:20:06,074 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:20:06,074 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:20:06,074 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:20:06,075 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:20:06,075 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:20:06,075 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:20:06,075 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:20:06,075 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:20:06,076 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:20:06,076 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:20:06,076 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:20:06,076 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:20:06,076 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:20:06,076 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:20:06,077 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:20:06,077 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:20:06,077 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:20:06,077 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:20:06,077 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:20:06,078 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:20:06,078 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:20:06,078 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:20:06,078 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:20:06,078 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:20:06,128 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:20:06,145 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:20:06,154 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:20:06,156 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:20:06,156 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:20:06,157 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-09-30 20:20:06,157 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_2.cil.c_21.bpl' [2018-09-30 20:20:06,263 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:20:06,266 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:20:06,267 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:20:06,267 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:20:06,267 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:20:06,291 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 30.09 08:20:06" (1/1) ... [2018-09-30 20:20:06,309 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 30.09 08:20:06" (1/1) ... [2018-09-30 20:20:06,327 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:20:06,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:20:06,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:20:06,329 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:20:06,340 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 30.09 08:20:06" (1/1) ... [2018-09-30 20:20:06,340 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 30.09 08:20:06" (1/1) ... [2018-09-30 20:20:06,346 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 30.09 08:20:06" (1/1) ... [2018-09-30 20:20:06,353 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 30.09 08:20:06" (1/1) ... [2018-09-30 20:20:06,372 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 30.09 08:20:06" (1/1) ... [2018-09-30 20:20:06,381 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 30.09 08:20:06" (1/1) ... [2018-09-30 20:20:06,385 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 30.09 08:20:06" (1/1) ... [2018-09-30 20:20:06,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:20:06,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:20:06,395 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:20:06,395 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:20:06,396 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 30.09 08:20:06" (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-09-30 20:20:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 20:20:06,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 20:20:07,195 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 20:20:07,196 INFO L202 PluginConnector]: Adding new model s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:20:07 BoogieIcfgContainer [2018-09-30 20:20:07,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:20:07,197 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:20:07,198 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:20:07,201 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:20:07,201 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 30.09 08:20:06" (1/2) ... [2018-09-30 20:20:07,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd771ba and model type s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:20:07, skipping insertion in model container [2018-09-30 20:20:07,202 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 30.09 08:20:07" (2/2) ... [2018-09-30 20:20:07,204 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.cil.c_21.bpl [2018-09-30 20:20:07,214 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:20:07,223 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 20:20:07,276 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:20:07,277 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:20:07,277 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:20:07,277 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:20:07,278 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:20:07,278 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:20:07,278 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:20:07,278 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:20:07,278 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:20:07,295 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-09-30 20:20:07,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 20:20:07,302 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:20:07,303 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:20:07,304 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:20:07,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:20:07,311 INFO L82 PathProgramCache]: Analyzing trace with hash 2097985007, now seen corresponding path program 1 times [2018-09-30 20:20:07,313 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:20:07,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:20:07,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:07,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:20:07,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:20:07,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:20:07,552 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:20:07,553 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:20:07,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:20:07,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:20:07,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:07,572 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2018-09-30 20:20:07,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:20:07,862 INFO L93 Difference]: Finished difference Result 49 states and 80 transitions. [2018-09-30 20:20:07,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:20:07,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-09-30 20:20:07,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:20:07,876 INFO L225 Difference]: With dead ends: 49 [2018-09-30 20:20:07,876 INFO L226 Difference]: Without dead ends: 26 [2018-09-30 20:20:07,881 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:07,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-30 20:20:07,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-30 20:20:07,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-30 20:20:07,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2018-09-30 20:20:07,921 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 40 transitions. Word has length 10 [2018-09-30 20:20:07,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:20:07,922 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 40 transitions. [2018-09-30 20:20:07,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:20:07,922 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 40 transitions. [2018-09-30 20:20:07,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:20:07,923 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:20:07,923 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:20:07,923 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:20:07,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:20:07,924 INFO L82 PathProgramCache]: Analyzing trace with hash -509365433, now seen corresponding path program 1 times [2018-09-30 20:20:07,924 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:20:07,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:20:07,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:07,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:20:07,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:20:08,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:20:08,007 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:20:08,008 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:20:08,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:20:08,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:20:08,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:08,010 INFO L87 Difference]: Start difference. First operand 26 states and 40 transitions. Second operand 3 states. [2018-09-30 20:20:08,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:20:08,292 INFO L93 Difference]: Finished difference Result 53 states and 83 transitions. [2018-09-30 20:20:08,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:20:08,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-09-30 20:20:08,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:20:08,295 INFO L225 Difference]: With dead ends: 53 [2018-09-30 20:20:08,295 INFO L226 Difference]: Without dead ends: 30 [2018-09-30 20:20:08,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:08,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-30 20:20:08,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-09-30 20:20:08,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-30 20:20:08,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2018-09-30 20:20:08,304 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 44 transitions. Word has length 13 [2018-09-30 20:20:08,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:20:08,308 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 44 transitions. [2018-09-30 20:20:08,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:20:08,308 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 44 transitions. [2018-09-30 20:20:08,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-30 20:20:08,309 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:20:08,310 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:20:08,310 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:20:08,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:20:08,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1912029775, now seen corresponding path program 1 times [2018-09-30 20:20:08,311 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:20:08,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:20:08,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:08,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:20:08,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:20:08,427 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 20:20:08,427 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:20:08,428 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:20:08,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:20:08,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:20:08,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:08,430 INFO L87 Difference]: Start difference. First operand 30 states and 44 transitions. Second operand 3 states. [2018-09-30 20:20:08,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:20:08,624 INFO L93 Difference]: Finished difference Result 62 states and 93 transitions. [2018-09-30 20:20:08,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:20:08,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-09-30 20:20:08,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:20:08,625 INFO L225 Difference]: With dead ends: 62 [2018-09-30 20:20:08,626 INFO L226 Difference]: Without dead ends: 35 [2018-09-30 20:20:08,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:08,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-30 20:20:08,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-30 20:20:08,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-30 20:20:08,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-09-30 20:20:08,634 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 19 [2018-09-30 20:20:08,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:20:08,635 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-09-30 20:20:08,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:20:08,635 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-09-30 20:20:08,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-30 20:20:08,636 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:20:08,636 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:20:08,637 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:20:08,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:20:08,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1719277757, now seen corresponding path program 1 times [2018-09-30 20:20:08,637 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:20:08,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:20:08,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:08,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:20:08,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:20:08,751 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-30 20:20:08,751 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:20:08,751 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:20:08,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:20:08,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:20:08,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:08,753 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-09-30 20:20:08,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:20:08,859 INFO L93 Difference]: Finished difference Result 73 states and 105 transitions. [2018-09-30 20:20:08,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:20:08,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-09-30 20:20:08,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:20:08,861 INFO L225 Difference]: With dead ends: 73 [2018-09-30 20:20:08,861 INFO L226 Difference]: Without dead ends: 41 [2018-09-30 20:20:08,862 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:08,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-30 20:20:08,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-30 20:20:08,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-30 20:20:08,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2018-09-30 20:20:08,870 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 55 transitions. Word has length 26 [2018-09-30 20:20:08,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:20:08,871 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 55 transitions. [2018-09-30 20:20:08,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:20:08,871 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2018-09-30 20:20:08,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 20:20:08,872 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:20:08,873 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-09-30 20:20:08,873 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:20:08,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:20:08,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1612801811, now seen corresponding path program 1 times [2018-09-30 20:20:08,874 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:20:08,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:20:08,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:08,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:20:08,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:20:08,972 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-09-30 20:20:08,972 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:20:08,973 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:20:08,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:20:08,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:20:08,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:08,974 INFO L87 Difference]: Start difference. First operand 41 states and 55 transitions. Second operand 3 states. [2018-09-30 20:20:09,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:20:09,197 INFO L93 Difference]: Finished difference Result 86 states and 119 transitions. [2018-09-30 20:20:09,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:20:09,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-30 20:20:09,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:20:09,199 INFO L225 Difference]: With dead ends: 86 [2018-09-30 20:20:09,199 INFO L226 Difference]: Without dead ends: 48 [2018-09-30 20:20:09,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:09,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-30 20:20:09,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-09-30 20:20:09,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-30 20:20:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2018-09-30 20:20:09,209 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 34 [2018-09-30 20:20:09,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:20:09,209 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2018-09-30 20:20:09,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:20:09,210 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2018-09-30 20:20:09,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-30 20:20:09,211 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:20:09,211 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-09-30 20:20:09,212 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:20:09,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:20:09,212 INFO L82 PathProgramCache]: Analyzing trace with hash -168763707, now seen corresponding path program 1 times [2018-09-30 20:20:09,212 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:20:09,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:20:09,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:09,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:20:09,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:20:09,309 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-09-30 20:20:09,310 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:20:09,310 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:20:09,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:20:09,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:20:09,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:09,313 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand 3 states. [2018-09-30 20:20:09,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:20:09,441 INFO L93 Difference]: Finished difference Result 136 states and 179 transitions. [2018-09-30 20:20:09,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:20:09,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-09-30 20:20:09,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:20:09,447 INFO L225 Difference]: With dead ends: 136 [2018-09-30 20:20:09,447 INFO L226 Difference]: Without dead ends: 91 [2018-09-30 20:20:09,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:09,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-30 20:20:09,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-09-30 20:20:09,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-30 20:20:09,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2018-09-30 20:20:09,462 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 117 transitions. Word has length 43 [2018-09-30 20:20:09,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:20:09,462 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 117 transitions. [2018-09-30 20:20:09,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:20:09,463 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2018-09-30 20:20:09,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-30 20:20:09,464 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:20:09,465 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-09-30 20:20:09,465 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:20:09,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:20:09,465 INFO L82 PathProgramCache]: Analyzing trace with hash 253938119, now seen corresponding path program 1 times [2018-09-30 20:20:09,465 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:20:09,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:20:09,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:09,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:20:09,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:20:09,561 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-09-30 20:20:09,562 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:20:09,562 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:20:09,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:20:09,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:20:09,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:09,563 INFO L87 Difference]: Start difference. First operand 91 states and 117 transitions. Second operand 3 states. [2018-09-30 20:20:09,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:20:09,685 INFO L93 Difference]: Finished difference Result 188 states and 241 transitions. [2018-09-30 20:20:09,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:20:09,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-09-30 20:20:09,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:20:09,687 INFO L225 Difference]: With dead ends: 188 [2018-09-30 20:20:09,687 INFO L226 Difference]: Without dead ends: 100 [2018-09-30 20:20:09,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:09,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-30 20:20:09,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-09-30 20:20:09,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-30 20:20:09,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 126 transitions. [2018-09-30 20:20:09,712 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 126 transitions. Word has length 43 [2018-09-30 20:20:09,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:20:09,713 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 126 transitions. [2018-09-30 20:20:09,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:20:09,715 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 126 transitions. [2018-09-30 20:20:09,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-30 20:20:09,718 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:20:09,718 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-09-30 20:20:09,718 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:20:09,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:20:09,719 INFO L82 PathProgramCache]: Analyzing trace with hash -4227319, now seen corresponding path program 1 times [2018-09-30 20:20:09,719 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:20:09,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:20:09,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:09,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:20:09,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:20:09,834 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-30 20:20:09,835 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:20:09,835 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:20:09,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:20:09,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:20:09,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:09,837 INFO L87 Difference]: Start difference. First operand 100 states and 126 transitions. Second operand 3 states. [2018-09-30 20:20:09,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:20:09,991 INFO L93 Difference]: Finished difference Result 139 states and 179 transitions. [2018-09-30 20:20:09,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:20:09,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-09-30 20:20:09,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:20:09,993 INFO L225 Difference]: With dead ends: 139 [2018-09-30 20:20:09,993 INFO L226 Difference]: Without dead ends: 137 [2018-09-30 20:20:09,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:09,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-09-30 20:20:10,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 132. [2018-09-30 20:20:10,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-09-30 20:20:10,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 171 transitions. [2018-09-30 20:20:10,012 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 171 transitions. Word has length 43 [2018-09-30 20:20:10,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:20:10,012 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 171 transitions. [2018-09-30 20:20:10,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:20:10,013 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 171 transitions. [2018-09-30 20:20:10,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-30 20:20:10,014 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:20:10,015 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-09-30 20:20:10,015 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:20:10,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:20:10,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1562207431, now seen corresponding path program 1 times [2018-09-30 20:20:10,016 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:20:10,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:20:10,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:10,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:20:10,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:20:10,086 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-09-30 20:20:10,086 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:20:10,087 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:20:10,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:20:10,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:20:10,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:10,088 INFO L87 Difference]: Start difference. First operand 132 states and 171 transitions. Second operand 3 states. [2018-09-30 20:20:10,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:20:10,490 INFO L93 Difference]: Finished difference Result 297 states and 405 transitions. [2018-09-30 20:20:10,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:20:10,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-09-30 20:20:10,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:20:10,493 INFO L225 Difference]: With dead ends: 297 [2018-09-30 20:20:10,493 INFO L226 Difference]: Without dead ends: 168 [2018-09-30 20:20:10,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:10,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-09-30 20:20:10,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-09-30 20:20:10,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-09-30 20:20:10,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 222 transitions. [2018-09-30 20:20:10,517 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 222 transitions. Word has length 73 [2018-09-30 20:20:10,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:20:10,518 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 222 transitions. [2018-09-30 20:20:10,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:20:10,518 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 222 transitions. [2018-09-30 20:20:10,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-30 20:20:10,520 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:20:10,521 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-09-30 20:20:10,521 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:20:10,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:20:10,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1926453931, now seen corresponding path program 2 times [2018-09-30 20:20:10,521 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:20:10,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:20:10,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:10,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:20:10,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:20:10,627 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-09-30 20:20:10,627 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:20:10,627 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:20:10,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:20:10,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:20:10,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:10,630 INFO L87 Difference]: Start difference. First operand 168 states and 222 transitions. Second operand 3 states. [2018-09-30 20:20:11,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:20:11,024 INFO L93 Difference]: Finished difference Result 405 states and 558 transitions. [2018-09-30 20:20:11,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:20:11,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2018-09-30 20:20:11,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:20:11,027 INFO L225 Difference]: With dead ends: 405 [2018-09-30 20:20:11,027 INFO L226 Difference]: Without dead ends: 228 [2018-09-30 20:20:11,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:11,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-09-30 20:20:11,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-09-30 20:20:11,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-09-30 20:20:11,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 297 transitions. [2018-09-30 20:20:11,053 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 297 transitions. Word has length 76 [2018-09-30 20:20:11,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:20:11,054 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 297 transitions. [2018-09-30 20:20:11,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:20:11,054 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 297 transitions. [2018-09-30 20:20:11,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-30 20:20:11,056 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:20:11,057 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-09-30 20:20:11,057 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:20:11,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:20:11,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1254900833, now seen corresponding path program 1 times [2018-09-30 20:20:11,058 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:20:11,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:20:11,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:11,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:20:11,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:20:11,147 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-09-30 20:20:11,148 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:20:11,148 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:20:11,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:20:11,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:20:11,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:11,149 INFO L87 Difference]: Start difference. First operand 228 states and 297 transitions. Second operand 3 states. [2018-09-30 20:20:11,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:20:11,739 INFO L93 Difference]: Finished difference Result 489 states and 642 transitions. [2018-09-30 20:20:11,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:20:11,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-09-30 20:20:11,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:20:11,742 INFO L225 Difference]: With dead ends: 489 [2018-09-30 20:20:11,742 INFO L226 Difference]: Without dead ends: 255 [2018-09-30 20:20:11,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:11,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-09-30 20:20:11,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-09-30 20:20:11,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-09-30 20:20:11,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 327 transitions. [2018-09-30 20:20:11,768 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 327 transitions. Word has length 85 [2018-09-30 20:20:11,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:20:11,769 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 327 transitions. [2018-09-30 20:20:11,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:20:11,769 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 327 transitions. [2018-09-30 20:20:11,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-30 20:20:11,771 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:20:11,771 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-09-30 20:20:11,771 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:20:11,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:20:11,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1359801879, now seen corresponding path program 1 times [2018-09-30 20:20:11,772 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:20:11,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:20:11,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:11,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:20:11,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:20:11,894 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-09-30 20:20:11,894 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:20:11,895 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:20:11,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:20:11,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:20:11,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:11,896 INFO L87 Difference]: Start difference. First operand 255 states and 327 transitions. Second operand 3 states. [2018-09-30 20:20:12,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:20:12,471 INFO L93 Difference]: Finished difference Result 543 states and 702 transitions. [2018-09-30 20:20:12,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:20:12,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2018-09-30 20:20:12,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:20:12,474 INFO L225 Difference]: With dead ends: 543 [2018-09-30 20:20:12,474 INFO L226 Difference]: Without dead ends: 285 [2018-09-30 20:20:12,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:12,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-09-30 20:20:12,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-09-30 20:20:12,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-09-30 20:20:12,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 363 transitions. [2018-09-30 20:20:12,502 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 363 transitions. Word has length 94 [2018-09-30 20:20:12,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:20:12,503 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 363 transitions. [2018-09-30 20:20:12,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:20:12,503 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 363 transitions. [2018-09-30 20:20:12,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-30 20:20:12,505 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:20:12,505 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-09-30 20:20:12,505 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:20:12,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:20:12,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1195726822, now seen corresponding path program 1 times [2018-09-30 20:20:12,506 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:20:12,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:20:12,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:12,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:20:12,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:20:12,635 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-09-30 20:20:12,636 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:20:12,636 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:20:12,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:20:12,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:20:12,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:12,637 INFO L87 Difference]: Start difference. First operand 285 states and 363 transitions. Second operand 3 states. [2018-09-30 20:20:12,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:20:12,976 INFO L93 Difference]: Finished difference Result 603 states and 774 transitions. [2018-09-30 20:20:12,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:20:12,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-09-30 20:20:12,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:20:12,981 INFO L225 Difference]: With dead ends: 603 [2018-09-30 20:20:12,981 INFO L226 Difference]: Without dead ends: 318 [2018-09-30 20:20:12,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:12,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-09-30 20:20:13,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-09-30 20:20:13,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-09-30 20:20:13,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 405 transitions. [2018-09-30 20:20:13,007 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 405 transitions. Word has length 104 [2018-09-30 20:20:13,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:20:13,008 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 405 transitions. [2018-09-30 20:20:13,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:20:13,008 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 405 transitions. [2018-09-30 20:20:13,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-09-30 20:20:13,010 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:20:13,010 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-09-30 20:20:13,010 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:20:13,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:20:13,011 INFO L82 PathProgramCache]: Analyzing trace with hash -32649186, now seen corresponding path program 1 times [2018-09-30 20:20:13,011 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:20:13,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:20:13,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:13,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:20:13,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:20:13,145 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-09-30 20:20:13,145 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:20:13,146 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:20:13,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:20:13,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:20:13,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:13,147 INFO L87 Difference]: Start difference. First operand 318 states and 405 transitions. Second operand 3 states. [2018-09-30 20:20:13,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:20:13,740 INFO L93 Difference]: Finished difference Result 633 states and 807 transitions. [2018-09-30 20:20:13,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:20:13,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2018-09-30 20:20:13,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:20:13,743 INFO L225 Difference]: With dead ends: 633 [2018-09-30 20:20:13,743 INFO L226 Difference]: Without dead ends: 318 [2018-09-30 20:20:13,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:13,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-09-30 20:20:13,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-09-30 20:20:13,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-09-30 20:20:13,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 402 transitions. [2018-09-30 20:20:13,774 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 402 transitions. Word has length 115 [2018-09-30 20:20:13,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:20:13,774 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 402 transitions. [2018-09-30 20:20:13,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:20:13,775 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 402 transitions. [2018-09-30 20:20:13,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-30 20:20:13,776 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:20:13,776 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-09-30 20:20:13,777 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:20:13,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:20:13,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1066373693, now seen corresponding path program 1 times [2018-09-30 20:20:13,777 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:20:13,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:20:13,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:13,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:20:13,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:20:13,925 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-09-30 20:20:13,926 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:20:13,926 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:20:13,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:20:13,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:20:13,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:13,927 INFO L87 Difference]: Start difference. First operand 318 states and 402 transitions. Second operand 3 states. [2018-09-30 20:20:14,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:20:14,493 INFO L93 Difference]: Finished difference Result 633 states and 801 transitions. [2018-09-30 20:20:14,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:20:14,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2018-09-30 20:20:14,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:20:14,497 INFO L225 Difference]: With dead ends: 633 [2018-09-30 20:20:14,497 INFO L226 Difference]: Without dead ends: 318 [2018-09-30 20:20:14,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 20:20:14,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-09-30 20:20:14,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-09-30 20:20:14,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-09-30 20:20:14,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 387 transitions. [2018-09-30 20:20:14,569 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 387 transitions. Word has length 124 [2018-09-30 20:20:14,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:20:14,570 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 387 transitions. [2018-09-30 20:20:14,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:20:14,570 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 387 transitions. [2018-09-30 20:20:14,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-30 20:20:14,573 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:20:14,574 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-09-30 20:20:14,574 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:20:14,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:20:14,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1427413192, now seen corresponding path program 1 times [2018-09-30 20:20:14,574 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:20:14,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:20:14,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:14,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:20:14,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:20:14,758 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 385 proven. 4 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-09-30 20:20:14,759 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:20:14,759 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-09-30 20:20:14,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:20:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:20:14,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:20:14,934 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 385 proven. 4 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-09-30 20:20:14,969 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:20:14,969 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-09-30 20:20:14,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:20:14,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:20:14,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 20:20:14,970 INFO L87 Difference]: Start difference. First operand 318 states and 387 transitions. Second operand 4 states. [2018-09-30 20:20:16,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:20:16,048 INFO L93 Difference]: Finished difference Result 757 states and 914 transitions. [2018-09-30 20:20:16,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 20:20:16,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2018-09-30 20:20:16,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:20:16,051 INFO L225 Difference]: With dead ends: 757 [2018-09-30 20:20:16,051 INFO L226 Difference]: Without dead ends: 415 [2018-09-30 20:20:16,052 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 20:20:16,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-09-30 20:20:16,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 255. [2018-09-30 20:20:16,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-09-30 20:20:16,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 291 transitions. [2018-09-30 20:20:16,097 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 291 transitions. Word has length 136 [2018-09-30 20:20:16,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:20:16,097 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 291 transitions. [2018-09-30 20:20:16,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:20:16,099 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 291 transitions. [2018-09-30 20:20:16,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-09-30 20:20:16,101 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:20:16,101 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-09-30 20:20:16,101 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:20:16,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:20:16,101 INFO L82 PathProgramCache]: Analyzing trace with hash 2065701642, now seen corresponding path program 2 times [2018-09-30 20:20:16,102 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:20:16,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:20:16,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:16,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:20:16,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:20:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:20:16,261 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 417 proven. 3 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2018-09-30 20:20:16,262 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:20:16,262 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-09-30 20:20:16,274 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:20:16,386 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:20:16,386 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:20:16,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:20:16,425 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 417 proven. 3 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2018-09-30 20:20:16,457 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:20:16,457 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-09-30 20:20:16,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:20:16,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:20:16,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 20:20:16,459 INFO L87 Difference]: Start difference. First operand 255 states and 291 transitions. Second operand 4 states. [2018-09-30 20:20:16,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:20:16,899 INFO L93 Difference]: Finished difference Result 429 states and 487 transitions. [2018-09-30 20:20:16,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 20:20:16,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-09-30 20:20:16,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:20:16,906 INFO L225 Difference]: With dead ends: 429 [2018-09-30 20:20:16,906 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 20:20:16,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 20:20:16,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 20:20:16,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 20:20:16,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 20:20:16,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 20:20:16,908 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 139 [2018-09-30 20:20:16,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:20:16,908 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 20:20:16,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:20:16,909 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 20:20:16,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 20:20:16,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 20:20:16,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:16,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:16,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:16,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:16,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:16,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:16,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:16,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:16,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:20:17,444 WARN L178 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 7 [2018-09-30 20:20:18,466 WARN L178 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2018-09-30 20:20:18,590 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 21 [2018-09-30 20:20:18,849 WARN L178 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2018-09-30 20:20:19,165 WARN L178 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 22 [2018-09-30 20:20:19,362 WARN L178 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2018-09-30 20:20:19,557 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2018-09-30 20:20:19,919 WARN L178 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2018-09-30 20:20:20,242 WARN L178 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2018-09-30 20:20:20,403 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2018-09-30 20:20:20,422 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-09-30 20:20:20,423 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-09-30 20:20:20,423 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-09-30 20:20:20,423 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-09-30 20:20:20,424 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-09-30 20:20:20,424 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 526) no Hoare annotation was computed. [2018-09-30 20:20:20,424 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 526) no Hoare annotation was computed. [2018-09-30 20:20:20,424 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-09-30 20:20:20,424 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-09-30 20:20:20,425 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-09-30 20:20:20,425 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 459) no Hoare annotation was computed. [2018-09-30 20:20:20,425 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 526) no Hoare annotation was computed. [2018-09-30 20:20:20,425 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-09-30 20:20:20,425 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-09-30 20:20:20,426 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-09-30 20:20:20,426 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-09-30 20:20:20,426 INFO L422 ceAbstractionStarter]: At program point L431(lines 431 458) the Hoare annotation is: false [2018-09-30 20:20:20,426 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-09-30 20:20:20,426 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-09-30 20:20:20,426 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-09-30 20:20:20,427 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-09-30 20:20:20,427 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-09-30 20:20:20,427 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-09-30 20:20:20,427 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-09-30 20:20:20,427 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-09-30 20:20:20,427 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-09-30 20:20:20,446 INFO L202 PluginConnector]: Adding new model s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:20:20 BoogieIcfgContainer [2018-09-30 20:20:20,446 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:20:20,447 INFO L168 Benchmark]: Toolchain (without parser) took 14183.51 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 76.5 MB). Free memory was 1.4 GB in the beginning and 916.3 MB in the end (delta: 495.9 MB). Peak memory consumption was 572.4 MB. Max. memory is 7.1 GB. [2018-09-30 20:20:20,448 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:20:20,449 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:20:20,449 INFO L168 Benchmark]: Boogie Preprocessor took 62.90 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:20:20,450 INFO L168 Benchmark]: RCFGBuilder took 802.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-30 20:20:20,451 INFO L168 Benchmark]: TraceAbstraction took 13248.63 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 76.5 MB). Free memory was 1.4 GB in the beginning and 916.3 MB in the end (delta: 464.2 MB). Peak memory consumption was 540.7 MB. Max. memory is 7.1 GB. [2018-09-30 20:20:20,455 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.90 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 802.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13248.63 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 76.5 MB). Free memory was 1.4 GB in the beginning and 916.3 MB in the end (delta: 464.2 MB). Peak memory consumption was 540.7 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, 13.1s OverallTime, 17 OverallIterations, 17 TraceHistogramMax, 6.5s AutomataDifference, 0.0s DeadEndRemovalTime, 3.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 545 SDtfs, 240 SDslu, 220 SDs, 0 SdLazy, 533 SolverSat, 139 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 329 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s 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.2s HoareSimplificationTime, 22 FomulaSimplificationsInter, 1150 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s 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.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_20-20-20-474.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_2.cil.c_21.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_20-20-20-474.csv Received shutdown request...