java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_4.cil.c_20.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-00a8621 [2018-09-30 10:28:36,277 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:28:36,279 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:28:36,294 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:28:36,294 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:28:36,295 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:28:36,297 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:28:36,299 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:28:36,301 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:28:36,302 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:28:36,302 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:28:36,303 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:28:36,304 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:28:36,305 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:28:36,306 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:28:36,307 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:28:36,308 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:28:36,310 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:28:36,312 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:28:36,314 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:28:36,315 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:28:36,317 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:28:36,322 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:28:36,323 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:28:36,323 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:28:36,326 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:28:36,327 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:28:36,328 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:28:36,331 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:28:36,332 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:28:36,335 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:28:36,336 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:28:36,336 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:28:36,336 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:28:36,340 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:28:36,341 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:28:36,341 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 10:28:36,367 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:28:36,367 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:28:36,368 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:28:36,368 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:28:36,369 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:28:36,369 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:28:36,374 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:28:36,374 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:28:36,374 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:28:36,375 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:28:36,375 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:28:36,375 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:28:36,375 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:28:36,375 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:28:36,376 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:28:36,376 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:28:36,376 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:28:36,376 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:28:36,376 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:28:36,377 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:28:36,377 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:28:36,377 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:28:36,377 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:28:36,378 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:28:36,378 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:28:36,378 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:28:36,378 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:28:36,378 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:28:36,379 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:28:36,379 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:28:36,426 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:28:36,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:28:36,448 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:28:36,450 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:28:36,450 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:28:36,451 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_4.cil.c_20.bpl [2018-09-30 10:28:36,452 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_4.cil.c_20.bpl' [2018-09-30 10:28:36,551 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:28:36,554 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:28:36,555 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:28:36,555 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:28:36,555 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:28:36,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:36" (1/1) ... [2018-09-30 10:28:36,597 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:36" (1/1) ... [2018-09-30 10:28:36,611 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:28:36,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:28:36,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:28:36,612 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:28:36,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:36" (1/1) ... [2018-09-30 10:28:36,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:36" (1/1) ... [2018-09-30 10:28:36,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:36" (1/1) ... [2018-09-30 10:28:36,636 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:36" (1/1) ... [2018-09-30 10:28:36,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:36" (1/1) ... [2018-09-30 10:28:36,661 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:36" (1/1) ... [2018-09-30 10:28:36,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:36" (1/1) ... [2018-09-30 10:28:36,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:28:36,679 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:28:36,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:28:36,679 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:28:36,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:28:36,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 10:28:36,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 10:28:37,408 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 10:28:37,409 INFO L202 PluginConnector]: Adding new model s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:28:37 BoogieIcfgContainer [2018-09-30 10:28:37,409 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:28:37,410 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:28:37,410 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:28:37,413 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:28:37,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:28:36" (1/2) ... [2018-09-30 10:28:37,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3cb386 and model type s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:28:37, skipping insertion in model container [2018-09-30 10:28:37,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:28:37" (2/2) ... [2018-09-30 10:28:37,417 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_4.cil.c_20.bpl [2018-09-30 10:28:37,427 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:28:37,435 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 10:28:37,482 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:28:37,483 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:28:37,483 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:28:37,483 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:28:37,483 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:28:37,483 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:28:37,483 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:28:37,484 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:28:37,484 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:28:37,499 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-09-30 10:28:37,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 10:28:37,506 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:37,507 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:37,508 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:37,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:37,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1912788263, now seen corresponding path program 1 times [2018-09-30 10:28:37,517 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:37,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:37,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:37,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:37,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:37,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:28:37,706 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:37,706 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:28:37,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:37,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:37,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:37,725 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-09-30 10:28:37,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:37,957 INFO L93 Difference]: Finished difference Result 41 states and 68 transitions. [2018-09-30 10:28:37,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:37,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-09-30 10:28:37,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:37,973 INFO L225 Difference]: With dead ends: 41 [2018-09-30 10:28:37,974 INFO L226 Difference]: Without dead ends: 22 [2018-09-30 10:28:37,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:37,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-30 10:28:38,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-09-30 10:28:38,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-30 10:28:38,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 34 transitions. [2018-09-30 10:28:38,016 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 34 transitions. Word has length 10 [2018-09-30 10:28:38,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:38,017 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 34 transitions. [2018-09-30 10:28:38,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:38,017 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 34 transitions. [2018-09-30 10:28:38,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:28:38,018 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:38,018 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:38,018 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:38,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:38,018 INFO L82 PathProgramCache]: Analyzing trace with hash -694562177, now seen corresponding path program 1 times [2018-09-30 10:28:38,019 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:38,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:38,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:38,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:38,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:38,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:28:38,115 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:38,116 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:28:38,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:38,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:38,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:38,118 INFO L87 Difference]: Start difference. First operand 22 states and 34 transitions. Second operand 3 states. [2018-09-30 10:28:38,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:38,507 INFO L93 Difference]: Finished difference Result 45 states and 71 transitions. [2018-09-30 10:28:38,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:38,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-09-30 10:28:38,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:38,510 INFO L225 Difference]: With dead ends: 45 [2018-09-30 10:28:38,510 INFO L226 Difference]: Without dead ends: 26 [2018-09-30 10:28:38,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:38,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-30 10:28:38,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-30 10:28:38,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-30 10:28:38,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2018-09-30 10:28:38,524 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 13 [2018-09-30 10:28:38,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:38,525 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2018-09-30 10:28:38,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:38,525 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2018-09-30 10:28:38,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-30 10:28:38,534 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:38,534 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:38,537 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:38,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:38,537 INFO L82 PathProgramCache]: Analyzing trace with hash 479561661, now seen corresponding path program 1 times [2018-09-30 10:28:38,538 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:38,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:38,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:38,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:38,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:38,681 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 10:28:38,682 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:38,682 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:28:38,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:38,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:38,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:38,683 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand 3 states. [2018-09-30 10:28:38,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:38,872 INFO L93 Difference]: Finished difference Result 54 states and 81 transitions. [2018-09-30 10:28:38,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:38,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-09-30 10:28:38,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:38,874 INFO L225 Difference]: With dead ends: 54 [2018-09-30 10:28:38,874 INFO L226 Difference]: Without dead ends: 31 [2018-09-30 10:28:38,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:38,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-30 10:28:38,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-30 10:28:38,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-30 10:28:38,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-09-30 10:28:38,882 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 17 [2018-09-30 10:28:38,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:38,882 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-09-30 10:28:38,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:38,883 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-09-30 10:28:38,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 10:28:38,884 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:38,884 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:38,884 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:38,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:38,885 INFO L82 PathProgramCache]: Analyzing trace with hash 2107505391, now seen corresponding path program 1 times [2018-09-30 10:28:38,885 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:38,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:38,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:38,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:38,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:38,983 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-30 10:28:38,983 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:38,983 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:28:38,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:38,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:38,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:38,985 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states. [2018-09-30 10:28:39,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:39,152 INFO L93 Difference]: Finished difference Result 65 states and 93 transitions. [2018-09-30 10:28:39,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:39,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-09-30 10:28:39,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:39,155 INFO L225 Difference]: With dead ends: 65 [2018-09-30 10:28:39,155 INFO L226 Difference]: Without dead ends: 37 [2018-09-30 10:28:39,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:39,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-30 10:28:39,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-30 10:28:39,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-30 10:28:39,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2018-09-30 10:28:39,166 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 22 [2018-09-30 10:28:39,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:39,167 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2018-09-30 10:28:39,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:39,167 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2018-09-30 10:28:39,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-30 10:28:39,168 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:39,168 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:39,169 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:39,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:39,170 INFO L82 PathProgramCache]: Analyzing trace with hash -2123032451, now seen corresponding path program 1 times [2018-09-30 10:28:39,170 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:39,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:39,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:39,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:39,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:39,279 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-09-30 10:28:39,280 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:39,280 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:28:39,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:39,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:39,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:39,281 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand 3 states. [2018-09-30 10:28:39,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:39,531 INFO L93 Difference]: Finished difference Result 78 states and 107 transitions. [2018-09-30 10:28:39,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:39,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-30 10:28:39,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:39,532 INFO L225 Difference]: With dead ends: 78 [2018-09-30 10:28:39,533 INFO L226 Difference]: Without dead ends: 44 [2018-09-30 10:28:39,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:39,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-30 10:28:39,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-09-30 10:28:39,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-30 10:28:39,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2018-09-30 10:28:39,541 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 30 [2018-09-30 10:28:39,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:39,542 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2018-09-30 10:28:39,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:39,542 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2018-09-30 10:28:39,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-30 10:28:39,543 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:39,544 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:39,544 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:39,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:39,544 INFO L82 PathProgramCache]: Analyzing trace with hash -919972413, now seen corresponding path program 1 times [2018-09-30 10:28:39,544 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:39,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:39,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:39,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:39,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:39,668 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-09-30 10:28:39,669 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:39,669 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:28:39,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:39,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:39,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:39,670 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 3 states. [2018-09-30 10:28:39,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:39,711 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2018-09-30 10:28:39,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:39,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-09-30 10:28:39,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:39,713 INFO L225 Difference]: With dead ends: 94 [2018-09-30 10:28:39,713 INFO L226 Difference]: Without dead ends: 53 [2018-09-30 10:28:39,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:39,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-30 10:28:39,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-30 10:28:39,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-30 10:28:39,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2018-09-30 10:28:39,722 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 39 [2018-09-30 10:28:39,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:39,723 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2018-09-30 10:28:39,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:39,723 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2018-09-30 10:28:39,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-30 10:28:39,724 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:39,724 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:39,725 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:39,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:39,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1178137851, now seen corresponding path program 1 times [2018-09-30 10:28:39,725 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:39,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:39,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:39,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:39,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:39,822 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-30 10:28:39,822 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:39,822 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:28:39,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:39,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:39,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:39,824 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 3 states. [2018-09-30 10:28:39,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:39,957 INFO L93 Difference]: Finished difference Result 75 states and 99 transitions. [2018-09-30 10:28:39,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:39,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-09-30 10:28:39,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:39,959 INFO L225 Difference]: With dead ends: 75 [2018-09-30 10:28:39,959 INFO L226 Difference]: Without dead ends: 73 [2018-09-30 10:28:39,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:39,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-30 10:28:39,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-09-30 10:28:39,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-09-30 10:28:39,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 91 transitions. [2018-09-30 10:28:39,971 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 91 transitions. Word has length 39 [2018-09-30 10:28:39,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:39,971 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 91 transitions. [2018-09-30 10:28:39,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:39,972 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 91 transitions. [2018-09-30 10:28:39,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-30 10:28:39,973 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:39,973 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:39,974 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:39,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:39,974 INFO L82 PathProgramCache]: Analyzing trace with hash -497270587, now seen corresponding path program 1 times [2018-09-30 10:28:39,974 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:39,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:39,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:39,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:39,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:40,084 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-30 10:28:40,085 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:40,085 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:28:40,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:40,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:40,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:40,086 INFO L87 Difference]: Start difference. First operand 68 states and 91 transitions. Second operand 3 states. [2018-09-30 10:28:40,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:40,151 INFO L93 Difference]: Finished difference Result 134 states and 181 transitions. [2018-09-30 10:28:40,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:40,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-09-30 10:28:40,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:40,153 INFO L225 Difference]: With dead ends: 134 [2018-09-30 10:28:40,153 INFO L226 Difference]: Without dead ends: 69 [2018-09-30 10:28:40,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:40,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-30 10:28:40,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-09-30 10:28:40,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-30 10:28:40,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 92 transitions. [2018-09-30 10:28:40,166 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 92 transitions. Word has length 39 [2018-09-30 10:28:40,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:40,166 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 92 transitions. [2018-09-30 10:28:40,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:40,167 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2018-09-30 10:28:40,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-30 10:28:40,168 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:40,169 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:40,169 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:40,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:40,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1610522479, now seen corresponding path program 1 times [2018-09-30 10:28:40,170 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:40,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:40,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:40,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:40,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:40,247 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-09-30 10:28:40,247 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:40,247 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:28:40,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:40,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:40,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:40,249 INFO L87 Difference]: Start difference. First operand 69 states and 92 transitions. Second operand 3 states. [2018-09-30 10:28:40,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:40,543 INFO L93 Difference]: Finished difference Result 159 states and 225 transitions. [2018-09-30 10:28:40,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:40,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-09-30 10:28:40,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:40,545 INFO L225 Difference]: With dead ends: 159 [2018-09-30 10:28:40,546 INFO L226 Difference]: Without dead ends: 93 [2018-09-30 10:28:40,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:40,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-30 10:28:40,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-09-30 10:28:40,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-30 10:28:40,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 126 transitions. [2018-09-30 10:28:40,567 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 126 transitions. Word has length 56 [2018-09-30 10:28:40,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:40,568 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 126 transitions. [2018-09-30 10:28:40,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:40,568 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 126 transitions. [2018-09-30 10:28:40,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-30 10:28:40,570 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:40,570 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:40,571 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:40,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:40,571 INFO L82 PathProgramCache]: Analyzing trace with hash -919794, now seen corresponding path program 1 times [2018-09-30 10:28:40,571 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:40,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:40,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:40,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:40,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:40,670 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-09-30 10:28:40,670 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:40,671 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:28:40,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:40,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:40,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:40,672 INFO L87 Difference]: Start difference. First operand 93 states and 126 transitions. Second operand 3 states. [2018-09-30 10:28:40,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:40,920 INFO L93 Difference]: Finished difference Result 199 states and 269 transitions. [2018-09-30 10:28:40,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:40,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-09-30 10:28:40,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:40,923 INFO L225 Difference]: With dead ends: 199 [2018-09-30 10:28:40,923 INFO L226 Difference]: Without dead ends: 109 [2018-09-30 10:28:40,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:40,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-30 10:28:40,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-30 10:28:40,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-30 10:28:40,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 142 transitions. [2018-09-30 10:28:40,938 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 142 transitions. Word has length 68 [2018-09-30 10:28:40,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:40,938 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 142 transitions. [2018-09-30 10:28:40,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:40,939 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 142 transitions. [2018-09-30 10:28:40,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-30 10:28:40,940 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:40,941 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 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-09-30 10:28:40,941 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:40,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:40,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1962879724, now seen corresponding path program 1 times [2018-09-30 10:28:40,941 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:40,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:40,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:40,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:40,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:41,017 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-09-30 10:28:41,018 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:41,018 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:28:41,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:41,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:41,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:41,019 INFO L87 Difference]: Start difference. First operand 109 states and 142 transitions. Second operand 3 states. [2018-09-30 10:28:41,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:41,307 INFO L93 Difference]: Finished difference Result 233 states and 305 transitions. [2018-09-30 10:28:41,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:41,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-09-30 10:28:41,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:41,309 INFO L225 Difference]: With dead ends: 233 [2018-09-30 10:28:41,309 INFO L226 Difference]: Without dead ends: 127 [2018-09-30 10:28:41,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:41,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-30 10:28:41,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-09-30 10:28:41,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-30 10:28:41,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 160 transitions. [2018-09-30 10:28:41,325 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 160 transitions. Word has length 77 [2018-09-30 10:28:41,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:41,326 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 160 transitions. [2018-09-30 10:28:41,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:41,326 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 160 transitions. [2018-09-30 10:28:41,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-30 10:28:41,328 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:41,328 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 6, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:41,329 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:41,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:41,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1866233676, now seen corresponding path program 1 times [2018-09-30 10:28:41,329 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:41,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:41,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:41,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:41,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:41,436 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-09-30 10:28:41,436 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:41,436 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:28:41,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:41,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:41,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:41,438 INFO L87 Difference]: Start difference. First operand 127 states and 160 transitions. Second operand 3 states. [2018-09-30 10:28:41,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:41,652 INFO L93 Difference]: Finished difference Result 271 states and 345 transitions. [2018-09-30 10:28:41,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:41,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-09-30 10:28:41,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:41,654 INFO L225 Difference]: With dead ends: 271 [2018-09-30 10:28:41,654 INFO L226 Difference]: Without dead ends: 147 [2018-09-30 10:28:41,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:41,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-30 10:28:41,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-09-30 10:28:41,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-30 10:28:41,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 180 transitions. [2018-09-30 10:28:41,688 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 180 transitions. Word has length 86 [2018-09-30 10:28:41,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:41,688 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 180 transitions. [2018-09-30 10:28:41,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:41,689 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 180 transitions. [2018-09-30 10:28:41,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-30 10:28:41,690 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:41,690 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 7, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:41,691 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:41,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:41,691 INFO L82 PathProgramCache]: Analyzing trace with hash -82543983, now seen corresponding path program 1 times [2018-09-30 10:28:41,698 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:41,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:41,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:41,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:41,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:41,825 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-09-30 10:28:41,826 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:41,826 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:28:41,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:41,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:41,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:41,827 INFO L87 Difference]: Start difference. First operand 147 states and 180 transitions. Second operand 3 states. [2018-09-30 10:28:42,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:42,336 INFO L93 Difference]: Finished difference Result 313 states and 389 transitions. [2018-09-30 10:28:42,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:42,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-09-30 10:28:42,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:42,338 INFO L225 Difference]: With dead ends: 313 [2018-09-30 10:28:42,338 INFO L226 Difference]: Without dead ends: 169 [2018-09-30 10:28:42,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:42,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-09-30 10:28:42,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-09-30 10:28:42,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-09-30 10:28:42,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 202 transitions. [2018-09-30 10:28:42,358 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 202 transitions. Word has length 96 [2018-09-30 10:28:42,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:42,359 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 202 transitions. [2018-09-30 10:28:42,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:42,359 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 202 transitions. [2018-09-30 10:28:42,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-09-30 10:28:42,363 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:42,363 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 10, 8, 6, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:42,364 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:42,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:42,365 INFO L82 PathProgramCache]: Analyzing trace with hash -666240887, now seen corresponding path program 1 times [2018-09-30 10:28:42,365 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:42,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:42,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:42,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:42,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:42,496 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-09-30 10:28:42,496 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:28:42,496 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:28:42,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:28:42,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:28:42,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:42,497 INFO L87 Difference]: Start difference. First operand 169 states and 202 transitions. Second operand 3 states. [2018-09-30 10:28:42,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:42,771 INFO L93 Difference]: Finished difference Result 359 states and 445 transitions. [2018-09-30 10:28:42,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:28:42,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-09-30 10:28:42,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:42,775 INFO L225 Difference]: With dead ends: 359 [2018-09-30 10:28:42,775 INFO L226 Difference]: Without dead ends: 193 [2018-09-30 10:28:42,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:28:42,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-09-30 10:28:42,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-09-30 10:28:42,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-09-30 10:28:42,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 226 transitions. [2018-09-30 10:28:42,791 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 226 transitions. Word has length 107 [2018-09-30 10:28:42,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:42,791 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 226 transitions. [2018-09-30 10:28:42,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:28:42,792 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 226 transitions. [2018-09-30 10:28:42,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-09-30 10:28:42,793 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:28:42,793 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 11, 9, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:28:42,793 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:28:42,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:28:42,794 INFO L82 PathProgramCache]: Analyzing trace with hash 133203942, now seen corresponding path program 1 times [2018-09-30 10:28:42,794 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:28:42,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:28:42,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:42,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:42,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:28:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:42,986 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 282 proven. 6 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-09-30 10:28:42,986 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:28:42,986 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:28:43,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:28:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:28:43,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:28:43,192 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 282 proven. 6 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-09-30 10:28:43,231 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:28:43,231 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-09-30 10:28:43,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:28:43,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:28:43,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 10:28:43,232 INFO L87 Difference]: Start difference. First operand 193 states and 226 transitions. Second operand 4 states. [2018-09-30 10:28:43,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:28:43,765 INFO L93 Difference]: Finished difference Result 371 states and 424 transitions. [2018-09-30 10:28:43,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:28:43,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2018-09-30 10:28:43,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:28:43,766 INFO L225 Difference]: With dead ends: 371 [2018-09-30 10:28:43,766 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 10:28:43,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 121 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-09-30 10:28:43,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 10:28:43,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 10:28:43,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 10:28:43,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 10:28:43,768 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 119 [2018-09-30 10:28:43,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:28:43,769 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 10:28:43,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:28:43,769 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 10:28:43,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 10:28:43,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 10:28:44,436 WARN L178 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-09-30 10:28:44,540 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-09-30 10:28:44,999 WARN L178 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-09-30 10:28:45,521 WARN L178 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-09-30 10:28:45,824 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-09-30 10:28:45,827 INFO L422 ceAbstractionStarter]: At program point L506(lines 289 506) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-09-30 10:28:45,828 INFO L422 ceAbstractionStarter]: At program point L374(lines 374 397) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-09-30 10:28:45,828 INFO L422 ceAbstractionStarter]: At program point L370(lines 370 386) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) [2018-09-30 10:28:45,828 INFO L422 ceAbstractionStarter]: At program point L337(lines 337 348) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-09-30 10:28:45,828 INFO L422 ceAbstractionStarter]: At program point L300(lines 261 300) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-09-30 10:28:45,829 INFO L422 ceAbstractionStarter]: At program point L362(lines 357 375) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4400) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) [2018-09-30 10:28:45,829 INFO L422 ceAbstractionStarter]: At program point L296(lines 296 316) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-09-30 10:28:45,829 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 440) no Hoare annotation was computed. [2018-09-30 10:28:45,829 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 507) no Hoare annotation was computed. [2018-09-30 10:28:45,829 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 507) no Hoare annotation was computed. [2018-09-30 10:28:45,829 INFO L422 ceAbstractionStarter]: At program point L412(lines 412 439) the Hoare annotation is: false [2018-09-30 10:28:45,829 INFO L422 ceAbstractionStarter]: At program point L441(lines 438 455) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-09-30 10:28:45,830 INFO L422 ceAbstractionStarter]: At program point L400(lines 400 431) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-09-30 10:28:45,830 INFO L422 ceAbstractionStarter]: At program point L396(lines 396 413) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) [2018-09-30 10:28:45,830 INFO L422 ceAbstractionStarter]: At program point L388(lines 385 401) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4416)) [2018-09-30 10:28:45,830 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 507) no Hoare annotation was computed. [2018-09-30 10:28:45,830 INFO L422 ceAbstractionStarter]: At program point L351(lines 351 371) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-09-30 10:28:45,832 INFO L422 ceAbstractionStarter]: At program point L347(lines 347 358) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) [2018-09-30 10:28:45,833 INFO L422 ceAbstractionStarter]: At program point L480(lines 480 497) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-09-30 10:28:45,833 INFO L422 ceAbstractionStarter]: At program point L319(lines 319 334) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-09-30 10:28:45,833 INFO L422 ceAbstractionStarter]: At program point L460(lines 460 477) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-09-30 10:28:45,834 INFO L422 ceAbstractionStarter]: At program point L266(lines 266 290) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and (= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (= ULTIMATE.start_ssl3_connect_~s__state~4 4416) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)))) [2018-09-30 10:28:45,850 INFO L202 PluginConnector]: Adding new model s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:28:45 BoogieIcfgContainer [2018-09-30 10:28:45,850 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:28:45,851 INFO L168 Benchmark]: Toolchain (without parser) took 9299.94 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 34.6 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 36.9 MB). Peak memory consumption was 490.3 MB. Max. memory is 7.1 GB. [2018-09-30 10:28:45,853 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.88 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:28:45,853 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.99 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:28:45,854 INFO L168 Benchmark]: Boogie Preprocessor took 63.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:28:45,854 INFO L168 Benchmark]: RCFGBuilder took 730.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-30 10:28:45,855 INFO L168 Benchmark]: TraceAbstraction took 8440.34 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 34.6 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 5.2 MB). Peak memory consumption was 458.6 MB. Max. memory is 7.1 GB. [2018-09-30 10:28:45,860 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.88 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 56.99 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 63.00 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 730.78 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 8440.34 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 34.6 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 5.2 MB). Peak memory consumption was 458.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 440]: 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: 385]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4416 - InvariantResult [Line: 438]: Loop Invariant Derived loop invariant: ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 396]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432 - InvariantResult [Line: 460]: Loop Invariant Derived loop invariant: ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || ssl3_connect_~s__state~4 == 4368) || ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 480]: Loop Invariant Derived loop invariant: ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 357]: Loop Invariant Derived loop invariant: ssl3_connect_~s__state~4 == 4400 && ssl3_connect_~blastFlag~4 == 3 - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: ((ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3) || ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || ssl3_connect_~s__state~4 == 4368) || ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 370]: Loop Invariant Derived loop invariant: ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3 - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || ssl3_connect_~s__state~4 == 4368) || ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 337]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400 - InvariantResult [Line: 400]: Loop Invariant Derived loop invariant: ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 == 2 && ssl3_connect_~s__state~4 == 4400) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || ssl3_connect_~s__state~4 == 4368) || ((ssl3_connect_~blastFlag~4 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 4 && 4432 <= ssl3_connect_~s__state~4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 1 error locations. SAFE Result, 8.3s OverallTime, 15 OverallIterations, 14 TraceHistogramMax, 3.9s AutomataDifference, 0.0s DeadEndRemovalTime, 2.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 478 SDtfs, 60 SDslu, 167 SDs, 0 SdLazy, 428 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=193occurred in iteration=14, 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.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 18 PreInvPairs, 198 NumberOfFragments, 390 HoareAnnotationTreeSize, 18 FomulaSimplifications, 1407 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 168 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 937 NumberOfCodeBlocks, 937 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 921 ConstructedInterpolants, 0 QuantifiedInterpolants, 94303 SizeOfPredicates, 2 NumberOfNonLiveVariables, 567 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 16 InterpolantComputations, 14 PerfectInterpolantSequences, 2949/2961 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_4.cil.c_20.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-28-45-876.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_4.cil.c_20.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-28-45-876.csv Received shutdown request...