java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3_alt.BV.c.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 20:47:23,049 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:47:23,052 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:47:23,069 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:47:23,069 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:47:23,071 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:47:23,072 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:47:23,075 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:47:23,077 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:47:23,080 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:47:23,081 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:47:23,081 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:47:23,082 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:47:23,092 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:47:23,093 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:47:23,094 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:47:23,096 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:47:23,100 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:47:23,102 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:47:23,104 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:47:23,105 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:47:23,106 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:47:23,108 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:47:23,109 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:47:23,109 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:47:23,110 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:47:23,111 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:47:23,112 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:47:23,112 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:47:23,114 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:47:23,114 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:47:23,114 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:47:23,115 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:47:23,115 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:47:23,116 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:47:23,117 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:47:23,117 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-09-30 20:47:23,137 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:47:23,137 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:47:23,138 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:47:23,140 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:47:23,141 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:47:23,141 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:47:23,141 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:47:23,144 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:47:23,144 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:47:23,144 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:47:23,144 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:47:23,145 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:47:23,145 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:47:23,145 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:47:23,145 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:47:23,146 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:47:23,146 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:47:23,146 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:47:23,146 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:47:23,146 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:47:23,147 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:47:23,147 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:47:23,147 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:47:23,147 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:47:23,149 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:47:23,149 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:47:23,149 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:47:23,149 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:47:23,150 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:47:23,150 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:47:23,150 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 20:47:23,210 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:47:23,223 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:47:23,228 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:47:23,229 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:47:23,230 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:47:23,231 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3_alt.BV.c.cil.c_19.bpl [2018-09-30 20:47:23,231 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3_alt.BV.c.cil.c_19.bpl' [2018-09-30 20:47:23,335 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:47:23,338 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:47:23,339 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:47:23,339 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:47:23,339 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:47:23,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:23" (1/1) ... [2018-09-30 20:47:23,377 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:23" (1/1) ... [2018-09-30 20:47:23,384 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:47:23,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:47:23,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:47:23,385 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:47:23,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:23" (1/1) ... [2018-09-30 20:47:23,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:23" (1/1) ... [2018-09-30 20:47:23,401 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:23" (1/1) ... [2018-09-30 20:47:23,401 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:23" (1/1) ... [2018-09-30 20:47:23,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:23" (1/1) ... [2018-09-30 20:47:23,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:23" (1/1) ... [2018-09-30 20:47:23,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:23" (1/1) ... [2018-09-30 20:47:23,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:47:23,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:47:23,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:47:23,423 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:47:23,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:23" (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:47:23,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 20:47:23,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 20:47:24,277 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 20:47:24,278 INFO L202 PluginConnector]: Adding new model s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:47:24 BoogieIcfgContainer [2018-09-30 20:47:24,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:47:24,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:47:24,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:47:24,283 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:47:24,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:23" (1/2) ... [2018-09-30 20:47:24,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50d5afd5 and model type s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:47:24, skipping insertion in model container [2018-09-30 20:47:24,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:47:24" (2/2) ... [2018-09-30 20:47:24,287 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3_alt.BV.c.cil.c_19.bpl [2018-09-30 20:47:24,296 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:47:24,306 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 20:47:24,355 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:47:24,356 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:47:24,356 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:47:24,356 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:47:24,356 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:47:24,357 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:47:24,357 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:47:24,357 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:47:24,357 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:47:24,372 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-09-30 20:47:24,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 20:47:24,378 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:24,380 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:24,381 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:24,387 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:24,388 INFO L82 PathProgramCache]: Analyzing trace with hash -505433715, now seen corresponding path program 1 times [2018-09-30 20:47:24,390 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:24,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:24,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:24,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:24,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:24,615 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:47:24,618 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:24,618 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:47:24,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:24,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:24,635 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:24,637 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-09-30 20:47:25,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:25,464 INFO L93 Difference]: Finished difference Result 56 states and 94 transitions. [2018-09-30 20:47:25,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:25,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-30 20:47:25,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:25,480 INFO L225 Difference]: With dead ends: 56 [2018-09-30 20:47:25,480 INFO L226 Difference]: Without dead ends: 34 [2018-09-30 20:47:25,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:25,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-30 20:47:25,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-09-30 20:47:25,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-30 20:47:25,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-09-30 20:47:25,529 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 15 [2018-09-30 20:47:25,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:25,530 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2018-09-30 20:47:25,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:25,531 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2018-09-30 20:47:25,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-30 20:47:25,532 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:25,532 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:25,534 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:25,534 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:25,534 INFO L82 PathProgramCache]: Analyzing trace with hash -912155261, now seen corresponding path program 1 times [2018-09-30 20:47:25,535 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:25,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:25,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:25,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:25,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:25,649 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:47:25,649 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:25,649 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:47:25,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:25,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:25,652 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:25,652 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2018-09-30 20:47:26,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:26,376 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-09-30 20:47:26,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:26,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-09-30 20:47:26,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:26,379 INFO L225 Difference]: With dead ends: 83 [2018-09-30 20:47:26,380 INFO L226 Difference]: Without dead ends: 50 [2018-09-30 20:47:26,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:26,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-30 20:47:26,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-09-30 20:47:26,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-30 20:47:26,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 83 transitions. [2018-09-30 20:47:26,395 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 83 transitions. Word has length 23 [2018-09-30 20:47:26,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:26,395 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 83 transitions. [2018-09-30 20:47:26,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:26,396 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 83 transitions. [2018-09-30 20:47:26,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-30 20:47:26,397 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:26,397 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:26,397 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:26,398 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:26,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1423527967, now seen corresponding path program 1 times [2018-09-30 20:47:26,398 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:26,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:26,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:26,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:26,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:26,473 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-30 20:47:26,473 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:26,474 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:47:26,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:26,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:26,474 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:26,475 INFO L87 Difference]: Start difference. First operand 50 states and 83 transitions. Second operand 3 states. [2018-09-30 20:47:26,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:26,789 INFO L93 Difference]: Finished difference Result 106 states and 177 transitions. [2018-09-30 20:47:26,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:26,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-30 20:47:26,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:26,791 INFO L225 Difference]: With dead ends: 106 [2018-09-30 20:47:26,791 INFO L226 Difference]: Without dead ends: 57 [2018-09-30 20:47:26,792 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:26,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-30 20:47:26,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-30 20:47:26,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-30 20:47:26,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 92 transitions. [2018-09-30 20:47:26,806 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 92 transitions. Word has length 30 [2018-09-30 20:47:26,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:26,807 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 92 transitions. [2018-09-30 20:47:26,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:26,807 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 92 transitions. [2018-09-30 20:47:26,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-30 20:47:26,808 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:26,808 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:26,809 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:26,809 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:26,809 INFO L82 PathProgramCache]: Analyzing trace with hash 222883079, now seen corresponding path program 1 times [2018-09-30 20:47:26,809 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:26,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:26,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:26,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:26,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:26,873 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:47:26,873 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:26,874 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:47:26,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:26,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:26,875 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:26,875 INFO L87 Difference]: Start difference. First operand 57 states and 92 transitions. Second operand 3 states. [2018-09-30 20:47:27,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:27,347 INFO L93 Difference]: Finished difference Result 131 states and 214 transitions. [2018-09-30 20:47:27,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:27,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-30 20:47:27,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:27,351 INFO L225 Difference]: With dead ends: 131 [2018-09-30 20:47:27,351 INFO L226 Difference]: Without dead ends: 74 [2018-09-30 20:47:27,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:27,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-30 20:47:27,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-09-30 20:47:27,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-30 20:47:27,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 120 transitions. [2018-09-30 20:47:27,372 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 120 transitions. Word has length 30 [2018-09-30 20:47:27,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:27,372 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 120 transitions. [2018-09-30 20:47:27,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:27,372 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 120 transitions. [2018-09-30 20:47:27,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-30 20:47:27,374 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:27,374 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:27,374 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:27,375 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:27,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1035189277, now seen corresponding path program 1 times [2018-09-30 20:47:27,375 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:27,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:27,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:27,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:27,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:27,475 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-09-30 20:47:27,475 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:27,476 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:47:27,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:27,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:27,477 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:27,477 INFO L87 Difference]: Start difference. First operand 74 states and 120 transitions. Second operand 3 states. [2018-09-30 20:47:27,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:27,690 INFO L93 Difference]: Finished difference Result 153 states and 249 transitions. [2018-09-30 20:47:27,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:27,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-09-30 20:47:27,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:27,692 INFO L225 Difference]: With dead ends: 153 [2018-09-30 20:47:27,692 INFO L226 Difference]: Without dead ends: 80 [2018-09-30 20:47:27,693 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:27,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-30 20:47:27,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-09-30 20:47:27,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-30 20:47:27,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 125 transitions. [2018-09-30 20:47:27,707 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 125 transitions. Word has length 36 [2018-09-30 20:47:27,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:27,707 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 125 transitions. [2018-09-30 20:47:27,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:27,707 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 125 transitions. [2018-09-30 20:47:27,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-30 20:47:27,709 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:27,709 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:27,709 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:27,710 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:27,710 INFO L82 PathProgramCache]: Analyzing trace with hash -720648959, now seen corresponding path program 1 times [2018-09-30 20:47:27,710 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:27,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:27,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:27,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:27,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:27,767 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-09-30 20:47:27,768 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:27,768 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:47:27,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:27,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:27,769 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:27,769 INFO L87 Difference]: Start difference. First operand 80 states and 125 transitions. Second operand 3 states. [2018-09-30 20:47:27,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:27,988 INFO L93 Difference]: Finished difference Result 164 states and 257 transitions. [2018-09-30 20:47:27,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:27,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-09-30 20:47:27,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:27,990 INFO L225 Difference]: With dead ends: 164 [2018-09-30 20:47:27,990 INFO L226 Difference]: Without dead ends: 85 [2018-09-30 20:47:27,992 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:27,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-30 20:47:28,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-30 20:47:28,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-30 20:47:28,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2018-09-30 20:47:28,007 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 41 [2018-09-30 20:47:28,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:28,007 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2018-09-30 20:47:28,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:28,007 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2018-09-30 20:47:28,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-30 20:47:28,009 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:28,009 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:28,010 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:28,010 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:28,010 INFO L82 PathProgramCache]: Analyzing trace with hash -2015268825, now seen corresponding path program 1 times [2018-09-30 20:47:28,010 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:28,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:28,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:28,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:28,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:28,023 ERROR L236 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-09-30 20:47:28,023 INFO L259 seRefinementStrategy]: Advancing trace checker [2018-09-30 20:47:28,024 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-09-30 20:47:28,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:28,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:47:28,388 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-09-30 20:47:28,410 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:28,410 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:47:28,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:28,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:28,411 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:28,411 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand 3 states. [2018-09-30 20:47:28,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:28,799 INFO L93 Difference]: Finished difference Result 246 states and 370 transitions. [2018-09-30 20:47:28,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:28,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-09-30 20:47:28,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:28,802 INFO L225 Difference]: With dead ends: 246 [2018-09-30 20:47:28,803 INFO L226 Difference]: Without dead ends: 162 [2018-09-30 20:47:28,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:47:28,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-09-30 20:47:28,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-09-30 20:47:28,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-09-30 20:47:28,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2018-09-30 20:47:28,831 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 234 transitions. Word has length 44 [2018-09-30 20:47:28,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:28,832 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 234 transitions. [2018-09-30 20:47:28,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:28,832 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 234 transitions. [2018-09-30 20:47:28,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-30 20:47:28,834 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:28,834 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:28,835 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:28,835 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:28,835 INFO L82 PathProgramCache]: Analyzing trace with hash -688187521, now seen corresponding path program 1 times [2018-09-30 20:47:28,835 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:28,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:28,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:28,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:28,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:28,903 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-09-30 20:47:28,904 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:28,904 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:28,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:28,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:28,905 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:28,905 INFO L87 Difference]: Start difference. First operand 162 states and 234 transitions. Second operand 3 states. [2018-09-30 20:47:29,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:29,180 INFO L93 Difference]: Finished difference Result 250 states and 366 transitions. [2018-09-30 20:47:29,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:29,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-09-30 20:47:29,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:29,182 INFO L225 Difference]: With dead ends: 250 [2018-09-30 20:47:29,182 INFO L226 Difference]: Without dead ends: 166 [2018-09-30 20:47:29,183 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:29,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-09-30 20:47:29,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-09-30 20:47:29,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-09-30 20:47:29,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 238 transitions. [2018-09-30 20:47:29,207 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 238 transitions. Word has length 47 [2018-09-30 20:47:29,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:29,208 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 238 transitions. [2018-09-30 20:47:29,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:29,208 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 238 transitions. [2018-09-30 20:47:29,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-30 20:47:29,210 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:29,210 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:29,211 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:29,211 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:29,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1326956629, now seen corresponding path program 1 times [2018-09-30 20:47:29,211 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:29,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:29,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:29,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:29,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:29,384 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-30 20:47:29,384 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:47:29,385 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:47:29,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:29,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:29,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:47:29,803 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-09-30 20:47:29,824 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 20:47:29,824 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-09-30 20:47:29,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:47:29,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:47:29,825 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:29,825 INFO L87 Difference]: Start difference. First operand 166 states and 238 transitions. Second operand 5 states. [2018-09-30 20:47:32,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:32,298 INFO L93 Difference]: Finished difference Result 598 states and 860 transitions. [2018-09-30 20:47:32,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 20:47:32,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-09-30 20:47:32,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:32,303 INFO L225 Difference]: With dead ends: 598 [2018-09-30 20:47:32,303 INFO L226 Difference]: Without dead ends: 406 [2018-09-30 20:47:32,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-09-30 20:47:32,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-09-30 20:47:32,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 240. [2018-09-30 20:47:32,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-09-30 20:47:32,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 333 transitions. [2018-09-30 20:47:32,340 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 333 transitions. Word has length 48 [2018-09-30 20:47:32,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:32,340 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 333 transitions. [2018-09-30 20:47:32,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:47:32,341 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 333 transitions. [2018-09-30 20:47:32,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-30 20:47:32,343 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:32,343 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:32,343 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:32,343 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:32,343 INFO L82 PathProgramCache]: Analyzing trace with hash 2115677753, now seen corresponding path program 1 times [2018-09-30 20:47:32,344 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:32,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:32,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:32,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:32,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:32,414 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-09-30 20:47:32,414 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:32,415 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:32,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:32,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:32,415 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:32,415 INFO L87 Difference]: Start difference. First operand 240 states and 333 transitions. Second operand 3 states. [2018-09-30 20:47:32,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:32,743 INFO L93 Difference]: Finished difference Result 399 states and 560 transitions. [2018-09-30 20:47:32,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:32,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-09-30 20:47:32,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:32,749 INFO L225 Difference]: With dead ends: 399 [2018-09-30 20:47:32,749 INFO L226 Difference]: Without dead ends: 239 [2018-09-30 20:47:32,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:32,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-09-30 20:47:32,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-09-30 20:47:32,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-09-30 20:47:32,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 329 transitions. [2018-09-30 20:47:32,780 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 329 transitions. Word has length 60 [2018-09-30 20:47:32,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:32,780 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 329 transitions. [2018-09-30 20:47:32,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:32,781 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 329 transitions. [2018-09-30 20:47:32,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-30 20:47:32,782 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:32,782 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:32,782 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:32,783 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:32,783 INFO L82 PathProgramCache]: Analyzing trace with hash 227864519, now seen corresponding path program 1 times [2018-09-30 20:47:32,783 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:32,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:32,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:32,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:32,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:32,882 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-09-30 20:47:32,882 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:32,882 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:32,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:32,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:32,883 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:32,883 INFO L87 Difference]: Start difference. First operand 239 states and 329 transitions. Second operand 3 states. [2018-09-30 20:47:33,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:33,058 INFO L93 Difference]: Finished difference Result 470 states and 649 transitions. [2018-09-30 20:47:33,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:33,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-09-30 20:47:33,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:33,061 INFO L225 Difference]: With dead ends: 470 [2018-09-30 20:47:33,062 INFO L226 Difference]: Without dead ends: 237 [2018-09-30 20:47:33,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:33,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-09-30 20:47:33,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-09-30 20:47:33,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-30 20:47:33,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 319 transitions. [2018-09-30 20:47:33,092 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 319 transitions. Word has length 65 [2018-09-30 20:47:33,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:33,093 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 319 transitions. [2018-09-30 20:47:33,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:33,093 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 319 transitions. [2018-09-30 20:47:33,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-30 20:47:33,094 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:33,094 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:33,095 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:33,095 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:33,095 INFO L82 PathProgramCache]: Analyzing trace with hash -242141821, now seen corresponding path program 1 times [2018-09-30 20:47:33,095 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:33,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:33,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:33,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:33,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:33,190 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-09-30 20:47:33,191 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:33,191 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:33,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:33,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:33,192 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:33,192 INFO L87 Difference]: Start difference. First operand 237 states and 319 transitions. Second operand 3 states. [2018-09-30 20:47:33,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:33,625 INFO L93 Difference]: Finished difference Result 465 states and 628 transitions. [2018-09-30 20:47:33,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:33,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-09-30 20:47:33,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:33,629 INFO L225 Difference]: With dead ends: 465 [2018-09-30 20:47:33,630 INFO L226 Difference]: Without dead ends: 235 [2018-09-30 20:47:33,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:33,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-09-30 20:47:33,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-09-30 20:47:33,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-09-30 20:47:33,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 309 transitions. [2018-09-30 20:47:33,656 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 309 transitions. Word has length 71 [2018-09-30 20:47:33,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:33,656 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 309 transitions. [2018-09-30 20:47:33,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:33,657 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 309 transitions. [2018-09-30 20:47:33,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-30 20:47:33,658 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:33,658 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:33,658 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:33,658 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:33,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1274982729, now seen corresponding path program 1 times [2018-09-30 20:47:33,659 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:33,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:33,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:33,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:33,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:33,762 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-09-30 20:47:33,763 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:33,763 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:33,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:33,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:33,763 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:33,764 INFO L87 Difference]: Start difference. First operand 235 states and 309 transitions. Second operand 3 states. [2018-09-30 20:47:34,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:34,054 INFO L93 Difference]: Finished difference Result 465 states and 615 transitions. [2018-09-30 20:47:34,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:34,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-09-30 20:47:34,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:34,056 INFO L225 Difference]: With dead ends: 465 [2018-09-30 20:47:34,056 INFO L226 Difference]: Without dead ends: 238 [2018-09-30 20:47:34,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:34,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-09-30 20:47:34,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-09-30 20:47:34,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-09-30 20:47:34,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 307 transitions. [2018-09-30 20:47:34,081 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 307 transitions. Word has length 78 [2018-09-30 20:47:34,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:34,081 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 307 transitions. [2018-09-30 20:47:34,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:34,082 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 307 transitions. [2018-09-30 20:47:34,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-30 20:47:34,083 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:34,083 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 6, 5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:34,083 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:34,083 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:34,084 INFO L82 PathProgramCache]: Analyzing trace with hash 409856557, now seen corresponding path program 1 times [2018-09-30 20:47:34,084 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:34,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:34,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:34,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:34,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:34,206 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-09-30 20:47:34,207 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:34,207 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:34,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:34,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:34,207 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:34,208 INFO L87 Difference]: Start difference. First operand 238 states and 307 transitions. Second operand 3 states. [2018-09-30 20:47:35,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:35,568 INFO L93 Difference]: Finished difference Result 498 states and 646 transitions. [2018-09-30 20:47:35,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:35,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-09-30 20:47:35,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:35,571 INFO L225 Difference]: With dead ends: 498 [2018-09-30 20:47:35,571 INFO L226 Difference]: Without dead ends: 268 [2018-09-30 20:47:35,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:35,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-09-30 20:47:35,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-09-30 20:47:35,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-09-30 20:47:35,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 337 transitions. [2018-09-30 20:47:35,598 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 337 transitions. Word has length 86 [2018-09-30 20:47:35,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:35,599 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 337 transitions. [2018-09-30 20:47:35,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:35,599 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 337 transitions. [2018-09-30 20:47:35,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-30 20:47:35,600 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:35,600 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:35,600 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:35,601 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:35,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1980925187, now seen corresponding path program 1 times [2018-09-30 20:47:35,601 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:35,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:35,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:35,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:35,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:35,705 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-09-30 20:47:35,706 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:35,706 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:35,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:35,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:35,707 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:35,707 INFO L87 Difference]: Start difference. First operand 268 states and 337 transitions. Second operand 3 states. [2018-09-30 20:47:35,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:35,978 INFO L93 Difference]: Finished difference Result 561 states and 712 transitions. [2018-09-30 20:47:35,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:35,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-09-30 20:47:35,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:35,980 INFO L225 Difference]: With dead ends: 561 [2018-09-30 20:47:35,980 INFO L226 Difference]: Without dead ends: 301 [2018-09-30 20:47:35,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:35,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-09-30 20:47:36,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-09-30 20:47:36,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-30 20:47:36,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 370 transitions. [2018-09-30 20:47:36,019 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 370 transitions. Word has length 96 [2018-09-30 20:47:36,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:36,020 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 370 transitions. [2018-09-30 20:47:36,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:36,020 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 370 transitions. [2018-09-30 20:47:36,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-09-30 20:47:36,021 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:36,021 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:36,022 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:36,022 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:36,022 INFO L82 PathProgramCache]: Analyzing trace with hash -93746115, now seen corresponding path program 1 times [2018-09-30 20:47:36,022 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:36,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:36,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:36,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:36,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:36,155 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-09-30 20:47:36,156 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:36,156 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:36,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:36,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:36,157 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:36,157 INFO L87 Difference]: Start difference. First operand 301 states and 370 transitions. Second operand 3 states. [2018-09-30 20:47:36,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:36,392 INFO L93 Difference]: Finished difference Result 397 states and 491 transitions. [2018-09-30 20:47:36,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:36,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-09-30 20:47:36,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:36,397 INFO L225 Difference]: With dead ends: 397 [2018-09-30 20:47:36,397 INFO L226 Difference]: Without dead ends: 395 [2018-09-30 20:47:36,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:36,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-09-30 20:47:36,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-09-30 20:47:36,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-09-30 20:47:36,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 489 transitions. [2018-09-30 20:47:36,440 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 489 transitions. Word has length 107 [2018-09-30 20:47:36,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:36,440 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 489 transitions. [2018-09-30 20:47:36,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:36,441 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 489 transitions. [2018-09-30 20:47:36,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-30 20:47:36,442 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:36,443 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 11, 10, 9, 8, 7, 6, 5, 3, 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:47:36,443 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:36,443 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:36,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1780977529, now seen corresponding path program 1 times [2018-09-30 20:47:36,443 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:36,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:36,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:36,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:36,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:36,460 ERROR L236 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-09-30 20:47:36,460 INFO L259 seRefinementStrategy]: Advancing trace checker [2018-09-30 20:47:36,460 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-09-30 20:47:36,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:36,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:47:37,032 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2018-09-30 20:47:37,066 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:37,067 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:37,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:37,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:37,068 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:37,068 INFO L87 Difference]: Start difference. First operand 395 states and 489 transitions. Second operand 3 states. [2018-09-30 20:47:37,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:37,364 INFO L93 Difference]: Finished difference Result 782 states and 969 transitions. [2018-09-30 20:47:37,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:37,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2018-09-30 20:47:37,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:37,366 INFO L225 Difference]: With dead ends: 782 [2018-09-30 20:47:37,367 INFO L226 Difference]: Without dead ends: 395 [2018-09-30 20:47:37,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-09-30 20:47:37,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-09-30 20:47:37,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-09-30 20:47:37,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-09-30 20:47:37,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 466 transitions. [2018-09-30 20:47:37,418 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 466 transitions. Word has length 136 [2018-09-30 20:47:37,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:37,419 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 466 transitions. [2018-09-30 20:47:37,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:37,419 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 466 transitions. [2018-09-30 20:47:37,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-30 20:47:37,422 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:37,422 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 16, 15, 14, 12, 10, 8, 6, 4, 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:47:37,422 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:37,422 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:37,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1988836963, now seen corresponding path program 1 times [2018-09-30 20:47:37,423 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:37,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:37,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:37,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:37,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:37,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 740 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-09-30 20:47:37,684 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:47:37,684 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:47:37,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:37,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:47:37,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 740 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-09-30 20:47:37,933 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:47:37,933 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-09-30 20:47:37,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:47:37,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:47:37,934 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:37,934 INFO L87 Difference]: Start difference. First operand 395 states and 466 transitions. Second operand 4 states. [2018-09-30 20:47:38,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:38,158 INFO L93 Difference]: Finished difference Result 629 states and 744 transitions. [2018-09-30 20:47:38,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 20:47:38,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-09-30 20:47:38,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:38,158 INFO L225 Difference]: With dead ends: 629 [2018-09-30 20:47:38,158 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 20:47:38,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:47:38,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 20:47:38,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 20:47:38,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 20:47:38,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 20:47:38,160 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2018-09-30 20:47:38,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:38,161 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 20:47:38,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:47:38,161 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 20:47:38,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 20:47:38,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 20:47:38,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:38,929 WARN L178 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2018-09-30 20:47:39,113 WARN L178 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-09-30 20:47:39,726 WARN L178 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-09-30 20:47:40,177 WARN L178 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-30 20:47:40,632 WARN L178 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-30 20:47:40,764 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2018-09-30 20:47:40,932 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-30 20:47:41,119 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-30 20:47:41,230 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2018-09-30 20:47:41,355 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-30 20:47:41,358 INFO L422 ceAbstractionStarter]: At program point L345(lines 345 353) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)) (and .cse2 .cse3 .cse4 .cse5 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)))) [2018-09-30 20:47:41,358 INFO L422 ceAbstractionStarter]: At program point L304(lines 304 320) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0) (and .cse1 .cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and .cse3 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)) (and .cse3 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)))) [2018-09-30 20:47:41,359 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 484) no Hoare annotation was computed. [2018-09-30 20:47:41,359 INFO L422 ceAbstractionStarter]: At program point L420(lines 420 440) the Hoare annotation is: (let ((.cse0 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) .cse0 .cse1) (and (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) .cse0 .cse1))) [2018-09-30 20:47:41,359 INFO L422 ceAbstractionStarter]: At program point L482(lines 264 482) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-09-30 20:47:41,359 INFO L422 ceAbstractionStarter]: At program point L416(lines 416 427) the Hoare annotation is: (and (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) [2018-09-30 20:47:41,359 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 3 485) no Hoare annotation was computed. [2018-09-30 20:47:41,359 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 3 485) no Hoare annotation was computed. [2018-09-30 20:47:41,359 INFO L422 ceAbstractionStarter]: At program point L408(lines 408 417) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~4 8576) .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) .cse0 .cse1 .cse2 .cse3))) [2018-09-30 20:47:41,359 INFO L422 ceAbstractionStarter]: At program point L375(lines 375 387) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~4 8576) .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) .cse0 .cse1 .cse2 .cse3))) [2018-09-30 20:47:41,360 INFO L422 ceAbstractionStarter]: At program point L462(lines 459 477) the Hoare annotation is: (and (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) [2018-09-30 20:47:41,360 INFO L422 ceAbstractionStarter]: At program point L429(lines 426 448) the Hoare annotation is: (and (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) [2018-09-30 20:47:41,360 INFO L422 ceAbstractionStarter]: At program point L355(lines 355 372) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-09-30 20:47:41,360 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 3 485) no Hoare annotation was computed. [2018-09-30 20:47:41,360 INFO L422 ceAbstractionStarter]: At program point L273(lines 236 273) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-09-30 20:47:41,360 INFO L422 ceAbstractionStarter]: At program point L269(lines 269 288) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-09-30 20:47:41,360 INFO L422 ceAbstractionStarter]: At program point L323(lines 323 340) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse4 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)) (and .cse2 .cse3 .cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse3 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)))) [2018-09-30 20:47:41,360 INFO L422 ceAbstractionStarter]: At program point L447(lines 447 473) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) [2018-09-30 20:47:41,361 INFO L422 ceAbstractionStarter]: At program point L476(lines 476 483) the Hoare annotation is: false [2018-09-30 20:47:41,361 INFO L422 ceAbstractionStarter]: At program point L249(lines 249 265) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-09-30 20:47:41,361 INFO L422 ceAbstractionStarter]: At program point L439(lines 439 460) the Hoare annotation is: (and (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) [2018-09-30 20:47:41,361 INFO L422 ceAbstractionStarter]: At program point L390(lines 390 405) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~4 8576) .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) .cse0 .cse1 .cse2 .cse3))) [2018-09-30 20:47:41,361 INFO L422 ceAbstractionStarter]: At program point L291(lines 291 301) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-09-30 20:47:41,382 INFO L202 PluginConnector]: Adding new model s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:47:41 BoogieIcfgContainer [2018-09-30 20:47:41,382 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:47:41,383 INFO L168 Benchmark]: Toolchain (without parser) took 18047.94 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 115.3 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 313.4 MB). Peak memory consumption was 428.7 MB. Max. memory is 7.1 GB. [2018-09-30 20:47:41,385 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:47:41,386 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.11 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:47:41,386 INFO L168 Benchmark]: Boogie Preprocessor took 36.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:47:41,387 INFO L168 Benchmark]: RCFGBuilder took 856.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-30 20:47:41,388 INFO L168 Benchmark]: TraceAbstraction took 17103.25 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 115.3 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 281.6 MB). Peak memory consumption was 397.0 MB. Max. memory is 7.1 GB. [2018-09-30 20:47:41,396 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 46.11 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 856.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17103.25 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 115.3 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 281.6 MB). Peak memory consumption was 397.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 484]: 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: 420]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || ((ssl3_accept_~blastFlag~4 <= 2 && !(8544 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || (((!(8656 == ssl3_accept_~s__state~4) && !(8672 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: (((((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3)) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) - InvariantResult [Line: 459]: Loop Invariant Derived loop invariant: ((((!(8672 == ssl3_accept_~s__state~4) && !(8512 == ssl3_accept_~s__state~4)) && ssl3_accept_~blastFlag~4 <= 3) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4) - InvariantResult [Line: 323]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3)) || (((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || (((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448) - InvariantResult [Line: 355]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || (((((!(8512 == ssl3_accept_~s__state~4) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) && ssl3_accept_~s__state~4 <= 8576) && !(8448 == ssl3_accept_~s__state~4))) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 426]: Loop Invariant Derived loop invariant: (((((!(8656 == ssl3_accept_~s__state~4) && !(8672 == ssl3_accept_~s__state~4)) && ssl3_accept_~blastFlag~4 <= 2) && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4) - InvariantResult [Line: 236]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || (((((!(8512 == ssl3_accept_~s__state~4) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) && ssl3_accept_~s__state~4 <= 8576) && !(8448 == ssl3_accept_~s__state~4))) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 439]: Loop Invariant Derived loop invariant: ((((!(8672 == ssl3_accept_~s__state~4) && ssl3_accept_~blastFlag~4 <= 2) && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: (((((!(8656 == ssl3_accept_~s__state~4) && !(8672 == ssl3_accept_~s__state~4)) && ssl3_accept_~blastFlag~4 <= 2) && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4) - InvariantResult [Line: 447]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3 - InvariantResult [Line: 476]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || (((((!(8512 == ssl3_accept_~s__state~4) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) && ssl3_accept_~s__state~4 <= 8576) && !(8448 == ssl3_accept_~s__state~4))) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 291]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 304]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || ((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448) - InvariantResult [Line: 249]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. SAFE Result, 17.0s OverallTime, 18 OverallIterations, 19 TraceHistogramMax, 9.6s AutomataDifference, 0.0s DeadEndRemovalTime, 3.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 463 SDtfs, 165 SDslu, 184 SDs, 0 SdLazy, 673 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=395occurred in iteration=16, 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.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 166 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 19 PreInvPairs, 288 NumberOfFragments, 732 HoareAnnotationTreeSize, 19 FomulaSimplifications, 12030 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 19 FomulaSimplificationsInter, 1541 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1437 NumberOfCodeBlocks, 1437 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1417 ConstructedInterpolants, 0 QuantifiedInterpolants, 184792 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2058 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 5056/5080 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_srvr_3_alt.BV.c.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_20-47-41-424.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_3_alt.BV.c.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_20-47-41-424.csv Received shutdown request...