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 -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.cil.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:19:40,600 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:19:40,603 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:19:40,620 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:19:40,620 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:19:40,624 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:19:40,625 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:19:40,628 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:19:40,630 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:19:40,631 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:19:40,639 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:19:40,640 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:19:40,641 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:19:40,642 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:19:40,643 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:19:40,644 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:19:40,647 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:19:40,649 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:19:40,650 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:19:40,652 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:19:40,653 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:19:40,654 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:19:40,656 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:19:40,656 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:19:40,656 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:19:40,657 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:19:40,658 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:19:40,659 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:19:40,660 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:19:40,661 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:19:40,661 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:19:40,662 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:19:40,662 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:19:40,662 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:19:40,663 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:19:40,664 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:19:40,664 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:19:40,672 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:19:40,672 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:19:40,673 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:19:40,674 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:19:40,674 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:19:40,674 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:19:40,674 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:19:40,674 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:19:40,723 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:19:40,735 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:19:40,738 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:19:40,740 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:19:40,740 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:19:40,741 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.cil.c_21.bpl [2018-09-26 08:19:40,741 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.cil.c_21.bpl' [2018-09-26 08:19:40,820 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:19:40,823 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:19:40,824 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:19:40,824 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:19:40,824 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:19:40,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:40" (1/1) ... [2018-09-26 08:19:40,867 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:40" (1/1) ... [2018-09-26 08:19:40,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:19:40,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:19:40,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:19:40,883 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:19:40,895 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:40" (1/1) ... [2018-09-26 08:19:40,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:40" (1/1) ... [2018-09-26 08:19:40,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:40" (1/1) ... [2018-09-26 08:19:40,903 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:40" (1/1) ... [2018-09-26 08:19:40,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:40" (1/1) ... [2018-09-26 08:19:40,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:40" (1/1) ... [2018-09-26 08:19:40,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:40" (1/1) ... [2018-09-26 08:19:40,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:19:40,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:19:40,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:19:40,952 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:19:40,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:40" (1/1) ... [2018-09-26 08:19:41,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:19:41,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:19:41,849 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:19:41,850 INFO L202 PluginConnector]: Adding new model s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:19:41 BoogieIcfgContainer [2018-09-26 08:19:41,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:19:41,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:19:41,852 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:19:41,860 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:19:41,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:40" (1/2) ... [2018-09-26 08:19:41,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10140753 and model type s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:19:41, skipping insertion in model container [2018-09-26 08:19:41,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:19:41" (2/2) ... [2018-09-26 08:19:41,865 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil.c_21.bpl [2018-09-26 08:19:41,876 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:19:41,893 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:19:41,935 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:19:41,936 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:19:41,936 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:19:41,936 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:19:41,937 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:19:41,937 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:19:41,937 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:19:41,937 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:19:41,937 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:19:41,952 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-09-26 08:19:41,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:19:41,963 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:41,966 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:41,967 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:41,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:41,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1918575661, now seen corresponding path program 1 times [2018-09-26 08:19:41,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:42,104 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 08:19:42,108 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:42,108 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:19:42,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:42,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:42,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:42,129 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-09-26 08:19:42,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:42,247 INFO L93 Difference]: Finished difference Result 35 states and 57 transitions. [2018-09-26 08:19:42,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:42,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-09-26 08:19:42,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:42,284 INFO L225 Difference]: With dead ends: 35 [2018-09-26 08:19:42,285 INFO L226 Difference]: Without dead ends: 22 [2018-09-26 08:19:42,291 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 08:19:42,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-26 08:19:42,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-09-26 08:19:42,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-26 08:19:42,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 34 transitions. [2018-09-26 08:19:42,361 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 34 transitions. Word has length 10 [2018-09-26 08:19:42,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:42,362 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 34 transitions. [2018-09-26 08:19:42,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:42,362 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 34 transitions. [2018-09-26 08:19:42,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:19:42,363 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:42,364 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:42,365 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:42,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:42,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1262738159, now seen corresponding path program 1 times [2018-09-26 08:19:42,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:42,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:42,431 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:42,432 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:19:42,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:42,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:42,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:42,435 INFO L87 Difference]: Start difference. First operand 22 states and 34 transitions. Second operand 3 states. [2018-09-26 08:19:42,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:42,511 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions. [2018-09-26 08:19:42,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:42,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-09-26 08:19:42,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:42,513 INFO L225 Difference]: With dead ends: 57 [2018-09-26 08:19:42,514 INFO L226 Difference]: Without dead ends: 36 [2018-09-26 08:19:42,515 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 08:19:42,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-26 08:19:42,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-09-26 08:19:42,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-26 08:19:42,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 56 transitions. [2018-09-26 08:19:42,526 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 56 transitions. Word has length 17 [2018-09-26 08:19:42,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:42,527 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 56 transitions. [2018-09-26 08:19:42,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:42,527 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 56 transitions. [2018-09-26 08:19:42,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:19:42,528 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:42,529 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:42,529 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:42,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:42,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1340205844, now seen corresponding path program 1 times [2018-09-26 08:19:42,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:42,566 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-26 08:19:42,567 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:42,567 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:19:42,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:42,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:42,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:42,570 INFO L87 Difference]: Start difference. First operand 36 states and 56 transitions. Second operand 3 states. [2018-09-26 08:19:42,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:42,605 INFO L93 Difference]: Finished difference Result 104 states and 165 transitions. [2018-09-26 08:19:42,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:42,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-09-26 08:19:42,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:42,607 INFO L225 Difference]: With dead ends: 104 [2018-09-26 08:19:42,607 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 08:19:42,608 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 08:19:42,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 08:19:42,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-09-26 08:19:42,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-26 08:19:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 105 transitions. [2018-09-26 08:19:42,626 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 105 transitions. Word has length 20 [2018-09-26 08:19:42,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:42,627 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 105 transitions. [2018-09-26 08:19:42,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:42,633 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 105 transitions. [2018-09-26 08:19:42,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:19:42,635 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:42,635 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:42,635 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:42,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:42,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1393147734, now seen corresponding path program 1 times [2018-09-26 08:19:42,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:42,694 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-26 08:19:42,695 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:42,695 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:19:42,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:42,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:42,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:42,697 INFO L87 Difference]: Start difference. First operand 69 states and 105 transitions. Second operand 3 states. [2018-09-26 08:19:42,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:42,767 INFO L93 Difference]: Finished difference Result 112 states and 172 transitions. [2018-09-26 08:19:42,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:42,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-09-26 08:19:42,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:42,774 INFO L225 Difference]: With dead ends: 112 [2018-09-26 08:19:42,774 INFO L226 Difference]: Without dead ends: 77 [2018-09-26 08:19:42,775 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 08:19:42,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-26 08:19:42,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-26 08:19:42,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 08:19:42,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2018-09-26 08:19:42,811 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 24 [2018-09-26 08:19:42,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:42,812 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 111 transitions. [2018-09-26 08:19:42,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:42,812 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2018-09-26 08:19:42,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-26 08:19:42,817 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:42,817 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:42,817 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:42,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:42,818 INFO L82 PathProgramCache]: Analyzing trace with hash 242942978, now seen corresponding path program 1 times [2018-09-26 08:19:42,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:42,851 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-26 08:19:42,852 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:42,852 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:42,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:42,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:42,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:42,854 INFO L87 Difference]: Start difference. First operand 77 states and 111 transitions. Second operand 3 states. [2018-09-26 08:19:42,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:42,906 INFO L93 Difference]: Finished difference Result 121 states and 176 transitions. [2018-09-26 08:19:42,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:42,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-09-26 08:19:42,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:42,908 INFO L225 Difference]: With dead ends: 121 [2018-09-26 08:19:42,909 INFO L226 Difference]: Without dead ends: 82 [2018-09-26 08:19:42,909 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 08:19:42,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-26 08:19:42,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-09-26 08:19:42,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-09-26 08:19:42,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 116 transitions. [2018-09-26 08:19:42,926 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 116 transitions. Word has length 27 [2018-09-26 08:19:42,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:42,927 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 116 transitions. [2018-09-26 08:19:42,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:42,933 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 116 transitions. [2018-09-26 08:19:42,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 08:19:42,935 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:42,935 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:42,936 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:42,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:42,937 INFO L82 PathProgramCache]: Analyzing trace with hash -985389943, now seen corresponding path program 1 times [2018-09-26 08:19:42,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:42,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:42,977 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-26 08:19:42,978 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:42,978 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:42,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:42,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:42,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:42,980 INFO L87 Difference]: Start difference. First operand 82 states and 116 transitions. Second operand 3 states. [2018-09-26 08:19:43,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:43,036 INFO L93 Difference]: Finished difference Result 132 states and 188 transitions. [2018-09-26 08:19:43,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:43,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-09-26 08:19:43,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:43,038 INFO L225 Difference]: With dead ends: 132 [2018-09-26 08:19:43,039 INFO L226 Difference]: Without dead ends: 88 [2018-09-26 08:19:43,040 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 08:19:43,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-09-26 08:19:43,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-09-26 08:19:43,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-09-26 08:19:43,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 122 transitions. [2018-09-26 08:19:43,055 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 122 transitions. Word has length 32 [2018-09-26 08:19:43,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:43,056 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 122 transitions. [2018-09-26 08:19:43,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:43,056 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 122 transitions. [2018-09-26 08:19:43,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-26 08:19:43,058 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:43,058 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:43,058 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:43,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:43,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1323188226, now seen corresponding path program 1 times [2018-09-26 08:19:43,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:43,110 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 34 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 08:19:43,110 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:43,110 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:19:43,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:19:43,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:19:43,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:19:43,112 INFO L87 Difference]: Start difference. First operand 88 states and 122 transitions. Second operand 6 states. [2018-09-26 08:19:43,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:43,205 INFO L93 Difference]: Finished difference Result 193 states and 276 transitions. [2018-09-26 08:19:43,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:19:43,205 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-09-26 08:19:43,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:43,208 INFO L225 Difference]: With dead ends: 193 [2018-09-26 08:19:43,208 INFO L226 Difference]: Without dead ends: 191 [2018-09-26 08:19:43,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:19:43,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-09-26 08:19:43,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 161. [2018-09-26 08:19:43,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-26 08:19:43,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 230 transitions. [2018-09-26 08:19:43,267 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 230 transitions. Word has length 35 [2018-09-26 08:19:43,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:43,268 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 230 transitions. [2018-09-26 08:19:43,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:19:43,268 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 230 transitions. [2018-09-26 08:19:43,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-26 08:19:43,275 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:43,275 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:43,275 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:43,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:43,276 INFO L82 PathProgramCache]: Analyzing trace with hash 936505465, now seen corresponding path program 2 times [2018-09-26 08:19:43,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:43,323 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-09-26 08:19:43,324 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:43,324 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:43,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:43,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:43,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:43,327 INFO L87 Difference]: Start difference. First operand 161 states and 230 transitions. Second operand 3 states. [2018-09-26 08:19:43,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:43,386 INFO L93 Difference]: Finished difference Result 348 states and 500 transitions. [2018-09-26 08:19:43,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:43,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-09-26 08:19:43,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:43,389 INFO L225 Difference]: With dead ends: 348 [2018-09-26 08:19:43,389 INFO L226 Difference]: Without dead ends: 188 [2018-09-26 08:19:43,390 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 08:19:43,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-09-26 08:19:43,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 169. [2018-09-26 08:19:43,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-09-26 08:19:43,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 233 transitions. [2018-09-26 08:19:43,419 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 233 transitions. Word has length 53 [2018-09-26 08:19:43,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:43,420 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 233 transitions. [2018-09-26 08:19:43,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:43,421 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 233 transitions. [2018-09-26 08:19:43,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-26 08:19:43,423 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:43,423 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 8, 7, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:43,423 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:43,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:43,424 INFO L82 PathProgramCache]: Analyzing trace with hash 833306383, now seen corresponding path program 3 times [2018-09-26 08:19:43,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:43,467 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-09-26 08:19:43,468 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:43,468 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:43,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:43,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:43,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:43,470 INFO L87 Difference]: Start difference. First operand 169 states and 233 transitions. Second operand 3 states. [2018-09-26 08:19:43,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:43,544 INFO L93 Difference]: Finished difference Result 356 states and 491 transitions. [2018-09-26 08:19:43,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:43,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-09-26 08:19:43,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:43,546 INFO L225 Difference]: With dead ends: 356 [2018-09-26 08:19:43,547 INFO L226 Difference]: Without dead ends: 188 [2018-09-26 08:19:43,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:43,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-09-26 08:19:43,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 184. [2018-09-26 08:19:43,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-09-26 08:19:43,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 240 transitions. [2018-09-26 08:19:43,577 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 240 transitions. Word has length 56 [2018-09-26 08:19:43,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:43,577 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 240 transitions. [2018-09-26 08:19:43,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:43,578 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 240 transitions. [2018-09-26 08:19:43,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-26 08:19:43,579 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:43,580 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 6, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:43,580 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:43,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:43,581 INFO L82 PathProgramCache]: Analyzing trace with hash 530697784, now seen corresponding path program 1 times [2018-09-26 08:19:43,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:43,632 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-09-26 08:19:43,633 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:43,633 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:43,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:43,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:43,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:43,635 INFO L87 Difference]: Start difference. First operand 184 states and 240 transitions. Second operand 3 states. [2018-09-26 08:19:43,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:43,695 INFO L93 Difference]: Finished difference Result 367 states and 479 transitions. [2018-09-26 08:19:43,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:43,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-09-26 08:19:43,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:43,697 INFO L225 Difference]: With dead ends: 367 [2018-09-26 08:19:43,697 INFO L226 Difference]: Without dead ends: 184 [2018-09-26 08:19:43,698 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 08:19:43,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-09-26 08:19:43,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-09-26 08:19:43,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-09-26 08:19:43,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 237 transitions. [2018-09-26 08:19:43,731 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 237 transitions. Word has length 63 [2018-09-26 08:19:43,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:43,731 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 237 transitions. [2018-09-26 08:19:43,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:43,732 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 237 transitions. [2018-09-26 08:19:43,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-26 08:19:43,733 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:43,733 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 9, 8, 6, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 08:19:43,734 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:43,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:43,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1247749031, now seen corresponding path program 1 times [2018-09-26 08:19:43,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:43,807 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-09-26 08:19:43,808 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:43,808 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:43,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:43,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:43,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:43,809 INFO L87 Difference]: Start difference. First operand 184 states and 237 transitions. Second operand 3 states. [2018-09-26 08:19:43,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:43,902 INFO L93 Difference]: Finished difference Result 407 states and 521 transitions. [2018-09-26 08:19:43,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:43,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-09-26 08:19:43,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:43,905 INFO L225 Difference]: With dead ends: 407 [2018-09-26 08:19:43,905 INFO L226 Difference]: Without dead ends: 224 [2018-09-26 08:19:43,906 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 08:19:43,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-09-26 08:19:43,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 196. [2018-09-26 08:19:43,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-09-26 08:19:43,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 249 transitions. [2018-09-26 08:19:43,938 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 249 transitions. Word has length 65 [2018-09-26 08:19:43,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:43,939 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 249 transitions. [2018-09-26 08:19:43,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:43,939 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 249 transitions. [2018-09-26 08:19:43,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-26 08:19:43,940 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:43,941 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 7, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:43,941 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:43,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:43,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1302890926, now seen corresponding path program 1 times [2018-09-26 08:19:43,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:43,995 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-09-26 08:19:43,996 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:43,996 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:43,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:43,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:43,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:43,997 INFO L87 Difference]: Start difference. First operand 196 states and 249 transitions. Second operand 3 states. [2018-09-26 08:19:44,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:44,064 INFO L93 Difference]: Finished difference Result 415 states and 525 transitions. [2018-09-26 08:19:44,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:44,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-09-26 08:19:44,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:44,066 INFO L225 Difference]: With dead ends: 415 [2018-09-26 08:19:44,067 INFO L226 Difference]: Without dead ends: 220 [2018-09-26 08:19:44,067 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 08:19:44,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-09-26 08:19:44,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-09-26 08:19:44,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-09-26 08:19:44,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 273 transitions. [2018-09-26 08:19:44,106 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 273 transitions. Word has length 72 [2018-09-26 08:19:44,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:44,106 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 273 transitions. [2018-09-26 08:19:44,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:44,107 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 273 transitions. [2018-09-26 08:19:44,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-26 08:19:44,108 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:44,108 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 10, 9, 7, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:44,108 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:44,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:44,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1722349107, now seen corresponding path program 1 times [2018-09-26 08:19:44,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:44,161 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-09-26 08:19:44,162 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:44,162 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:44,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:44,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:44,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:44,164 INFO L87 Difference]: Start difference. First operand 220 states and 273 transitions. Second operand 3 states. [2018-09-26 08:19:44,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:44,245 INFO L93 Difference]: Finished difference Result 454 states and 565 transitions. [2018-09-26 08:19:44,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:44,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-09-26 08:19:44,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:44,247 INFO L225 Difference]: With dead ends: 454 [2018-09-26 08:19:44,247 INFO L226 Difference]: Without dead ends: 235 [2018-09-26 08:19:44,248 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 08:19:44,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-09-26 08:19:44,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 222. [2018-09-26 08:19:44,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-09-26 08:19:44,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 272 transitions. [2018-09-26 08:19:44,287 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 272 transitions. Word has length 74 [2018-09-26 08:19:44,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:44,288 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 272 transitions. [2018-09-26 08:19:44,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:44,288 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 272 transitions. [2018-09-26 08:19:44,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-26 08:19:44,289 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:44,289 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 8, 6, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:44,290 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:44,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:44,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1742859846, now seen corresponding path program 1 times [2018-09-26 08:19:44,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:44,386 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 222 proven. 5 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-09-26 08:19:44,387 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:44,387 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:19:44,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:19:44,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:19:44,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:19:44,388 INFO L87 Difference]: Start difference. First operand 222 states and 272 transitions. Second operand 4 states. [2018-09-26 08:19:44,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:44,506 INFO L93 Difference]: Finished difference Result 494 states and 624 transitions. [2018-09-26 08:19:44,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:19:44,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-09-26 08:19:44,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:44,508 INFO L225 Difference]: With dead ends: 494 [2018-09-26 08:19:44,509 INFO L226 Difference]: Without dead ends: 275 [2018-09-26 08:19:44,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:19:44,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-09-26 08:19:44,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 252. [2018-09-26 08:19:44,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-09-26 08:19:44,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 305 transitions. [2018-09-26 08:19:44,558 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 305 transitions. Word has length 81 [2018-09-26 08:19:44,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:44,559 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 305 transitions. [2018-09-26 08:19:44,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:19:44,559 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 305 transitions. [2018-09-26 08:19:44,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-26 08:19:44,561 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:44,561 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 11, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:44,561 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:44,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:44,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1828522542, now seen corresponding path program 2 times [2018-09-26 08:19:44,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:44,638 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2018-09-26 08:19:44,639 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:44,639 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:19:44,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:44,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:44,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:44,641 INFO L87 Difference]: Start difference. First operand 252 states and 305 transitions. Second operand 3 states. [2018-09-26 08:19:44,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:44,713 INFO L93 Difference]: Finished difference Result 495 states and 594 transitions. [2018-09-26 08:19:44,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:44,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-09-26 08:19:44,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:44,716 INFO L225 Difference]: With dead ends: 495 [2018-09-26 08:19:44,716 INFO L226 Difference]: Without dead ends: 244 [2018-09-26 08:19:44,717 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 08:19:44,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-09-26 08:19:44,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 232. [2018-09-26 08:19:44,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-09-26 08:19:44,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 274 transitions. [2018-09-26 08:19:44,764 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 274 transitions. Word has length 84 [2018-09-26 08:19:44,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:44,764 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 274 transitions. [2018-09-26 08:19:44,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:44,764 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 274 transitions. [2018-09-26 08:19:44,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-09-26 08:19:44,765 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:44,766 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 9, 7, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:44,766 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:44,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:44,766 INFO L82 PathProgramCache]: Analyzing trace with hash -636874183, now seen corresponding path program 3 times [2018-09-26 08:19:44,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:44,846 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 284 proven. 20 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-09-26 08:19:44,846 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:44,846 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:19:44,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:19:44,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:19:44,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:19:44,848 INFO L87 Difference]: Start difference. First operand 232 states and 274 transitions. Second operand 5 states. [2018-09-26 08:19:45,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:45,094 INFO L93 Difference]: Finished difference Result 523 states and 635 transitions. [2018-09-26 08:19:45,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:19:45,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-09-26 08:19:45,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:45,097 INFO L225 Difference]: With dead ends: 523 [2018-09-26 08:19:45,097 INFO L226 Difference]: Without dead ends: 292 [2018-09-26 08:19:45,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:19:45,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-09-26 08:19:45,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 272. [2018-09-26 08:19:45,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-09-26 08:19:45,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 314 transitions. [2018-09-26 08:19:45,158 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 314 transitions. Word has length 91 [2018-09-26 08:19:45,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:45,159 INFO L480 AbstractCegarLoop]: Abstraction has 272 states and 314 transitions. [2018-09-26 08:19:45,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:19:45,159 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 314 transitions. [2018-09-26 08:19:45,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-09-26 08:19:45,160 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:45,161 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 10, 8, 6, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:45,161 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:45,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:45,161 INFO L82 PathProgramCache]: Analyzing trace with hash -2106933256, now seen corresponding path program 4 times [2018-09-26 08:19:45,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:45,265 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 346 proven. 45 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-09-26 08:19:45,266 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:45,266 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:19:45,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:19:45,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:19:45,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:19:45,267 INFO L87 Difference]: Start difference. First operand 272 states and 314 transitions. Second operand 6 states. [2018-09-26 08:19:45,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:45,442 INFO L93 Difference]: Finished difference Result 603 states and 715 transitions. [2018-09-26 08:19:45,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:19:45,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2018-09-26 08:19:45,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:45,444 INFO L225 Difference]: With dead ends: 603 [2018-09-26 08:19:45,444 INFO L226 Difference]: Without dead ends: 332 [2018-09-26 08:19:45,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:19:45,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-09-26 08:19:45,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 312. [2018-09-26 08:19:45,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-09-26 08:19:45,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 354 transitions. [2018-09-26 08:19:45,510 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 354 transitions. Word has length 101 [2018-09-26 08:19:45,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:45,510 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 354 transitions. [2018-09-26 08:19:45,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:19:45,511 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 354 transitions. [2018-09-26 08:19:45,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-09-26 08:19:45,512 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:45,512 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 11, 9, 7, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 08:19:45,513 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:45,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:45,513 INFO L82 PathProgramCache]: Analyzing trace with hash -700937481, now seen corresponding path program 5 times [2018-09-26 08:19:45,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:45,624 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 408 proven. 80 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-09-26 08:19:45,624 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:45,625 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:19:45,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:19:45,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:19:45,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:19:45,626 INFO L87 Difference]: Start difference. First operand 312 states and 354 transitions. Second operand 7 states. [2018-09-26 08:19:45,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:45,838 INFO L93 Difference]: Finished difference Result 601 states and 688 transitions. [2018-09-26 08:19:45,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:19:45,838 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-09-26 08:19:45,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:45,839 INFO L225 Difference]: With dead ends: 601 [2018-09-26 08:19:45,839 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 08:19:45,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:19:45,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 08:19:45,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 08:19:45,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 08:19:45,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 08:19:45,841 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 111 [2018-09-26 08:19:45,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:45,841 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 08:19:45,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:19:45,842 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 08:19:45,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 08:19:45,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 08:19:46,002 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 98 [2018-09-26 08:19:46,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:46,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:46,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:46,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:46,457 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2018-09-26 08:19:46,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 08:19:46,639 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-09-26 08:19:46,777 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 39 [2018-09-26 08:19:47,381 WARN L178 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 40 [2018-09-26 08:19:47,658 WARN L178 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 36 [2018-09-26 08:19:47,662 INFO L422 ceAbstractionStarter]: At program point L539(lines 310 539) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368))) [2018-09-26 08:19:47,665 INFO L422 ceAbstractionStarter]: At program point L354(lines 354 372) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)) (and (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4))))) [2018-09-26 08:19:47,666 INFO L422 ceAbstractionStarter]: At program point L321(lines 279 321) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368))) [2018-09-26 08:19:47,666 INFO L426 ceAbstractionStarter]: For program point L350(lines 350 361) no Hoare annotation was computed. [2018-09-26 08:19:47,666 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 540) the Hoare annotation is: true [2018-09-26 08:19:47,668 INFO L422 ceAbstractionStarter]: At program point L317(lines 317 339) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368))) [2018-09-26 08:19:47,668 INFO L422 ceAbstractionStarter]: At program point L445(lines 445 472) the Hoare annotation is: false [2018-09-26 08:19:47,669 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 540) no Hoare annotation was computed. [2018-09-26 08:19:47,669 INFO L422 ceAbstractionStarter]: At program point L284(lines 284 311) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368))) [2018-09-26 08:19:47,672 INFO L422 ceAbstractionStarter]: At program point L474(lines 471 488) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (not (= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4416 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))))) [2018-09-26 08:19:47,673 INFO L422 ceAbstractionStarter]: At program point L408(lines 408 430) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (not (= 4416 ULTIMATE.start_ssl3_connect_~s__state~4)) (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)))) [2018-09-26 08:19:47,674 INFO L422 ceAbstractionStarter]: At program point L375(lines 375 405) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4))))) [2018-09-26 08:19:47,679 INFO L422 ceAbstractionStarter]: At program point L342(lines 342 351) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse0 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)) (and (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4))))) [2018-09-26 08:19:47,680 INFO L426 ceAbstractionStarter]: For program point L404(lines 404 419) no Hoare annotation was computed. [2018-09-26 08:19:47,680 INFO L426 ceAbstractionStarter]: For program point L371(lines 371 388) no Hoare annotation was computed. [2018-09-26 08:19:47,681 INFO L422 ceAbstractionStarter]: At program point L433(lines 433 464) the Hoare annotation is: (let ((.cse0 (not (= 4432 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse1 (not (= 4416 ULTIMATE.start_ssl3_connect_~s__state~4))) (.cse2 (not (= 4368 ULTIMATE.start_ssl3_connect_~s__state~4)))) (let ((.cse3 (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) .cse0 .cse1 .cse2))) (or (and (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) .cse0 .cse1 .cse2) (and .cse3 (= ULTIMATE.start_ssl3_connect_~s__state~4 4448)) (and .cse3 (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) .cse3 (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)))))) [2018-09-26 08:19:47,681 INFO L422 ceAbstractionStarter]: At program point L429(lines 429 446) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) [2018-09-26 08:19:47,681 INFO L426 ceAbstractionStarter]: For program point L396(lines 387 409) no Hoare annotation was computed. [2018-09-26 08:19:47,681 INFO L426 ceAbstractionStarter]: For program point L421(lines 418 434) no Hoare annotation was computed. [2018-09-26 08:19:47,682 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 540) no Hoare annotation was computed. [2018-09-26 08:19:47,682 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 473) the Hoare annotation is: false [2018-09-26 08:19:47,682 INFO L426 ceAbstractionStarter]: For program point L513(lines 513 530) no Hoare annotation was computed. [2018-09-26 08:19:47,682 INFO L426 ceAbstractionStarter]: For program point L365(lines 360 376) no Hoare annotation was computed. [2018-09-26 08:19:47,682 INFO L426 ceAbstractionStarter]: For program point L493(lines 493 510) no Hoare annotation was computed. [2018-09-26 08:19:47,717 INFO L202 PluginConnector]: Adding new model s3_clnt_3.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:19:47 BoogieIcfgContainer [2018-09-26 08:19:47,717 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:19:47,720 INFO L168 Benchmark]: Toolchain (without parser) took 6899.51 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 59.2 MB). Free memory was 1.5 GB in the beginning and 966.4 MB in the end (delta: 516.2 MB). Peak memory consumption was 575.4 MB. Max. memory is 7.1 GB. [2018-09-26 08:19:47,721 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.14 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 08:19:47,724 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.79 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 08:19:47,724 INFO L168 Benchmark]: Boogie Preprocessor took 68.38 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 08:19:47,725 INFO L168 Benchmark]: RCFGBuilder took 898.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-26 08:19:47,726 INFO L168 Benchmark]: TraceAbstraction took 5865.39 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 59.2 MB). Free memory was 1.5 GB in the beginning and 966.4 MB in the end (delta: 484.4 MB). Peak memory consumption was 543.7 MB. Max. memory is 7.1 GB. [2018-09-26 08:19:47,730 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.14 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 58.79 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 68.38 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 898.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5865.39 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 59.2 MB). Free memory was 1.5 GB in the beginning and 966.4 MB in the end (delta: 484.4 MB). Peak memory consumption was 543.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 473]: 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: 408]: Loop Invariant Derived loop invariant: ((((((ssl3_connect_~blastFlag~4 <= 2 || ssl3_connect_~blastFlag~4 == 3) && !(4416 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448) - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: (((((((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352)) || ssl3_connect_~blastFlag~4 == 3) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || ssl3_connect_~blastFlag~4 <= 2) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448)) || ssl3_connect_~s__state~4 == 4368 - InvariantResult [Line: 429]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432 - InvariantResult [Line: 445]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432)) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448)) || ((ssl3_connect_~blastFlag~4 <= 2 || ssl3_connect_~blastFlag~4 == 3) && !(4368 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 284]: Loop Invariant Derived loop invariant: (((((((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448)) || ssl3_connect_~blastFlag~4 == 3) || ssl3_connect_~blastFlag~4 <= 2) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || ssl3_connect_~s__state~4 == 4368 - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432)) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || ((ssl3_connect_~blastFlag~4 <= 2 || ssl3_connect_~blastFlag~4 == 3) && !(4368 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((((((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448)) || ssl3_connect_~blastFlag~4 == 3) || ssl3_connect_~blastFlag~4 <= 2) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || ssl3_connect_~s__state~4 == 4368 - InvariantResult [Line: 433]: Loop Invariant Derived loop invariant: ((((((ssl3_connect_~blastFlag~4 <= 2 || ssl3_connect_~blastFlag~4 == 3) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) || ((((ssl3_connect_~blastFlag~4 <= 4 && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) && ssl3_connect_~s__state~4 == 4448)) || ((((ssl3_connect_~blastFlag~4 <= 4 && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) && ssl3_connect_~s__state~4 == 4480)) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ((ssl3_connect_~blastFlag~4 <= 4 && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352)) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432)) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448)) || ((ssl3_connect_~blastFlag~4 <= 2 || ssl3_connect_~blastFlag~4 == 3) && !(4368 == ssl3_connect_~s__state~4)) - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 <= 2 || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432)) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4448)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || ssl3_connect_~blastFlag~4 == 3) || ssl3_connect_~s__state~4 == 4368 - InvariantResult [Line: 471]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~4 <= 2 || ssl3_connect_~blastFlag~4 == 3) && !(4432 == ssl3_connect_~s__state~4)) && !(4416 == ssl3_connect_~s__state~4)) && !(4368 == ssl3_connect_~s__state~4)) || (ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4480)) || ((((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && ssl3_connect_~blastFlag~4 <= 4) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 1 error locations. SAFE Result, 5.7s OverallTime, 18 OverallIterations, 15 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 1.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 283 SDtfs, 94 SDslu, 155 SDs, 0 SdLazy, 903 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=312occurred in iteration=17, 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.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 169 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 288 NumberOfFragments, 586 HoareAnnotationTreeSize, 14 FomulaSimplifications, 29605 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 14 FomulaSimplificationsInter, 45310 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1016 NumberOfCodeBlocks, 1016 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 998 ConstructedInterpolants, 0 QuantifiedInterpolants, 116642 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 13 PerfectInterpolantSequences, 3568/3752 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_3.cil.c_21.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-19-47-754.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_3.cil.c_21.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-19-47-754.csv Received shutdown request...