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-d19836b [2018-09-26 21:26:10,353 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:26:10,355 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:26:10,367 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:26:10,368 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:26:10,369 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:26:10,370 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:26:10,372 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:26:10,373 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:26:10,374 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:26:10,375 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:26:10,375 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:26:10,376 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:26:10,377 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:26:10,378 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:26:10,379 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:26:10,380 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:26:10,382 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:26:10,384 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:26:10,386 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:26:10,387 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:26:10,388 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:26:10,391 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:26:10,391 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:26:10,391 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:26:10,392 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:26:10,393 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:26:10,394 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:26:10,395 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:26:10,396 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:26:10,396 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:26:10,397 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:26:10,397 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:26:10,398 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:26:10,399 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:26:10,399 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:26:10,400 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-26 21:26:10,414 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:26:10,415 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:26:10,416 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:26:10,416 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:26:10,416 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:26:10,417 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:26:10,417 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:26:10,417 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:26:10,417 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:26:10,417 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:26:10,418 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:26:10,418 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:26:10,418 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:26:10,418 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:26:10,418 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:26:10,419 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:26:10,419 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:26:10,419 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:26:10,419 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:26:10,420 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:26:10,420 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:26:10,420 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:26:10,420 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:26:10,420 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:26:10,421 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:26:10,421 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:26:10,421 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:26:10,421 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:26:10,421 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:26:10,422 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:26:10,465 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:26:10,482 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:26:10,488 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:26:10,490 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:26:10,490 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:26:10,491 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-26 21:26:10,491 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-26 21:26:10,609 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:26:10,613 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:26:10,613 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:26:10,614 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:26:10,614 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:26:10,638 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 26.09 09:26:10" (1/1) ... [2018-09-26 21:26:10,656 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 26.09 09:26:10" (1/1) ... [2018-09-26 21:26:10,672 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:26:10,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:26:10,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:26:10,673 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:26:10,685 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 26.09 09:26:10" (1/1) ... [2018-09-26 21:26:10,685 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 26.09 09:26:10" (1/1) ... [2018-09-26 21:26:10,688 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 26.09 09:26:10" (1/1) ... [2018-09-26 21:26:10,697 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 26.09 09:26:10" (1/1) ... [2018-09-26 21:26:10,713 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 26.09 09:26:10" (1/1) ... [2018-09-26 21:26:10,723 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 26.09 09:26:10" (1/1) ... [2018-09-26 21:26:10,727 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 26.09 09:26:10" (1/1) ... [2018-09-26 21:26:10,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:26:10,731 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:26:10,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:26:10,732 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:26:10,733 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 26.09 09:26:10" (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-26 21:26:10,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 21:26:10,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 21:26:11,499 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 21:26:11,499 INFO L202 PluginConnector]: Adding new model s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:26:11 BoogieIcfgContainer [2018-09-26 21:26:11,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:26:11,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:26:11,501 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:26:11,504 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:26:11,505 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 26.09 09:26:10" (1/2) ... [2018-09-26 21:26:11,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a91984 and model type s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:26:11, skipping insertion in model container [2018-09-26 21:26:11,506 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 26.09 09:26:11" (2/2) ... [2018-09-26 21:26:11,508 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_4.cil.c_20.bpl [2018-09-26 21:26:11,517 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:26:11,526 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 21:26:11,578 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:26:11,579 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:26:11,579 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:26:11,579 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:26:11,580 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:26:11,580 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:26:11,580 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:26:11,580 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:26:11,580 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:26:11,597 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-09-26 21:26:11,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 21:26:11,605 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:11,606 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:26:11,607 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:11,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:11,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1912788263, now seen corresponding path program 1 times [2018-09-26 21:26:11,618 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:11,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:11,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:11,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:11,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:11,843 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-26 21:26:11,846 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:11,847 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:26:11,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:11,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:11,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:11,866 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-09-26 21:26:12,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:12,052 INFO L93 Difference]: Finished difference Result 41 states and 68 transitions. [2018-09-26 21:26:12,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:12,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-09-26 21:26:12,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:12,076 INFO L225 Difference]: With dead ends: 41 [2018-09-26 21:26:12,076 INFO L226 Difference]: Without dead ends: 22 [2018-09-26 21:26:12,084 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-26 21:26:12,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-26 21:26:12,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-09-26 21:26:12,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-26 21:26:12,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 34 transitions. [2018-09-26 21:26:12,125 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 34 transitions. Word has length 10 [2018-09-26 21:26:12,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:12,125 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 34 transitions. [2018-09-26 21:26:12,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:12,126 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 34 transitions. [2018-09-26 21:26:12,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 21:26:12,127 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:12,127 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:26:12,127 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:12,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:12,128 INFO L82 PathProgramCache]: Analyzing trace with hash -694562177, now seen corresponding path program 1 times [2018-09-26 21:26:12,128 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:12,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:12,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:12,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:12,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:12,250 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-26 21:26:12,250 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:12,250 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:26:12,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:12,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:12,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:12,255 INFO L87 Difference]: Start difference. First operand 22 states and 34 transitions. Second operand 3 states. [2018-09-26 21:26:12,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:12,517 INFO L93 Difference]: Finished difference Result 45 states and 71 transitions. [2018-09-26 21:26:12,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:12,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-09-26 21:26:12,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:12,519 INFO L225 Difference]: With dead ends: 45 [2018-09-26 21:26:12,519 INFO L226 Difference]: Without dead ends: 26 [2018-09-26 21:26:12,520 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-26 21:26:12,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-26 21:26:12,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-26 21:26:12,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-26 21:26:12,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2018-09-26 21:26:12,528 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 13 [2018-09-26 21:26:12,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:12,529 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2018-09-26 21:26:12,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:12,529 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2018-09-26 21:26:12,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 21:26:12,530 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:12,530 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:26:12,531 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:12,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:12,531 INFO L82 PathProgramCache]: Analyzing trace with hash 479561661, now seen corresponding path program 1 times [2018-09-26 21:26:12,532 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:12,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:12,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:12,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:12,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:12,649 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-26 21:26:12,650 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:12,650 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:26:12,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:12,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:12,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:12,652 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand 3 states. [2018-09-26 21:26:12,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:12,790 INFO L93 Difference]: Finished difference Result 54 states and 81 transitions. [2018-09-26 21:26:12,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:12,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-09-26 21:26:12,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:12,792 INFO L225 Difference]: With dead ends: 54 [2018-09-26 21:26:12,792 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 21:26:12,793 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-26 21:26:12,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 21:26:12,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-26 21:26:12,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 21:26:12,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-09-26 21:26:12,800 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 17 [2018-09-26 21:26:12,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:12,800 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-09-26 21:26:12,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:12,801 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-09-26 21:26:12,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 21:26:12,802 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:12,802 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:26:12,802 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:12,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:12,803 INFO L82 PathProgramCache]: Analyzing trace with hash 2107505391, now seen corresponding path program 1 times [2018-09-26 21:26:12,803 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:12,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:12,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:12,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:12,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:12,904 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-26 21:26:12,905 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:12,905 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:26:12,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:12,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:12,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:12,906 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states. [2018-09-26 21:26:13,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:13,119 INFO L93 Difference]: Finished difference Result 65 states and 93 transitions. [2018-09-26 21:26:13,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:13,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-09-26 21:26:13,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:13,122 INFO L225 Difference]: With dead ends: 65 [2018-09-26 21:26:13,123 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 21:26:13,123 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-26 21:26:13,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 21:26:13,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-26 21:26:13,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 21:26:13,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2018-09-26 21:26:13,131 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 22 [2018-09-26 21:26:13,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:13,131 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2018-09-26 21:26:13,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:13,131 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2018-09-26 21:26:13,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 21:26:13,132 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:13,133 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:26:13,133 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:13,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:13,133 INFO L82 PathProgramCache]: Analyzing trace with hash -2123032451, now seen corresponding path program 1 times [2018-09-26 21:26:13,134 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:13,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:13,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:13,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:13,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:13,253 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-26 21:26:13,253 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:13,253 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:26:13,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:13,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:13,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:13,255 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand 3 states. [2018-09-26 21:26:13,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:13,421 INFO L93 Difference]: Finished difference Result 78 states and 107 transitions. [2018-09-26 21:26:13,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:13,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-26 21:26:13,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:13,423 INFO L225 Difference]: With dead ends: 78 [2018-09-26 21:26:13,423 INFO L226 Difference]: Without dead ends: 44 [2018-09-26 21:26:13,424 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-26 21:26:13,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-26 21:26:13,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-09-26 21:26:13,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-26 21:26:13,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2018-09-26 21:26:13,431 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 30 [2018-09-26 21:26:13,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:13,432 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2018-09-26 21:26:13,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:13,432 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2018-09-26 21:26:13,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-26 21:26:13,434 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:13,434 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-26 21:26:13,435 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:13,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:13,435 INFO L82 PathProgramCache]: Analyzing trace with hash -919972413, now seen corresponding path program 1 times [2018-09-26 21:26:13,435 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:13,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:13,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:13,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:13,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:13,566 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-26 21:26:13,567 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:13,567 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:26:13,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:13,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:13,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:13,569 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 3 states. [2018-09-26 21:26:13,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:13,634 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2018-09-26 21:26:13,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:13,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-09-26 21:26:13,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:13,636 INFO L225 Difference]: With dead ends: 94 [2018-09-26 21:26:13,637 INFO L226 Difference]: Without dead ends: 53 [2018-09-26 21:26:13,638 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-26 21:26:13,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-26 21:26:13,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-26 21:26:13,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 21:26:13,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2018-09-26 21:26:13,646 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 39 [2018-09-26 21:26:13,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:13,647 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2018-09-26 21:26:13,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:13,647 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2018-09-26 21:26:13,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-26 21:26:13,648 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:13,648 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-26 21:26:13,649 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:13,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:13,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1178137851, now seen corresponding path program 1 times [2018-09-26 21:26:13,649 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:13,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:13,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:13,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:13,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:13,740 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-26 21:26:13,740 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:13,740 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:26:13,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:13,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:13,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:13,742 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 3 states. [2018-09-26 21:26:13,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:13,819 INFO L93 Difference]: Finished difference Result 75 states and 99 transitions. [2018-09-26 21:26:13,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:13,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-09-26 21:26:13,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:13,822 INFO L225 Difference]: With dead ends: 75 [2018-09-26 21:26:13,822 INFO L226 Difference]: Without dead ends: 73 [2018-09-26 21:26:13,822 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-26 21:26:13,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-26 21:26:13,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-09-26 21:26:13,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-09-26 21:26:13,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 91 transitions. [2018-09-26 21:26:13,834 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 91 transitions. Word has length 39 [2018-09-26 21:26:13,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:13,834 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 91 transitions. [2018-09-26 21:26:13,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:13,835 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 91 transitions. [2018-09-26 21:26:13,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-26 21:26:13,836 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:13,836 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-26 21:26:13,836 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:13,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:13,837 INFO L82 PathProgramCache]: Analyzing trace with hash -497270587, now seen corresponding path program 1 times [2018-09-26 21:26:13,837 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:13,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:13,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:13,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:13,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:13,919 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-26 21:26:13,919 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:13,920 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:26:13,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:13,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:13,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:13,921 INFO L87 Difference]: Start difference. First operand 68 states and 91 transitions. Second operand 3 states. [2018-09-26 21:26:14,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:14,049 INFO L93 Difference]: Finished difference Result 134 states and 181 transitions. [2018-09-26 21:26:14,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:14,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-09-26 21:26:14,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:14,052 INFO L225 Difference]: With dead ends: 134 [2018-09-26 21:26:14,052 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 21:26:14,053 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-26 21:26:14,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 21:26:14,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-09-26 21:26:14,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-26 21:26:14,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 92 transitions. [2018-09-26 21:26:14,070 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 92 transitions. Word has length 39 [2018-09-26 21:26:14,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:14,071 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 92 transitions. [2018-09-26 21:26:14,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:14,071 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2018-09-26 21:26:14,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-26 21:26:14,074 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:14,074 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-26 21:26:14,075 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:14,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:14,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1610522479, now seen corresponding path program 1 times [2018-09-26 21:26:14,075 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:14,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:14,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:14,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:14,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:14,198 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-26 21:26:14,198 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:14,199 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:26:14,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:14,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:14,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:14,200 INFO L87 Difference]: Start difference. First operand 69 states and 92 transitions. Second operand 3 states. [2018-09-26 21:26:14,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:14,630 INFO L93 Difference]: Finished difference Result 159 states and 225 transitions. [2018-09-26 21:26:14,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:14,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-09-26 21:26:14,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:14,633 INFO L225 Difference]: With dead ends: 159 [2018-09-26 21:26:14,633 INFO L226 Difference]: Without dead ends: 93 [2018-09-26 21:26:14,634 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-26 21:26:14,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-26 21:26:14,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-09-26 21:26:14,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 21:26:14,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 126 transitions. [2018-09-26 21:26:14,655 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 126 transitions. Word has length 56 [2018-09-26 21:26:14,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:14,656 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 126 transitions. [2018-09-26 21:26:14,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:14,656 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 126 transitions. [2018-09-26 21:26:14,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 21:26:14,657 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:14,658 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-26 21:26:14,658 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:14,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:14,658 INFO L82 PathProgramCache]: Analyzing trace with hash -919794, now seen corresponding path program 1 times [2018-09-26 21:26:14,659 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:14,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:14,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:14,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:14,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:14,749 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-26 21:26:14,749 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:14,749 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:26:14,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:14,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:14,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:14,751 INFO L87 Difference]: Start difference. First operand 93 states and 126 transitions. Second operand 3 states. [2018-09-26 21:26:14,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:14,863 INFO L93 Difference]: Finished difference Result 199 states and 269 transitions. [2018-09-26 21:26:14,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:14,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-09-26 21:26:14,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:14,865 INFO L225 Difference]: With dead ends: 199 [2018-09-26 21:26:14,865 INFO L226 Difference]: Without dead ends: 109 [2018-09-26 21:26:14,866 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-26 21:26:14,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-26 21:26:14,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-26 21:26:14,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-26 21:26:14,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 142 transitions. [2018-09-26 21:26:14,886 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 142 transitions. Word has length 68 [2018-09-26 21:26:14,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:14,886 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 142 transitions. [2018-09-26 21:26:14,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:14,886 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 142 transitions. [2018-09-26 21:26:14,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-26 21:26:14,888 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:14,888 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-26 21:26:14,888 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:14,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:14,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1962879724, now seen corresponding path program 1 times [2018-09-26 21:26:14,889 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:14,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:14,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:14,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:14,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:14,978 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-26 21:26:14,979 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:14,979 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:26:14,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:14,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:14,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:14,980 INFO L87 Difference]: Start difference. First operand 109 states and 142 transitions. Second operand 3 states. [2018-09-26 21:26:15,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:15,084 INFO L93 Difference]: Finished difference Result 233 states and 305 transitions. [2018-09-26 21:26:15,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:15,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-09-26 21:26:15,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:15,089 INFO L225 Difference]: With dead ends: 233 [2018-09-26 21:26:15,090 INFO L226 Difference]: Without dead ends: 127 [2018-09-26 21:26:15,093 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-26 21:26:15,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-26 21:26:15,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-09-26 21:26:15,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-26 21:26:15,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 160 transitions. [2018-09-26 21:26:15,125 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 160 transitions. Word has length 77 [2018-09-26 21:26:15,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:15,125 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 160 transitions. [2018-09-26 21:26:15,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:15,125 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 160 transitions. [2018-09-26 21:26:15,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 21:26:15,131 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:15,131 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-26 21:26:15,132 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:15,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:15,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1866233676, now seen corresponding path program 1 times [2018-09-26 21:26:15,132 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:15,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:15,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:15,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:15,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:15,248 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-26 21:26:15,248 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:15,249 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:26:15,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:15,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:15,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:15,250 INFO L87 Difference]: Start difference. First operand 127 states and 160 transitions. Second operand 3 states. [2018-09-26 21:26:15,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:15,554 INFO L93 Difference]: Finished difference Result 271 states and 345 transitions. [2018-09-26 21:26:15,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:15,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-09-26 21:26:15,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:15,557 INFO L225 Difference]: With dead ends: 271 [2018-09-26 21:26:15,557 INFO L226 Difference]: Without dead ends: 147 [2018-09-26 21:26:15,558 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-26 21:26:15,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-26 21:26:15,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-09-26 21:26:15,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-26 21:26:15,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 180 transitions. [2018-09-26 21:26:15,572 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 180 transitions. Word has length 86 [2018-09-26 21:26:15,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:15,573 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 180 transitions. [2018-09-26 21:26:15,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:15,573 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 180 transitions. [2018-09-26 21:26:15,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 21:26:15,574 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:15,574 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-26 21:26:15,575 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:15,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:15,575 INFO L82 PathProgramCache]: Analyzing trace with hash -82543983, now seen corresponding path program 1 times [2018-09-26 21:26:15,575 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:15,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:15,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:15,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:15,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:15,686 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-26 21:26:15,686 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:15,686 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:26:15,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:15,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:15,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:15,688 INFO L87 Difference]: Start difference. First operand 147 states and 180 transitions. Second operand 3 states. [2018-09-26 21:26:16,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:16,213 INFO L93 Difference]: Finished difference Result 313 states and 389 transitions. [2018-09-26 21:26:16,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:16,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-09-26 21:26:16,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:16,215 INFO L225 Difference]: With dead ends: 313 [2018-09-26 21:26:16,215 INFO L226 Difference]: Without dead ends: 169 [2018-09-26 21:26:16,216 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-26 21:26:16,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-09-26 21:26:16,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-09-26 21:26:16,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-09-26 21:26:16,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 202 transitions. [2018-09-26 21:26:16,232 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 202 transitions. Word has length 96 [2018-09-26 21:26:16,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:16,233 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 202 transitions. [2018-09-26 21:26:16,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:16,233 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 202 transitions. [2018-09-26 21:26:16,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-09-26 21:26:16,234 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:16,234 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-26 21:26:16,235 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:16,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:16,235 INFO L82 PathProgramCache]: Analyzing trace with hash -666240887, now seen corresponding path program 1 times [2018-09-26 21:26:16,235 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:16,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:16,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:16,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:16,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:16,368 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-26 21:26:16,368 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:26:16,368 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:26:16,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:26:16,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:26:16,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:26:16,370 INFO L87 Difference]: Start difference. First operand 169 states and 202 transitions. Second operand 3 states. [2018-09-26 21:26:16,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:16,754 INFO L93 Difference]: Finished difference Result 359 states and 445 transitions. [2018-09-26 21:26:16,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:26:16,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-09-26 21:26:16,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:16,756 INFO L225 Difference]: With dead ends: 359 [2018-09-26 21:26:16,756 INFO L226 Difference]: Without dead ends: 193 [2018-09-26 21:26:16,757 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-26 21:26:16,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-09-26 21:26:16,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-09-26 21:26:16,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-09-26 21:26:16,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 226 transitions. [2018-09-26 21:26:16,774 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 226 transitions. Word has length 107 [2018-09-26 21:26:16,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:16,775 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 226 transitions. [2018-09-26 21:26:16,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:26:16,775 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 226 transitions. [2018-09-26 21:26:16,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-09-26 21:26:16,776 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:26:16,777 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-26 21:26:16,777 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:26:16,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:26:16,778 INFO L82 PathProgramCache]: Analyzing trace with hash 133203942, now seen corresponding path program 1 times [2018-09-26 21:26:16,778 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:26:16,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:26:16,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:16,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:16,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:26:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:16,918 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-26 21:26:16,919 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:26:16,919 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-26 21:26:16,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:26:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:26:17,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:26:17,096 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-26 21:26:17,134 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:26:17,134 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-09-26 21:26:17,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:26:17,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:26:17,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 21:26:17,136 INFO L87 Difference]: Start difference. First operand 193 states and 226 transitions. Second operand 4 states. [2018-09-26 21:26:17,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:26:17,730 INFO L93 Difference]: Finished difference Result 371 states and 424 transitions. [2018-09-26 21:26:17,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:26:17,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2018-09-26 21:26:17,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:26:17,731 INFO L225 Difference]: With dead ends: 371 [2018-09-26 21:26:17,731 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 21:26:17,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 21:26:17,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 21:26:17,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 21:26:17,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 21:26:17,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 21:26:17,733 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 119 [2018-09-26 21:26:17,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:26:17,733 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 21:26:17,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:26:17,733 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 21:26:17,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 21:26:17,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 21:26:18,437 WARN L178 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-09-26 21:26:18,583 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-09-26 21:26:18,864 WARN L178 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-09-26 21:26:19,190 WARN L178 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-09-26 21:26:19,665 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-26 21:26:19,665 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-26 21:26:19,666 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-26 21:26:19,666 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-26 21:26:19,666 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-26 21:26:19,666 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-26 21:26:19,666 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-26 21:26:19,667 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 507) no Hoare annotation was computed. [2018-09-26 21:26:19,667 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 507) no Hoare annotation was computed. [2018-09-26 21:26:19,667 INFO L422 ceAbstractionStarter]: At program point L412(lines 412 439) the Hoare annotation is: false [2018-09-26 21:26:19,667 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-26 21:26:19,667 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-26 21:26:19,667 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-26 21:26:19,667 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-26 21:26:19,668 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 507) no Hoare annotation was computed. [2018-09-26 21:26:19,668 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-26 21:26:19,668 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-26 21:26:19,668 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 440) no Hoare annotation was computed. [2018-09-26 21:26:19,668 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-26 21:26:19,668 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-26 21:26:19,668 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-26 21:26:19,669 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-26 21:26:19,683 INFO L202 PluginConnector]: Adding new model s3_clnt_4.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:26:19 BoogieIcfgContainer [2018-09-26 21:26:19,683 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:26:19,684 INFO L168 Benchmark]: Toolchain (without parser) took 9074.73 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 28.8 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 30.7 MB). Peak memory consumption was 490.3 MB. Max. memory is 7.1 GB. [2018-09-26 21:26:19,686 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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-26 21:26:19,686 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.42 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-26 21:26:19,687 INFO L168 Benchmark]: Boogie Preprocessor took 57.90 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-26 21:26:19,687 INFO L168 Benchmark]: RCFGBuilder took 768.33 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-26 21:26:19,690 INFO L168 Benchmark]: TraceAbstraction took 8182.64 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 28.8 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -1.0 MB). Peak memory consumption was 458.6 MB. Max. memory is 7.1 GB. [2018-09-26 21:26:19,694 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.19 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 59.42 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 57.90 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 768.33 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 8182.64 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 28.8 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -1.0 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.1s OverallTime, 15 OverallIterations, 14 TraceHistogramMax, 3.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 478 SDtfs, 60 SDslu, 167 SDs, 0 SdLazy, 428 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s 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.1s HoareSimplificationTime, 18 FomulaSimplificationsInter, 168 FormulaSimplificationTreeSizeReductionInter, 1.7s 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-26_21-26-19-718.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-26_21-26-19-718.csv Received shutdown request...