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_1.BV.c.cil.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f-m [2018-10-04 14:32:23,305 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 14:32:23,307 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 14:32:23,322 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 14:32:23,322 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 14:32:23,323 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 14:32:23,324 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 14:32:23,326 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 14:32:23,328 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 14:32:23,328 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 14:32:23,329 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 14:32:23,329 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 14:32:23,330 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 14:32:23,331 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 14:32:23,332 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 14:32:23,333 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 14:32:23,335 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 14:32:23,337 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 14:32:23,341 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 14:32:23,342 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 14:32:23,343 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 14:32:23,345 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 14:32:23,348 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 14:32:23,348 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 14:32:23,349 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 14:32:23,349 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 14:32:23,351 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 14:32:23,352 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 14:32:23,352 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 14:32:23,356 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 14:32:23,357 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 14:32:23,357 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 14:32:23,357 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 14:32:23,359 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 14:32:23,360 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 14:32:23,360 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 14:32:23,360 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 14:32:23,390 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 14:32:23,392 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 14:32:23,393 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 14:32:23,393 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 14:32:23,394 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 14:32:23,394 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 14:32:23,395 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 14:32:23,395 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 14:32:23,395 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 14:32:23,395 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 14:32:23,396 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 14:32:23,397 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 14:32:23,397 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 14:32:23,397 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 14:32:23,397 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 14:32:23,397 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 14:32:23,398 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 14:32:23,398 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 14:32:23,398 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 14:32:23,398 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 14:32:23,398 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 14:32:23,399 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 14:32:23,400 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:32:23,400 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 14:32:23,400 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 14:32:23,400 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 14:32:23,400 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 14:32:23,401 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 14:32:23,402 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 14:32:23,402 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 14:32:23,402 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 14:32:23,459 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 14:32:23,484 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 14:32:23,490 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 14:32:23,492 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 14:32:23,492 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 14:32:23,493 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.BV.c.cil.c_21.bpl [2018-10-04 14:32:23,493 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_1.BV.c.cil.c_21.bpl' [2018-10-04 14:32:23,580 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 14:32:23,581 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 14:32:23,582 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 14:32:23,582 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 14:32:23,582 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 14:32:23,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:32:23" (1/1) ... [2018-10-04 14:32:23,619 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:32:23" (1/1) ... [2018-10-04 14:32:23,626 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 14:32:23,627 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 14:32:23,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 14:32:23,628 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 14:32:23,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:32:23" (1/1) ... [2018-10-04 14:32:23,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:32:23" (1/1) ... [2018-10-04 14:32:23,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:32:23" (1/1) ... [2018-10-04 14:32:23,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:32:23" (1/1) ... [2018-10-04 14:32:23,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:32:23" (1/1) ... [2018-10-04 14:32:23,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:32:23" (1/1) ... [2018-10-04 14:32:23,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:32:23" (1/1) ... [2018-10-04 14:32:23,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 14:32:23,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 14:32:23,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 14:32:23,665 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 14:32:23,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:32: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-10-04 14:32:23,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 14:32:23,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 14:32:24,440 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 14:32:24,441 INFO L202 PluginConnector]: Adding new model s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:32:24 BoogieIcfgContainer [2018-10-04 14:32:24,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 14:32:24,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 14:32:24,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 14:32:24,446 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 14:32:24,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:32:23" (1/2) ... [2018-10-04 14:32:24,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b2049f8 and model type s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 02:32:24, skipping insertion in model container [2018-10-04 14:32:24,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:32:24" (2/2) ... [2018-10-04 14:32:24,449 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.BV.c.cil.c_21.bpl [2018-10-04 14:32:24,459 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 14:32:24,467 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 14:32:24,516 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 14:32:24,517 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 14:32:24,517 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 14:32:24,518 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 14:32:24,518 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 14:32:24,518 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 14:32:24,518 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 14:32:24,518 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 14:32:24,518 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 14:32:24,534 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-10-04 14:32:24,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:32:24,541 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:32:24,542 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:32:24,543 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:32:24,555 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:32:24,556 INFO L82 PathProgramCache]: Analyzing trace with hash -505433777, now seen corresponding path program 1 times [2018-10-04 14:32:24,558 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:32:24,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:32:24,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:24,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:32:24,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:32:24,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:32:24,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:32:24,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:32:24,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:32:24,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:32:24,807 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:32:24,809 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-10-04 14:32:25,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:32:25,201 INFO L93 Difference]: Finished difference Result 56 states and 94 transitions. [2018-10-04 14:32:25,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:32:25,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 14:32:25,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:32:25,217 INFO L225 Difference]: With dead ends: 56 [2018-10-04 14:32:25,217 INFO L226 Difference]: Without dead ends: 34 [2018-10-04 14:32:25,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:32:25,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-04 14:32:25,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-04 14:32:25,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 14:32:25,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-10-04 14:32:25,261 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 15 [2018-10-04 14:32:25,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:32:25,262 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2018-10-04 14:32:25,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:32:25,262 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2018-10-04 14:32:25,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 14:32:25,263 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:32:25,263 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:32:25,264 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:32:25,264 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:32:25,264 INFO L82 PathProgramCache]: Analyzing trace with hash -912155323, now seen corresponding path program 1 times [2018-10-04 14:32:25,264 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:32:25,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:32:25,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:25,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:32:25,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:32:25,352 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:32:25,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:32:25,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:32:25,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:32:25,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:32:25,355 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:32:25,355 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2018-10-04 14:32:25,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:32:25,624 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-10-04 14:32:25,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:32:25,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-04 14:32:25,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:32:25,627 INFO L225 Difference]: With dead ends: 83 [2018-10-04 14:32:25,627 INFO L226 Difference]: Without dead ends: 50 [2018-10-04 14:32:25,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:32:25,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-04 14:32:25,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-10-04 14:32:25,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-04 14:32:25,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 83 transitions. [2018-10-04 14:32:25,641 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 83 transitions. Word has length 23 [2018-10-04 14:32:25,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:32:25,642 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 83 transitions. [2018-10-04 14:32:25,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:32:25,642 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 83 transitions. [2018-10-04 14:32:25,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 14:32:25,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:32:25,644 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:32:25,644 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:32:25,644 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:32:25,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1423527905, now seen corresponding path program 1 times [2018-10-04 14:32:25,645 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:32:25,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:32:25,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:25,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:32:25,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:32:25,750 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-04 14:32:25,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:32:25,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:32:25,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:32:25,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:32:25,756 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:32:25,756 INFO L87 Difference]: Start difference. First operand 50 states and 83 transitions. Second operand 3 states. [2018-10-04 14:32:26,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:32:26,001 INFO L93 Difference]: Finished difference Result 106 states and 177 transitions. [2018-10-04 14:32:26,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:32:26,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-04 14:32:26,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:32:26,005 INFO L225 Difference]: With dead ends: 106 [2018-10-04 14:32:26,006 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 14:32:26,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:32:26,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 14:32:26,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-04 14:32:26,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-04 14:32:26,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 92 transitions. [2018-10-04 14:32:26,027 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 92 transitions. Word has length 30 [2018-10-04 14:32:26,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:32:26,030 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 92 transitions. [2018-10-04 14:32:26,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:32:26,030 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 92 transitions. [2018-10-04 14:32:26,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 14:32:26,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:32:26,032 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-10-04 14:32:26,032 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:32:26,032 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:32:26,033 INFO L82 PathProgramCache]: Analyzing trace with hash 222883017, now seen corresponding path program 1 times [2018-10-04 14:32:26,033 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:32:26,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:32:26,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:26,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:32:26,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:32:26,155 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:32:26,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:32:26,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:32:26,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:32:26,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:32:26,156 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:32:26,157 INFO L87 Difference]: Start difference. First operand 57 states and 92 transitions. Second operand 3 states. [2018-10-04 14:32:26,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:32:26,497 INFO L93 Difference]: Finished difference Result 131 states and 214 transitions. [2018-10-04 14:32:26,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:32:26,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-04 14:32:26,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:32:26,499 INFO L225 Difference]: With dead ends: 131 [2018-10-04 14:32:26,502 INFO L226 Difference]: Without dead ends: 74 [2018-10-04 14:32:26,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:32:26,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-04 14:32:26,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-10-04 14:32:26,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-04 14:32:26,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 120 transitions. [2018-10-04 14:32:26,526 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 120 transitions. Word has length 30 [2018-10-04 14:32:26,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:32:26,526 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 120 transitions. [2018-10-04 14:32:26,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:32:26,527 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 120 transitions. [2018-10-04 14:32:26,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 14:32:26,529 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:32:26,529 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-10-04 14:32:26,529 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:32:26,530 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:32:26,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1035189339, now seen corresponding path program 1 times [2018-10-04 14:32:26,531 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:32:26,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:32:26,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:26,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:32:26,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:32:26,640 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-04 14:32:26,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:32:26,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:32:26,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:32:26,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:32:26,641 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:32:26,642 INFO L87 Difference]: Start difference. First operand 74 states and 120 transitions. Second operand 3 states. [2018-10-04 14:32:26,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:32:26,891 INFO L93 Difference]: Finished difference Result 153 states and 249 transitions. [2018-10-04 14:32:26,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:32:26,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-04 14:32:26,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:32:26,893 INFO L225 Difference]: With dead ends: 153 [2018-10-04 14:32:26,894 INFO L226 Difference]: Without dead ends: 80 [2018-10-04 14:32:26,895 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:32:26,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-04 14:32:26,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-10-04 14:32:26,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-04 14:32:26,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 125 transitions. [2018-10-04 14:32:26,911 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 125 transitions. Word has length 36 [2018-10-04 14:32:26,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:32:26,911 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 125 transitions. [2018-10-04 14:32:26,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:32:26,911 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 125 transitions. [2018-10-04 14:32:26,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 14:32:26,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:32:26,916 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-10-04 14:32:26,916 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:32:26,916 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:32:26,917 INFO L82 PathProgramCache]: Analyzing trace with hash -720649021, now seen corresponding path program 1 times [2018-10-04 14:32:26,917 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:32:26,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:32:26,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:26,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:32:26,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:32:26,989 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-04 14:32:26,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:32:26,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:32:26,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:32:26,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:32:26,991 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:32:26,991 INFO L87 Difference]: Start difference. First operand 80 states and 125 transitions. Second operand 3 states. [2018-10-04 14:32:27,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:32:27,128 INFO L93 Difference]: Finished difference Result 164 states and 257 transitions. [2018-10-04 14:32:27,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:32:27,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-04 14:32:27,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:32:27,129 INFO L225 Difference]: With dead ends: 164 [2018-10-04 14:32:27,129 INFO L226 Difference]: Without dead ends: 85 [2018-10-04 14:32:27,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:32:27,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-04 14:32:27,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-10-04 14:32:27,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-04 14:32:27,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2018-10-04 14:32:27,145 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 41 [2018-10-04 14:32:27,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:32:27,145 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2018-10-04 14:32:27,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:32:27,146 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2018-10-04 14:32:27,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 14:32:27,149 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:32:27,149 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-10-04 14:32:27,149 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:32:27,150 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:32:27,150 INFO L82 PathProgramCache]: Analyzing trace with hash -2015268887, now seen corresponding path program 1 times [2018-10-04 14:32:27,150 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:32:27,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:32:27,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:27,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:32:27,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:32:27,201 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-04 14:32:27,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:32:27,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:32:27,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:32:27,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:32:27,202 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:32:27,203 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand 3 states. [2018-10-04 14:32:27,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:32:27,527 INFO L93 Difference]: Finished difference Result 181 states and 270 transitions. [2018-10-04 14:32:27,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:32:27,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-04 14:32:27,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:32:27,528 INFO L225 Difference]: With dead ends: 181 [2018-10-04 14:32:27,529 INFO L226 Difference]: Without dead ends: 96 [2018-10-04 14:32:27,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:32:27,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-04 14:32:27,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-10-04 14:32:27,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-04 14:32:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 140 transitions. [2018-10-04 14:32:27,548 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 140 transitions. Word has length 44 [2018-10-04 14:32:27,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:32:27,548 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 140 transitions. [2018-10-04 14:32:27,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:32:27,548 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 140 transitions. [2018-10-04 14:32:27,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-04 14:32:27,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:32:27,550 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:32:27,551 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:32:27,551 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:32:27,551 INFO L82 PathProgramCache]: Analyzing trace with hash 483195845, now seen corresponding path program 1 times [2018-10-04 14:32:27,551 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:32:27,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:32:27,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:27,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:32:27,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:32:27,640 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-04 14:32:27,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:32:27,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:32:27,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:32:27,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:32:27,642 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:32:27,642 INFO L87 Difference]: Start difference. First operand 96 states and 140 transitions. Second operand 3 states. [2018-10-04 14:32:27,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:32:27,782 INFO L93 Difference]: Finished difference Result 195 states and 285 transitions. [2018-10-04 14:32:27,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:32:27,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-10-04 14:32:27,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:32:27,784 INFO L225 Difference]: With dead ends: 195 [2018-10-04 14:32:27,785 INFO L226 Difference]: Without dead ends: 100 [2018-10-04 14:32:27,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:32:27,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-04 14:32:27,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-10-04 14:32:27,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-04 14:32:27,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 138 transitions. [2018-10-04 14:32:27,802 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 138 transitions. Word has length 45 [2018-10-04 14:32:27,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:32:27,803 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 138 transitions. [2018-10-04 14:32:27,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:32:27,803 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 138 transitions. [2018-10-04 14:32:27,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-04 14:32:27,805 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:32:27,805 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-10-04 14:32:27,805 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:32:27,806 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:32:27,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1326956691, now seen corresponding path program 1 times [2018-10-04 14:32:27,806 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:32:27,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:32:27,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:27,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:32:27,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:32:27,953 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-04 14:32:27,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:32:27,953 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:32:27,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:32:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:32:28,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:32:28,966 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-04 14:32:28,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 14:32:28,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-04 14:32:28,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:32:28,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:32:28,989 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:32:28,990 INFO L87 Difference]: Start difference. First operand 100 states and 138 transitions. Second operand 5 states. [2018-10-04 14:32:30,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:32:30,743 INFO L93 Difference]: Finished difference Result 441 states and 602 transitions. [2018-10-04 14:32:30,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:32:30,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-10-04 14:32:30,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:32:30,747 INFO L225 Difference]: With dead ends: 441 [2018-10-04 14:32:30,747 INFO L226 Difference]: Without dead ends: 328 [2018-10-04 14:32:30,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.3s impTime 6 [2018-10-04 14:32:30,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-04 14:32:30,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 187. [2018-10-04 14:32:30,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-04 14:32:30,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 247 transitions. [2018-10-04 14:32:30,808 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 247 transitions. Word has length 48 [2018-10-04 14:32:30,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:32:30,809 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 247 transitions. [2018-10-04 14:32:30,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:32:30,809 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 247 transitions. [2018-10-04 14:32:30,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-04 14:32:30,819 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:32:30,819 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:32:30,820 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:32:30,820 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:32:30,820 INFO L82 PathProgramCache]: Analyzing trace with hash 636359981, now seen corresponding path program 1 times [2018-10-04 14:32:30,820 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:32:30,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:32:30,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:30,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:32:30,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:32:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-04 14:32:30,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:32:30,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:32:30,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:32:30,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:32:30,941 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:32:30,941 INFO L87 Difference]: Start difference. First operand 187 states and 247 transitions. Second operand 3 states. [2018-10-04 14:32:31,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:32:31,406 INFO L93 Difference]: Finished difference Result 374 states and 495 transitions. [2018-10-04 14:32:31,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:32:31,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-10-04 14:32:31,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:32:31,408 INFO L225 Difference]: With dead ends: 374 [2018-10-04 14:32:31,408 INFO L226 Difference]: Without dead ends: 182 [2018-10-04 14:32:31,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:32:31,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-04 14:32:31,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-10-04 14:32:31,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-04 14:32:31,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 227 transitions. [2018-10-04 14:32:31,446 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 227 transitions. Word has length 64 [2018-10-04 14:32:31,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:32:31,446 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 227 transitions. [2018-10-04 14:32:31,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:32:31,446 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 227 transitions. [2018-10-04 14:32:31,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-04 14:32:31,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:32:31,449 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:32:31,449 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:32:31,449 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:32:31,449 INFO L82 PathProgramCache]: Analyzing trace with hash -739459377, now seen corresponding path program 1 times [2018-10-04 14:32:31,450 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:32:31,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:32:31,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:31,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:32:31,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:32:31,608 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-04 14:32:31,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:32:31,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:32:31,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:32:31,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:32:31,611 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:32:31,611 INFO L87 Difference]: Start difference. First operand 182 states and 227 transitions. Second operand 3 states. [2018-10-04 14:32:32,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:32:32,015 INFO L93 Difference]: Finished difference Result 381 states and 475 transitions. [2018-10-04 14:32:32,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:32:32,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-10-04 14:32:32,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:32:32,018 INFO L225 Difference]: With dead ends: 381 [2018-10-04 14:32:32,018 INFO L226 Difference]: Without dead ends: 202 [2018-10-04 14:32:32,019 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:32:32,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-10-04 14:32:32,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-10-04 14:32:32,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-04 14:32:32,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 247 transitions. [2018-10-04 14:32:32,053 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 247 transitions. Word has length 97 [2018-10-04 14:32:32,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:32:32,053 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 247 transitions. [2018-10-04 14:32:32,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:32:32,053 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 247 transitions. [2018-10-04 14:32:32,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-04 14:32:32,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:32:32,055 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-10-04 14:32:32,055 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:32:32,055 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:32:32,056 INFO L82 PathProgramCache]: Analyzing trace with hash -93746177, now seen corresponding path program 1 times [2018-10-04 14:32:32,056 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:32:32,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:32:32,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:32,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:32:32,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:32:32,188 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-10-04 14:32:32,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:32:32,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:32:32,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:32:32,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:32:32,189 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:32:32,190 INFO L87 Difference]: Start difference. First operand 202 states and 247 transitions. Second operand 3 states. [2018-10-04 14:32:32,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:32:32,397 INFO L93 Difference]: Finished difference Result 298 states and 365 transitions. [2018-10-04 14:32:32,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:32:32,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-10-04 14:32:32,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:32:32,400 INFO L225 Difference]: With dead ends: 298 [2018-10-04 14:32:32,400 INFO L226 Difference]: Without dead ends: 296 [2018-10-04 14:32:32,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:32:32,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-04 14:32:32,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2018-10-04 14:32:32,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-10-04 14:32:32,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 363 transitions. [2018-10-04 14:32:32,452 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 363 transitions. Word has length 107 [2018-10-04 14:32:32,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:32:32,453 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 363 transitions. [2018-10-04 14:32:32,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:32:32,453 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 363 transitions. [2018-10-04 14:32:32,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-04 14:32:32,455 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:32:32,455 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 12, 11, 10, 9, 8, 7, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 14:32:32,456 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:32:32,456 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:32:32,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1497686773, now seen corresponding path program 1 times [2018-10-04 14:32:32,456 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:32:32,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:32:32,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:32,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:32:32,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:32:32,674 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-10-04 14:32:32,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:32:32,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 14:32:32,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:32:32,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:32:32,676 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:32:32,676 INFO L87 Difference]: Start difference. First operand 296 states and 363 transitions. Second operand 3 states. [2018-10-04 14:32:32,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:32:32,981 INFO L93 Difference]: Finished difference Result 589 states and 723 transitions. [2018-10-04 14:32:32,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:32:32,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2018-10-04 14:32:32,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:32:32,983 INFO L225 Difference]: With dead ends: 589 [2018-10-04 14:32:32,983 INFO L226 Difference]: Without dead ends: 296 [2018-10-04 14:32:32,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:32:32,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-04 14:32:33,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2018-10-04 14:32:33,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-10-04 14:32:33,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 354 transitions. [2018-10-04 14:32:33,026 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 354 transitions. Word has length 147 [2018-10-04 14:32:33,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:32:33,026 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 354 transitions. [2018-10-04 14:32:33,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:32:33,026 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 354 transitions. [2018-10-04 14:32:33,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-04 14:32:33,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:32:33,029 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-10-04 14:32:33,029 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:32:33,029 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:32:33,029 INFO L82 PathProgramCache]: Analyzing trace with hash -663980831, now seen corresponding path program 1 times [2018-10-04 14:32:33,029 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:32:33,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:32:33,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:33,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:32:33,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:32:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:32:33,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 740 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-10-04 14:32:33,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:32:33,186 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:32:33,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:32:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:32:33,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:32:33,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 740 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-10-04 14:32:33,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:32:33,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 14:32:33,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 14:32:33,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 14:32:33,789 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:32:33,790 INFO L87 Difference]: Start difference. First operand 296 states and 354 transitions. Second operand 4 states. [2018-10-04 14:32:34,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:32:34,140 INFO L93 Difference]: Finished difference Result 470 states and 566 transitions. [2018-10-04 14:32:34,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 14:32:34,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-10-04 14:32:34,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:32:34,142 INFO L225 Difference]: With dead ends: 470 [2018-10-04 14:32:34,142 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 14:32:34,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.0s impTime 3 [2018-10-04 14:32:34,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 14:32:34,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 14:32:34,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 14:32:34,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 14:32:34,144 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2018-10-04 14:32:34,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:32:34,144 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 14:32:34,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 14:32:34,145 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 14:32:34,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 14:32:34,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 14:32:34,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:34,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 14:32:35,041 WARN L178 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-10-04 14:32:37,028 WARN L178 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-10-04 14:32:37,420 WARN L178 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2018-10-04 14:32:37,874 WARN L178 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 23 [2018-10-04 14:32:38,526 WARN L178 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-10-04 14:32:38,793 WARN L178 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2018-10-04 14:32:38,960 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2018-10-04 14:32:39,448 WARN L178 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-10-04 14:32:39,666 WARN L178 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-10-04 14:32:39,786 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2018-10-04 14:32:39,947 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2018-10-04 14:32:40,113 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-10-04 14:32:40,267 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-10-04 14:32:40,561 WARN L178 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2018-10-04 14:32:40,711 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2018-10-04 14:32:40,715 INFO L421 ceAbstractionStarter]: At program point L477(lines 252 477) the Hoare annotation is: (let ((.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 .cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-10-04 14:32:40,715 INFO L421 ceAbstractionStarter]: At program point L279(lines 279 289) the Hoare annotation is: (let ((.cse2 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse3 .cse1 .cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse3 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)))) [2018-10-04 14:32:40,715 INFO L421 ceAbstractionStarter]: At program point L366(lines 366 378) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse1 .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576) .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) .cse3 .cse4))) [2018-10-04 14:32:40,715 INFO L421 ceAbstractionStarter]: At program point L333(lines 333 344) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3)) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse8 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576)) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse7 .cse5 .cse6) (and .cse0 .cse2 .cse7 .cse3 .cse4 .cse8 .cse5 .cse6) (and .cse9 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse2 .cse3 .cse8 .cse5 .cse6))) [2018-10-04 14:32:40,715 INFO L421 ceAbstractionStarter]: At program point L453(lines 450 469) the Hoare annotation is: (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) [2018-10-04 14:32:40,716 INFO L421 ceAbstractionStarter]: At program point L292(lines 292 308) the Hoare annotation is: (let ((.cse3 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3)) (.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse0 .cse4 .cse2 .cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse4 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)))) [2018-10-04 14:32:40,716 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 3 480) no Hoare annotation was computed. [2018-10-04 14:32:40,716 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 3 480) no Hoare annotation was computed. [2018-10-04 14:32:40,716 INFO L421 ceAbstractionStarter]: At program point L346(lines 346 363) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse1 .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576) .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) .cse3 .cse4))) [2018-10-04 14:32:40,716 INFO L421 ceAbstractionStarter]: At program point L408(lines 408 431) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse0 .cse1) (and (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-10-04 14:32:40,716 INFO L421 ceAbstractionStarter]: At program point L404(lines 404 415) the Hoare annotation is: (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) [2018-10-04 14:32:40,716 INFO L421 ceAbstractionStarter]: At program point L396(lines 396 405) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse1 .cse2 .cse3) (and .cse0 (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-10-04 14:32:40,717 INFO L421 ceAbstractionStarter]: At program point L417(lines 414 439) the Hoare annotation is: (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) [2018-10-04 14:32:40,717 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 3 480) no Hoare annotation was computed. [2018-10-04 14:32:40,717 INFO L421 ceAbstractionStarter]: At program point L438(lines 438 460) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) [2018-10-04 14:32:40,717 INFO L421 ceAbstractionStarter]: At program point L430(lines 430 451) the Hoare annotation is: (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) [2018-10-04 14:32:40,717 INFO L421 ceAbstractionStarter]: At program point L459(lines 459 478) the Hoare annotation is: false [2018-10-04 14:32:40,717 INFO L421 ceAbstractionStarter]: At program point L261(lines 224 261) the Hoare annotation is: (let ((.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 .cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-10-04 14:32:40,717 INFO L421 ceAbstractionStarter]: At program point L257(lines 257 276) the Hoare annotation is: (let ((.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 .cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-10-04 14:32:40,717 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 479) no Hoare annotation was computed. [2018-10-04 14:32:40,717 INFO L421 ceAbstractionStarter]: At program point L381(lines 381 393) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse1 .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576) .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) .cse3 .cse4))) [2018-10-04 14:32:40,718 INFO L421 ceAbstractionStarter]: At program point L311(lines 311 328) the Hoare annotation is: (let ((.cse3 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse8 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576)) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3)) (.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse2 .cse3 .cse8 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse1 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse7 .cse2 .cse9 .cse5))) [2018-10-04 14:32:40,718 INFO L421 ceAbstractionStarter]: At program point L237(lines 237 253) the Hoare annotation is: (let ((.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3))) (or (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 .cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (and .cse0 (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-10-04 14:32:40,738 INFO L202 PluginConnector]: Adding new model s3_srvr_1.BV.c.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 02:32:40 BoogieIcfgContainer [2018-10-04 14:32:40,738 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 14:32:40,739 INFO L168 Benchmark]: Toolchain (without parser) took 17158.51 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.6 GB in the end (delta: -88.0 MB). Peak memory consumption was 592.0 MB. Max. memory is 7.1 GB. [2018-10-04 14:32:40,740 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:32:40,741 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.03 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:32:40,741 INFO L168 Benchmark]: Boogie Preprocessor took 36.54 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:32:40,742 INFO L168 Benchmark]: RCFGBuilder took 777.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-10-04 14:32:40,743 INFO L168 Benchmark]: TraceAbstraction took 16295.76 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.6 GB in the end (delta: -119.7 MB). Peak memory consumption was 560.3 MB. Max. memory is 7.1 GB. [2018-10-04 14:32:40,748 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.03 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.54 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 777.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 16295.76 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.6 GB in the end (delta: -119.7 MB). Peak memory consumption was 560.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 479]: 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: 224]: Loop Invariant Derived loop invariant: (((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || ((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 366]: Loop Invariant Derived loop invariant: ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: (((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8640 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5) - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: (((ssl3_accept_~blastFlag~5 <= 2 && !(8448 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (((!(8656 == ssl3_accept_~s__state~5) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 333]: Loop Invariant Derived loop invariant: (((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 311]: Loop Invariant Derived loop invariant: ((((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5))) || (((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 396]: Loop Invariant Derived loop invariant: (((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && !(8656 == ssl3_accept_~s__state~5)) && !(8640 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 414]: Loop Invariant Derived loop invariant: (((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8656 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5) - InvariantResult [Line: 438]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5 - InvariantResult [Line: 459]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: (((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8656 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5) - InvariantResult [Line: 252]: Loop Invariant Derived loop invariant: (((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || ((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 381]: Loop Invariant Derived loop invariant: ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || ((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (((ssl3_accept_~blastFlag~5 <= 2 && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((ssl3_accept_~blastFlag~5 <= 2 && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || ((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: (((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && !(8640 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 292]: Loop Invariant Derived loop invariant: (((((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 3) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || ((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. SAFE Result, 16.2s OverallTime, 14 OverallIterations, 19 TraceHistogramMax, 5.6s AutomataDifference, 0.0s DeadEndRemovalTime, 6.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 278 SDtfs, 197 SDslu, 137 SDs, 0 SdLazy, 547 SolverSat, 194 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=296occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 141 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 19 PreInvPairs, 220 NumberOfFragments, 1025 HoareAnnotationTreeSize, 19 FomulaSimplifications, 8878 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 19 FomulaSimplificationsInter, 3305 FormulaSimplificationTreeSizeReductionInter, 6.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1151 NumberOfCodeBlocks, 1151 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1135 ConstructedInterpolants, 0 QuantifiedInterpolants, 162691 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1181 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 4505/4529 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_1.BV.c.cil.c_21.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_14-32-40-766.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_1.BV.c.cil.c_21.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_14-32-40-766.csv Received shutdown request...