java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_7.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:28:07,051 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:28:07,053 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:28:07,070 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:28:07,070 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:28:07,072 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:28:07,073 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:28:07,076 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:28:07,078 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:28:07,079 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:28:07,081 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:28:07,082 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:28:07,083 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:28:07,090 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:28:07,091 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:28:07,092 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:28:07,098 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:28:07,101 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:28:07,105 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:28:07,108 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:28:07,110 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:28:07,111 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:28:07,113 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:28:07,114 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:28:07,114 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:28:07,118 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:28:07,120 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:28:07,121 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:28:07,122 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:28:07,125 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:28:07,125 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:28:07,127 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:28:07,127 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:28:07,128 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:28:07,130 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:28:07,132 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:28:07,133 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 12:28:07,150 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:28:07,150 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:28:07,151 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:28:07,151 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:28:07,152 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:28:07,152 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:28:07,152 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:28:07,152 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:28:07,152 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:28:07,153 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:28:07,153 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:28:07,153 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:28:07,153 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:28:07,153 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:28:07,154 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:28:07,154 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:28:07,154 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:28:07,154 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:28:07,154 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:28:07,155 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:28:07,155 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:28:07,155 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:28:07,155 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:28:07,155 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:28:07,156 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:28:07,156 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:28:07,156 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:28:07,156 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:28:07,156 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:28:07,156 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:28:07,200 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:28:07,213 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:28:07,218 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:28:07,220 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:28:07,220 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:28:07,221 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_7.cil.c_19.bpl [2018-10-04 12:28:07,221 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_7.cil.c_19.bpl' [2018-10-04 12:28:07,308 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:28:07,309 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:28:07,310 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:28:07,310 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:28:07,310 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:28:07,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:07" (1/1) ... [2018-10-04 12:28:07,348 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:07" (1/1) ... [2018-10-04 12:28:07,359 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:28:07,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:28:07,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:28:07,360 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:28:07,371 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:07" (1/1) ... [2018-10-04 12:28:07,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:07" (1/1) ... [2018-10-04 12:28:07,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:07" (1/1) ... [2018-10-04 12:28:07,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:07" (1/1) ... [2018-10-04 12:28:07,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:07" (1/1) ... [2018-10-04 12:28:07,385 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:07" (1/1) ... [2018-10-04 12:28:07,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:07" (1/1) ... [2018-10-04 12:28:07,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:28:07,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:28:07,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:28:07,393 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:28:07,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:28:07,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:28:07,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:28:08,083 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:28:08,084 INFO L202 PluginConnector]: Adding new model s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:28:08 BoogieIcfgContainer [2018-10-04 12:28:08,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:28:08,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:28:08,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:28:08,088 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:28:08,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:07" (1/2) ... [2018-10-04 12:28:08,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f5f67a3 and model type s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:28:08, skipping insertion in model container [2018-10-04 12:28:08,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:28:08" (2/2) ... [2018-10-04 12:28:08,092 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_7.cil.c_19.bpl [2018-10-04 12:28:08,101 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:28:08,110 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:28:08,153 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:28:08,154 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:28:08,154 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:28:08,154 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:28:08,154 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:28:08,154 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:28:08,154 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:28:08,155 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:28:08,155 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:28:08,172 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-10-04 12:28:08,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 12:28:08,178 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:08,179 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:28:08,180 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:08,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:08,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1807955439, now seen corresponding path program 1 times [2018-10-04 12:28:08,189 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:08,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:08,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:08,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:08,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:08,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:08,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:08,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:28:08,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:08,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:08,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:08,437 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-10-04 12:28:08,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:08,580 INFO L93 Difference]: Finished difference Result 29 states and 44 transitions. [2018-10-04 12:28:08,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:08,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-10-04 12:28:08,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:08,596 INFO L225 Difference]: With dead ends: 29 [2018-10-04 12:28:08,596 INFO L226 Difference]: Without dead ends: 16 [2018-10-04 12:28:08,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:08,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-04 12:28:08,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-04 12:28:08,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 12:28:08,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 12:28:08,642 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 7 [2018-10-04 12:28:08,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:08,643 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 12:28:08,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:08,643 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 12:28:08,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:28:08,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:08,644 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:28:08,645 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:08,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:08,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1100281751, now seen corresponding path program 1 times [2018-10-04 12:28:08,645 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:08,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:08,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:08,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:08,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:08,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:08,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:08,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:28:08,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:08,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:08,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:08,727 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 3 states. [2018-10-04 12:28:08,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:08,926 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2018-10-04 12:28:08,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:08,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-04 12:28:08,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:08,928 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:28:08,928 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 12:28:08,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:08,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 12:28:08,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-04 12:28:08,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:28:08,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-10-04 12:28:08,942 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 10 [2018-10-04 12:28:08,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:08,944 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2018-10-04 12:28:08,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:08,944 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2018-10-04 12:28:08,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:28:08,946 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:08,946 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:28:08,947 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:08,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:08,947 INFO L82 PathProgramCache]: Analyzing trace with hash -2082374887, now seen corresponding path program 1 times [2018-10-04 12:28:08,948 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:08,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:08,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:08,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:08,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:09,087 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:28:09,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:09,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:28:09,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:09,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:09,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:09,089 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand 3 states. [2018-10-04 12:28:09,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:09,198 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2018-10-04 12:28:09,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:09,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-04 12:28:09,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:09,200 INFO L225 Difference]: With dead ends: 44 [2018-10-04 12:28:09,200 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 12:28:09,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:09,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 12:28:09,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-10-04 12:28:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:28:09,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-10-04 12:28:09,213 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 14 [2018-10-04 12:28:09,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:09,214 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-10-04 12:28:09,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:09,214 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2018-10-04 12:28:09,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 12:28:09,216 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:09,216 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:28:09,216 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:09,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:09,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1026052440, now seen corresponding path program 1 times [2018-10-04 12:28:09,217 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:09,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:09,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:09,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:09,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:09,368 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:28:09,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:09,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:28:09,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:09,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:09,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:09,370 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 3 states. [2018-10-04 12:28:09,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:09,582 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2018-10-04 12:28:09,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:09,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-04 12:28:09,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:09,584 INFO L225 Difference]: With dead ends: 56 [2018-10-04 12:28:09,584 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:28:09,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:09,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:28:09,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-04 12:28:09,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 12:28:09,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-10-04 12:28:09,593 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 23 [2018-10-04 12:28:09,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:09,593 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-10-04 12:28:09,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:09,593 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-10-04 12:28:09,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-04 12:28:09,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:09,595 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:28:09,595 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:09,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:09,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1274183299, now seen corresponding path program 1 times [2018-10-04 12:28:09,596 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:09,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:09,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:09,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:09,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:09,672 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-04 12:28:09,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:09,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:28:09,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:09,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:09,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:09,674 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 3 states. [2018-10-04 12:28:09,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:09,718 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2018-10-04 12:28:09,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:09,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-10-04 12:28:09,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:09,721 INFO L225 Difference]: With dead ends: 73 [2018-10-04 12:28:09,721 INFO L226 Difference]: Without dead ends: 42 [2018-10-04 12:28:09,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:09,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-04 12:28:09,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-10-04 12:28:09,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-04 12:28:09,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-10-04 12:28:09,732 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 32 [2018-10-04 12:28:09,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:09,733 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-10-04 12:28:09,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:09,733 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-10-04 12:28:09,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-04 12:28:09,734 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:09,734 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:28:09,735 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:09,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:09,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1954241669, now seen corresponding path program 1 times [2018-10-04 12:28:09,735 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:09,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:09,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:09,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:09,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:09,828 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-04 12:28:09,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:09,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:28:09,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:09,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:09,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:09,830 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 3 states. [2018-10-04 12:28:10,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:10,007 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2018-10-04 12:28:10,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:10,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-10-04 12:28:10,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:10,009 INFO L225 Difference]: With dead ends: 86 [2018-10-04 12:28:10,009 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:28:10,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:10,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:28:10,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-04 12:28:10,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-04 12:28:10,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-10-04 12:28:10,018 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 32 [2018-10-04 12:28:10,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:10,019 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-10-04 12:28:10,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:10,019 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-10-04 12:28:10,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-04 12:28:10,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:10,020 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:28:10,021 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:10,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:10,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1319638523, now seen corresponding path program 1 times [2018-10-04 12:28:10,021 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:10,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:10,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:10,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:10,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:10,095 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-04 12:28:10,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:10,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:28:10,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:10,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:10,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:10,097 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 3 states. [2018-10-04 12:28:10,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:10,191 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2018-10-04 12:28:10,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:10,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-10-04 12:28:10,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:10,194 INFO L225 Difference]: With dead ends: 64 [2018-10-04 12:28:10,194 INFO L226 Difference]: Without dead ends: 62 [2018-10-04 12:28:10,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:10,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-04 12:28:10,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-10-04 12:28:10,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-04 12:28:10,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2018-10-04 12:28:10,205 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 37 [2018-10-04 12:28:10,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:10,206 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2018-10-04 12:28:10,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:10,206 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2018-10-04 12:28:10,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-04 12:28:10,207 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:10,207 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:28:10,208 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:10,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:10,208 INFO L82 PathProgramCache]: Analyzing trace with hash 158773189, now seen corresponding path program 1 times [2018-10-04 12:28:10,208 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:10,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:10,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:10,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:10,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:10,302 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-04 12:28:10,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:10,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:28:10,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:10,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:10,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:10,304 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 3 states. [2018-10-04 12:28:10,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:10,368 INFO L93 Difference]: Finished difference Result 120 states and 143 transitions. [2018-10-04 12:28:10,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:10,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-10-04 12:28:10,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:10,370 INFO L225 Difference]: With dead ends: 120 [2018-10-04 12:28:10,370 INFO L226 Difference]: Without dead ends: 62 [2018-10-04 12:28:10,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:10,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-04 12:28:10,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-10-04 12:28:10,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-04 12:28:10,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2018-10-04 12:28:10,381 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 37 [2018-10-04 12:28:10,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:10,381 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2018-10-04 12:28:10,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:10,382 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2018-10-04 12:28:10,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-04 12:28:10,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:10,384 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:28:10,384 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:10,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:10,384 INFO L82 PathProgramCache]: Analyzing trace with hash 336869209, now seen corresponding path program 1 times [2018-10-04 12:28:10,385 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:10,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:10,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:10,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:10,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:10,573 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 127 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-10-04 12:28:10,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:10,574 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:28:10,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:10,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:10,741 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 127 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-10-04 12:28:10,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:10,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:28:10,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:28:10,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:28:10,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:28:10,766 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand 4 states. [2018-10-04 12:28:11,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:11,194 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2018-10-04 12:28:11,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:28:11,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-10-04 12:28:11,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:11,195 INFO L225 Difference]: With dead ends: 118 [2018-10-04 12:28:11,195 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:28:11,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:28:11,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:28:11,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:28:11,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:28:11,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:28:11,198 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2018-10-04 12:28:11,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:11,198 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:28:11,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:28:11,198 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:28:11,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:28:11,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:28:11,537 WARN L178 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 22 [2018-10-04 12:28:11,648 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2018-10-04 12:28:11,875 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2018-10-04 12:28:12,131 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-10-04 12:28:12,214 INFO L421 ceAbstractionStarter]: At program point L382(lines 377 392) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) [2018-10-04 12:28:12,214 INFO L421 ceAbstractionStarter]: At program point L337(lines 337 348) the Hoare annotation is: (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 4) (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656))) [2018-10-04 12:28:12,215 INFO L421 ceAbstractionStarter]: At program point L271(lines 271 287) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8496)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8464)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)))) [2018-10-04 12:28:12,215 INFO L421 ceAbstractionStarter]: At program point L391(lines 388 398) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 4) (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) [2018-10-04 12:28:12,215 INFO L421 ceAbstractionStarter]: At program point L354(lines 351 364) the Hoare annotation is: (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)) (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 4) (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640))) [2018-10-04 12:28:12,215 INFO L421 ceAbstractionStarter]: At program point L321(lines 321 329) the Hoare annotation is: (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 4) (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656))) [2018-10-04 12:28:12,215 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 405) no Hoare annotation was computed. [2018-10-04 12:28:12,216 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 405) no Hoare annotation was computed. [2018-10-04 12:28:12,216 INFO L421 ceAbstractionStarter]: At program point L404(lines 286 404) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8496)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)))) [2018-10-04 12:28:12,216 INFO L421 ceAbstractionStarter]: At program point L371(lines 371 389) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) [2018-10-04 12:28:12,216 INFO L421 ceAbstractionStarter]: At program point L363(lines 363 378) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8656))) (or (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse0) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) .cse0))) [2018-10-04 12:28:12,217 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 405) no Hoare annotation was computed. [2018-10-04 12:28:12,217 INFO L421 ceAbstractionStarter]: At program point L347(lines 347 352) the Hoare annotation is: false [2018-10-04 12:28:12,217 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 353) no Hoare annotation was computed. [2018-10-04 12:28:12,217 INFO L421 ceAbstractionStarter]: At program point L295(lines 258 295) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8496)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640)) (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8464)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)))) [2018-10-04 12:28:12,217 INFO L421 ceAbstractionStarter]: At program point L291(lines 291 310) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~5 8496)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8640) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8640)) (and (= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) (= ULTIMATE.start_ssl3_accept_~s__state~5 8656)))) [2018-10-04 12:28:12,233 INFO L202 PluginConnector]: Adding new model s3_srvr_7.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:28:12 BoogieIcfgContainer [2018-10-04 12:28:12,233 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:28:12,234 INFO L168 Benchmark]: Toolchain (without parser) took 4925.99 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 267.0 MB). Peak memory consumption was 267.0 MB. Max. memory is 7.1 GB. [2018-10-04 12:28:12,236 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:28:12,236 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:28:12,237 INFO L168 Benchmark]: Boogie Preprocessor took 32.44 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:28:12,237 INFO L168 Benchmark]: RCFGBuilder took 691.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 12:28:12,238 INFO L168 Benchmark]: TraceAbstraction took 4148.55 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 235.2 MB). Peak memory consumption was 235.2 MB. Max. memory is 7.1 GB. [2018-10-04 12:28:12,243 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.20 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 49.25 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 32.44 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 691.59 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 4148.55 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 235.2 MB). Peak memory consumption was 235.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 353]: 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: 271]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~5 <= 4 && ssl3_accept_~s__state~5 == 8496) || (ssl3_accept_~blastFlag~5 == 3 && 8656 <= ssl3_accept_~s__state~5)) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 4) && ssl3_accept_~s__state~5 <= 8640)) || (ssl3_accept_~blastFlag~5 <= 4 && ssl3_accept_~s__state~5 == 8464)) || (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) - InvariantResult [Line: 286]: Loop Invariant Derived loop invariant: (((ssl3_accept_~blastFlag~5 <= 4 && ssl3_accept_~s__state~5 == 8496) || (ssl3_accept_~blastFlag~5 == 3 && 8656 <= ssl3_accept_~s__state~5)) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 4) && ssl3_accept_~s__state~5 <= 8640)) || (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) - InvariantResult [Line: 377]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 == 3 && ssl3_accept_~s__state~5 == 8656 - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 == 3 && 8656 <= ssl3_accept_~s__state~5 - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: ((ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) || ssl3_accept_~blastFlag~5 == 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 4) && ssl3_accept_~s__state~5 <= 8640) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 <= 4 && 8656 <= ssl3_accept_~s__state~5 - InvariantResult [Line: 258]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~5 <= 4 && ssl3_accept_~s__state~5 == 8496) || (ssl3_accept_~blastFlag~5 == 3 && 8656 <= ssl3_accept_~s__state~5)) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 4) && ssl3_accept_~s__state~5 <= 8640)) || (ssl3_accept_~blastFlag~5 <= 4 && ssl3_accept_~s__state~5 == 8464)) || (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: ((ssl3_accept_~blastFlag~5 == 3 && 8656 <= ssl3_accept_~s__state~5) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 4) && ssl3_accept_~s__state~5 <= 8640)) || (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) - InvariantResult [Line: 337]: Loop Invariant Derived loop invariant: ((ssl3_accept_~blastFlag~5 == 3 && 8656 <= ssl3_accept_~s__state~5) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 4) && ssl3_accept_~s__state~5 <= 8640)) || (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) || (ssl3_accept_~blastFlag~5 == 3 && ssl3_accept_~s__state~5 == 8656) - InvariantResult [Line: 291]: Loop Invariant Derived loop invariant: (((ssl3_accept_~blastFlag~5 <= 4 && ssl3_accept_~s__state~5 == 8496) || (ssl3_accept_~blastFlag~5 == 3 && 8656 <= ssl3_accept_~s__state~5)) || ((ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8640 && ssl3_accept_~blastFlag~5 <= 4) && ssl3_accept_~s__state~5 <= 8640)) || (ssl3_accept_~blastFlag~5 == 2 && ssl3_accept_~s__state~5 == 8656) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. SAFE Result, 4.0s OverallTime, 9 OverallIterations, 9 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 170 SDtfs, 25 SDslu, 75 SDs, 0 SdLazy, 143 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=8, 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.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 71 NumberOfFragments, 250 HoareAnnotationTreeSize, 12 FomulaSimplifications, 381 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 94 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 312 NumberOfCodeBlocks, 312 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 302 ConstructedInterpolants, 0 QuantifiedInterpolants, 17946 SizeOfPredicates, 2 NumberOfNonLiveVariables, 463 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 556/566 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_7.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-28-12-259.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_7.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-28-12-259.csv Received shutdown request...