java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./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_srvr_3.cil.c_20.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 08:49:52,344 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 08:49:52,346 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 08:49:52,358 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 08:49:52,359 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 08:49:52,360 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 08:49:52,361 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 08:49:52,363 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 08:49:52,365 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 08:49:52,366 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 08:49:52,367 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 08:49:52,367 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 08:49:52,368 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 08:49:52,369 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 08:49:52,370 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 08:49:52,371 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 08:49:52,372 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 08:49:52,374 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 08:49:52,376 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 08:49:52,377 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 08:49:52,378 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 08:49:52,379 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 08:49:52,382 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 08:49:52,382 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 08:49:52,382 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 08:49:52,383 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 08:49:52,384 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 08:49:52,385 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 08:49:52,386 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 08:49:52,387 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 08:49:52,387 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 08:49:52,388 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 08:49:52,388 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 08:49:52,388 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 08:49:52,389 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 08:49:52,390 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 08:49:52,390 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 08:49:52,405 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 08:49:52,405 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 08:49:52,406 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 08:49:52,406 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 08:49:52,407 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 08:49:52,407 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 08:49:52,407 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 08:49:52,407 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 08:49:52,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 08:49:52,482 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 08:49:52,487 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 08:49:52,489 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 08:49:52,490 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 08:49:52,491 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3.cil.c_20.bpl [2018-07-25 08:49:52,491 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3.cil.c_20.bpl' [2018-07-25 08:49:52,586 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 08:49:52,588 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 08:49:52,589 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 08:49:52,589 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 08:49:52,590 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 08:49:52,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:49:52" (1/1) ... [2018-07-25 08:49:52,633 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:49:52" (1/1) ... [2018-07-25 08:49:52,640 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 08:49:52,641 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 08:49:52,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 08:49:52,642 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 08:49:52,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:49:52" (1/1) ... [2018-07-25 08:49:52,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:49:52" (1/1) ... [2018-07-25 08:49:52,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:49:52" (1/1) ... [2018-07-25 08:49:52,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:49:52" (1/1) ... [2018-07-25 08:49:52,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:49:52" (1/1) ... [2018-07-25 08:49:52,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:49:52" (1/1) ... [2018-07-25 08:49:52,674 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:49:52" (1/1) ... [2018-07-25 08:49:52,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 08:49:52,679 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 08:49:52,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 08:49:52,680 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 08:49:52,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:49:52" (1/1) ... [2018-07-25 08:49:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 08:49:52,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 08:49:53,283 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 08:49:53,284 INFO L202 PluginConnector]: Adding new model s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:49:53 BoogieIcfgContainer [2018-07-25 08:49:53,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 08:49:53,285 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 08:49:53,286 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 08:49:53,291 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 08:49:53,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:49:52" (1/2) ... [2018-07-25 08:49:53,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c8eea6 and model type s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 08:49:53, skipping insertion in model container [2018-07-25 08:49:53,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:49:53" (2/2) ... [2018-07-25 08:49:53,298 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.cil.c_20.bpl [2018-07-25 08:49:53,309 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 08:49:53,320 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 08:49:53,365 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 08:49:53,366 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 08:49:53,366 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 08:49:53,367 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 08:49:53,367 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 08:49:53,367 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 08:49:53,367 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 08:49:53,367 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 08:49:53,368 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 08:49:53,381 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-07-25 08:49:53,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 08:49:53,391 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:53,393 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:53,395 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:53,400 INFO L82 PathProgramCache]: Analyzing trace with hash -505433777, now seen corresponding path program 1 times [2018-07-25 08:49:53,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:53,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:53,528 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:49:53,529 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 08:49:53,534 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:49:53,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:49:53,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:49:53,554 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-07-25 08:49:53,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:53,690 INFO L93 Difference]: Finished difference Result 47 states and 81 transitions. [2018-07-25 08:49:53,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:49:53,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-07-25 08:49:53,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:53,714 INFO L225 Difference]: With dead ends: 47 [2018-07-25 08:49:53,714 INFO L226 Difference]: Without dead ends: 30 [2018-07-25 08:49:53,722 INFO L574 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-07-25 08:49:53,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-25 08:49:53,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-07-25 08:49:53,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-25 08:49:53,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 51 transitions. [2018-07-25 08:49:53,768 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 51 transitions. Word has length 15 [2018-07-25 08:49:53,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:53,768 INFO L472 AbstractCegarLoop]: Abstraction has 30 states and 51 transitions. [2018-07-25 08:49:53,768 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:49:53,769 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 51 transitions. [2018-07-25 08:49:53,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 08:49:53,770 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:53,770 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:53,770 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:53,771 INFO L82 PathProgramCache]: Analyzing trace with hash -912155323, now seen corresponding path program 1 times [2018-07-25 08:49:53,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:53,813 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:53,813 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:49:53,813 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 08:49:53,815 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:49:53,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:49:53,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:49:53,816 INFO L87 Difference]: Start difference. First operand 30 states and 51 transitions. Second operand 3 states. [2018-07-25 08:49:53,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:53,905 INFO L93 Difference]: Finished difference Result 75 states and 129 transitions. [2018-07-25 08:49:53,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:49:53,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-07-25 08:49:53,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:53,911 INFO L225 Difference]: With dead ends: 75 [2018-07-25 08:49:53,911 INFO L226 Difference]: Without dead ends: 46 [2018-07-25 08:49:53,914 INFO L574 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-07-25 08:49:53,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-07-25 08:49:53,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-07-25 08:49:53,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-07-25 08:49:53,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 77 transitions. [2018-07-25 08:49:53,942 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 77 transitions. Word has length 23 [2018-07-25 08:49:53,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:53,942 INFO L472 AbstractCegarLoop]: Abstraction has 46 states and 77 transitions. [2018-07-25 08:49:53,942 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:49:53,942 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 77 transitions. [2018-07-25 08:49:53,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 08:49:53,944 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:53,945 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:53,945 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:53,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1107910457, now seen corresponding path program 1 times [2018-07-25 08:49:53,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:53,988 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:53,988 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:49:53,988 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 08:49:53,989 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:49:53,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:49:53,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:49:53,990 INFO L87 Difference]: Start difference. First operand 46 states and 77 transitions. Second operand 3 states. [2018-07-25 08:49:54,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:54,063 INFO L93 Difference]: Finished difference Result 109 states and 185 transitions. [2018-07-25 08:49:54,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:49:54,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-07-25 08:49:54,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:54,066 INFO L225 Difference]: With dead ends: 109 [2018-07-25 08:49:54,066 INFO L226 Difference]: Without dead ends: 63 [2018-07-25 08:49:54,067 INFO L574 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-07-25 08:49:54,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-25 08:49:54,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-25 08:49:54,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-25 08:49:54,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 106 transitions. [2018-07-25 08:49:54,097 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 106 transitions. Word has length 28 [2018-07-25 08:49:54,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:54,098 INFO L472 AbstractCegarLoop]: Abstraction has 63 states and 106 transitions. [2018-07-25 08:49:54,098 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:49:54,098 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 106 transitions. [2018-07-25 08:49:54,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-25 08:49:54,100 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:54,100 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:54,100 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:54,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1423527905, now seen corresponding path program 1 times [2018-07-25 08:49:54,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:54,163 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-07-25 08:49:54,163 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:49:54,164 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 08:49:54,164 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:49:54,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:49:54,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:49:54,165 INFO L87 Difference]: Start difference. First operand 63 states and 106 transitions. Second operand 3 states. [2018-07-25 08:49:54,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:54,219 INFO L93 Difference]: Finished difference Result 132 states and 223 transitions. [2018-07-25 08:49:54,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:49:54,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-07-25 08:49:54,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:54,221 INFO L225 Difference]: With dead ends: 132 [2018-07-25 08:49:54,221 INFO L226 Difference]: Without dead ends: 70 [2018-07-25 08:49:54,222 INFO L574 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-07-25 08:49:54,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-07-25 08:49:54,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-07-25 08:49:54,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-25 08:49:54,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 114 transitions. [2018-07-25 08:49:54,239 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 114 transitions. Word has length 30 [2018-07-25 08:49:54,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:54,240 INFO L472 AbstractCegarLoop]: Abstraction has 70 states and 114 transitions. [2018-07-25 08:49:54,240 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:49:54,240 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 114 transitions. [2018-07-25 08:49:54,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 08:49:54,242 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:54,242 INFO L354 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:54,242 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:54,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1035189339, now seen corresponding path program 1 times [2018-07-25 08:49:54,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:54,275 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-07-25 08:49:54,275 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:49:54,276 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 08:49:54,276 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:49:54,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:49:54,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:49:54,277 INFO L87 Difference]: Start difference. First operand 70 states and 114 transitions. Second operand 3 states. [2018-07-25 08:49:54,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:54,328 INFO L93 Difference]: Finished difference Result 145 states and 237 transitions. [2018-07-25 08:49:54,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:49:54,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-07-25 08:49:54,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:54,330 INFO L225 Difference]: With dead ends: 145 [2018-07-25 08:49:54,330 INFO L226 Difference]: Without dead ends: 76 [2018-07-25 08:49:54,331 INFO L574 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-07-25 08:49:54,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-07-25 08:49:54,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-07-25 08:49:54,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-25 08:49:54,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 119 transitions. [2018-07-25 08:49:54,347 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 119 transitions. Word has length 36 [2018-07-25 08:49:54,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:54,348 INFO L472 AbstractCegarLoop]: Abstraction has 76 states and 119 transitions. [2018-07-25 08:49:54,348 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:49:54,348 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 119 transitions. [2018-07-25 08:49:54,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-25 08:49:54,350 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:54,350 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:54,351 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:54,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1742811576, now seen corresponding path program 1 times [2018-07-25 08:49:54,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:54,384 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-07-25 08:49:54,385 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:49:54,385 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 08:49:54,385 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:49:54,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:49:54,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:49:54,386 INFO L87 Difference]: Start difference. First operand 76 states and 119 transitions. Second operand 3 states. [2018-07-25 08:49:54,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:54,499 INFO L93 Difference]: Finished difference Result 163 states and 255 transitions. [2018-07-25 08:49:54,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:49:54,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-07-25 08:49:54,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:54,501 INFO L225 Difference]: With dead ends: 163 [2018-07-25 08:49:54,502 INFO L226 Difference]: Without dead ends: 87 [2018-07-25 08:49:54,503 INFO L574 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-07-25 08:49:54,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-25 08:49:54,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-25 08:49:54,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-25 08:49:54,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 133 transitions. [2018-07-25 08:49:54,522 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 133 transitions. Word has length 40 [2018-07-25 08:49:54,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:54,526 INFO L472 AbstractCegarLoop]: Abstraction has 87 states and 133 transitions. [2018-07-25 08:49:54,526 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:49:54,526 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 133 transitions. [2018-07-25 08:49:54,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-25 08:49:54,528 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:54,529 INFO L354 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:54,529 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:54,530 INFO L82 PathProgramCache]: Analyzing trace with hash -720649021, now seen corresponding path program 1 times [2018-07-25 08:49:54,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:54,567 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-07-25 08:49:54,567 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:49:54,568 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 08:49:54,568 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:49:54,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:49:54,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:49:54,569 INFO L87 Difference]: Start difference. First operand 87 states and 133 transitions. Second operand 3 states. [2018-07-25 08:49:54,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:54,636 INFO L93 Difference]: Finished difference Result 178 states and 273 transitions. [2018-07-25 08:49:54,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:49:54,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-07-25 08:49:54,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:54,639 INFO L225 Difference]: With dead ends: 178 [2018-07-25 08:49:54,639 INFO L226 Difference]: Without dead ends: 92 [2018-07-25 08:49:54,640 INFO L574 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-07-25 08:49:54,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-07-25 08:49:54,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-07-25 08:49:54,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-07-25 08:49:54,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2018-07-25 08:49:54,664 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 41 [2018-07-25 08:49:54,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:54,665 INFO L472 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2018-07-25 08:49:54,665 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:49:54,665 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2018-07-25 08:49:54,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-25 08:49:54,667 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:54,667 INFO L354 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:54,667 INFO L415 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:54,668 INFO L82 PathProgramCache]: Analyzing trace with hash 483195845, now seen corresponding path program 1 times [2018-07-25 08:49:54,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:54,708 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-07-25 08:49:54,709 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:49:54,709 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 08:49:54,709 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:49:54,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:49:54,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:49:54,710 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand 3 states. [2018-07-25 08:49:54,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:54,751 INFO L93 Difference]: Finished difference Result 187 states and 273 transitions. [2018-07-25 08:49:54,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:49:54,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-07-25 08:49:54,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:54,752 INFO L225 Difference]: With dead ends: 187 [2018-07-25 08:49:54,752 INFO L226 Difference]: Without dead ends: 96 [2018-07-25 08:49:54,753 INFO L574 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-07-25 08:49:54,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-07-25 08:49:54,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-07-25 08:49:54,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-25 08:49:54,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 132 transitions. [2018-07-25 08:49:54,784 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 132 transitions. Word has length 45 [2018-07-25 08:49:54,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:54,784 INFO L472 AbstractCegarLoop]: Abstraction has 96 states and 132 transitions. [2018-07-25 08:49:54,784 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:49:54,785 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 132 transitions. [2018-07-25 08:49:54,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-25 08:49:54,786 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:54,786 INFO L354 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:54,787 INFO L415 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:54,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1326956691, now seen corresponding path program 1 times [2018-07-25 08:49:54,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:54,857 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-07-25 08:49:54,858 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:54,858 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 08:49:54,858 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 08:49:54,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 08:49:54,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:49:54,861 INFO L87 Difference]: Start difference. First operand 96 states and 132 transitions. Second operand 4 states. [2018-07-25 08:49:54,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:54,977 INFO L93 Difference]: Finished difference Result 282 states and 382 transitions. [2018-07-25 08:49:54,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 08:49:54,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-07-25 08:49:54,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:54,979 INFO L225 Difference]: With dead ends: 282 [2018-07-25 08:49:54,979 INFO L226 Difference]: Without dead ends: 179 [2018-07-25 08:49:54,980 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:49:54,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-07-25 08:49:55,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 98. [2018-07-25 08:49:55,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-07-25 08:49:55,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 129 transitions. [2018-07-25 08:49:55,003 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 129 transitions. Word has length 48 [2018-07-25 08:49:55,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:55,004 INFO L472 AbstractCegarLoop]: Abstraction has 98 states and 129 transitions. [2018-07-25 08:49:55,004 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 08:49:55,005 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 129 transitions. [2018-07-25 08:49:55,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-25 08:49:55,006 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:55,006 INFO L354 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:55,012 INFO L415 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:55,012 INFO L82 PathProgramCache]: Analyzing trace with hash -572978626, now seen corresponding path program 1 times [2018-07-25 08:49:55,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:55,055 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-07-25 08:49:55,056 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:49:55,056 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 08:49:55,056 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:49:55,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:49:55,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:49:55,057 INFO L87 Difference]: Start difference. First operand 98 states and 129 transitions. Second operand 3 states. [2018-07-25 08:49:55,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:55,134 INFO L93 Difference]: Finished difference Result 194 states and 256 transitions. [2018-07-25 08:49:55,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:49:55,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-07-25 08:49:55,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:55,136 INFO L225 Difference]: With dead ends: 194 [2018-07-25 08:49:55,136 INFO L226 Difference]: Without dead ends: 94 [2018-07-25 08:49:55,137 INFO L574 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-07-25 08:49:55,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-07-25 08:49:55,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-07-25 08:49:55,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-07-25 08:49:55,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 116 transitions. [2018-07-25 08:49:55,166 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 116 transitions. Word has length 60 [2018-07-25 08:49:55,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:55,167 INFO L472 AbstractCegarLoop]: Abstraction has 94 states and 116 transitions. [2018-07-25 08:49:55,167 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:49:55,167 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2018-07-25 08:49:55,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-07-25 08:49:55,169 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:55,169 INFO L354 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:55,169 INFO L415 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:55,170 INFO L82 PathProgramCache]: Analyzing trace with hash -396241696, now seen corresponding path program 1 times [2018-07-25 08:49:55,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:55,274 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-07-25 08:49:55,274 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:49:55,275 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 08:49:55,275 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:49:55,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:49:55,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:49:55,279 INFO L87 Difference]: Start difference. First operand 94 states and 116 transitions. Second operand 3 states. [2018-07-25 08:49:55,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:55,349 INFO L93 Difference]: Finished difference Result 195 states and 241 transitions. [2018-07-25 08:49:55,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:49:55,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2018-07-25 08:49:55,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:55,352 INFO L225 Difference]: With dead ends: 195 [2018-07-25 08:49:55,352 INFO L226 Difference]: Without dead ends: 104 [2018-07-25 08:49:55,353 INFO L574 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-07-25 08:49:55,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-07-25 08:49:55,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-07-25 08:49:55,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-07-25 08:49:55,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2018-07-25 08:49:55,380 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 93 [2018-07-25 08:49:55,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:55,380 INFO L472 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2018-07-25 08:49:55,381 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:49:55,381 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2018-07-25 08:49:55,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-07-25 08:49:55,382 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:55,382 INFO L354 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:55,386 INFO L415 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:55,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1439385072, now seen corresponding path program 1 times [2018-07-25 08:49:55,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:55,511 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 60 proven. 81 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2018-07-25 08:49:55,512 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:55,512 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 08:49:55,513 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 08:49:55,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 08:49:55,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:49:55,514 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand 4 states. [2018-07-25 08:49:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:55,598 INFO L93 Difference]: Finished difference Result 259 states and 315 transitions. [2018-07-25 08:49:55,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 08:49:55,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-07-25 08:49:55,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:55,601 INFO L225 Difference]: With dead ends: 259 [2018-07-25 08:49:55,601 INFO L226 Difference]: Without dead ends: 257 [2018-07-25 08:49:55,604 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:49:55,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-07-25 08:49:55,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 194. [2018-07-25 08:49:55,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-07-25 08:49:55,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 236 transitions. [2018-07-25 08:49:55,655 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 236 transitions. Word has length 103 [2018-07-25 08:49:55,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:55,656 INFO L472 AbstractCegarLoop]: Abstraction has 194 states and 236 transitions. [2018-07-25 08:49:55,657 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 08:49:55,657 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 236 transitions. [2018-07-25 08:49:55,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-07-25 08:49:55,659 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:55,659 INFO L354 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 12, 11, 10, 9, 8, 7, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:55,660 INFO L415 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:55,660 INFO L82 PathProgramCache]: Analyzing trace with hash -742527895, now seen corresponding path program 2 times [2018-07-25 08:49:55,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:55,774 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-07-25 08:49:55,774 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:49:55,774 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 08:49:55,775 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:49:55,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:49:55,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:49:55,780 INFO L87 Difference]: Start difference. First operand 194 states and 236 transitions. Second operand 3 states. [2018-07-25 08:49:55,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:55,868 INFO L93 Difference]: Finished difference Result 385 states and 469 transitions. [2018-07-25 08:49:55,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:49:55,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2018-07-25 08:49:55,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:55,871 INFO L225 Difference]: With dead ends: 385 [2018-07-25 08:49:55,871 INFO L226 Difference]: Without dead ends: 194 [2018-07-25 08:49:55,872 INFO L574 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-07-25 08:49:55,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-07-25 08:49:55,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-07-25 08:49:55,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-07-25 08:49:55,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 230 transitions. [2018-07-25 08:49:55,918 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 230 transitions. Word has length 139 [2018-07-25 08:49:55,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:55,918 INFO L472 AbstractCegarLoop]: Abstraction has 194 states and 230 transitions. [2018-07-25 08:49:55,918 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:49:55,919 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 230 transitions. [2018-07-25 08:49:55,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-25 08:49:55,920 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:55,921 INFO L354 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 16, 15, 14, 12, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:55,921 INFO L415 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:55,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1179294915, now seen corresponding path program 1 times [2018-07-25 08:49:55,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:56,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 736 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-07-25 08:49:56,100 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:56,100 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 08:49:56,101 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 08:49:56,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 08:49:56,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:49:56,102 INFO L87 Difference]: Start difference. First operand 194 states and 230 transitions. Second operand 4 states. [2018-07-25 08:49:56,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:56,177 INFO L93 Difference]: Finished difference Result 332 states and 398 transitions. [2018-07-25 08:49:56,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 08:49:56,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-07-25 08:49:56,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:56,178 INFO L225 Difference]: With dead ends: 332 [2018-07-25 08:49:56,178 INFO L226 Difference]: Without dead ends: 0 [2018-07-25 08:49:56,179 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:49:56,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-25 08:49:56,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-25 08:49:56,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-25 08:49:56,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-25 08:49:56,181 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 180 [2018-07-25 08:49:56,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:56,181 INFO L472 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-25 08:49:56,181 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 08:49:56,181 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-25 08:49:56,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-25 08:49:56,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-25 08:49:56,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-25 08:49:57,245 INFO L418 ceAbstractionStarter]: At program point L415(lines 415 427) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse0 .cse1 .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) .cse3 .cse4))) [2018-07-25 08:49:57,246 INFO L418 ceAbstractionStarter]: At program point L469(lines 469 491) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) [2018-07-25 08:49:57,248 INFO L418 ceAbstractionStarter]: At program point L370(lines 370 378) the Hoare annotation is: (let ((.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse7 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse1 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse6 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse1 .cse2 .cse3 .cse4 .cse7 .cse5 .cse6) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse6)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576) .cse5 .cse6))) [2018-07-25 08:49:57,249 INFO L418 ceAbstractionStarter]: At program point L271(lines 271 287) the Hoare annotation is: (let ((.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2))) (or (and .cse0 .cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)))) [2018-07-25 08:49:57,253 INFO L422 ceAbstractionStarter]: For program point L461(lines 461 482) no Hoare annotation was computed. [2018-07-25 08:49:57,253 INFO L418 ceAbstractionStarter]: At program point L490(lines 490 505) the Hoare annotation is: false [2018-07-25 08:49:57,253 INFO L425 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 507) the Hoare annotation is: true [2018-07-25 08:49:57,253 INFO L422 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 507) no Hoare annotation was computed. [2018-07-25 08:49:57,254 INFO L418 ceAbstractionStarter]: At program point L313(lines 313 324) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse4 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576)) (.cse6 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse1 .cse2 .cse5 .cse6 .cse7) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (and .cse4 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7))) [2018-07-25 08:49:57,255 INFO L418 ceAbstractionStarter]: At program point L400(lines 400 412) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse0 .cse1 .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) .cse3 .cse4))) [2018-07-25 08:49:57,255 INFO L418 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 1 507) the Hoare annotation is: false [2018-07-25 08:49:57,256 INFO L418 ceAbstractionStarter]: At program point L380(lines 380 397) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse0 .cse1 .cse2 .cse3 .cse4) (and (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) .cse3 .cse4)) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-07-25 08:49:57,257 INFO L418 ceAbstractionStarter]: At program point L347(lines 347 365) the Hoare annotation is: (let ((.cse3 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse6 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576)) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse2 .cse3 .cse6 .cse5 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse5 .cse7) (and .cse1 .cse0 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576) .cse5))) [2018-07-25 08:49:57,258 INFO L418 ceAbstractionStarter]: At program point L442(lines 442 462) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5))))) [2018-07-25 08:49:57,262 INFO L418 ceAbstractionStarter]: At program point L504(lines 286 504) the Hoare annotation is: (let ((.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2))) (or (and .cse0 .cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)))) [2018-07-25 08:49:57,263 INFO L422 ceAbstractionStarter]: For program point L438(lines 438 449) no Hoare annotation was computed. [2018-07-25 08:49:57,263 INFO L418 ceAbstractionStarter]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 506) the Hoare annotation is: false [2018-07-25 08:49:57,264 INFO L418 ceAbstractionStarter]: At program point L430(lines 430 439) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2) .cse0 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8640 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse0 (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 .cse2))) [2018-07-25 08:49:57,266 INFO L418 ceAbstractionStarter]: At program point L327(lines 327 344) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2)) (.cse1 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse3 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576)) (.cse6 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and .cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse1 .cse0 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2018-07-25 08:49:57,266 INFO L422 ceAbstractionStarter]: For program point L484(lines 481 499) no Hoare annotation was computed. [2018-07-25 08:49:57,266 INFO L422 ceAbstractionStarter]: For program point L451(lines 448 470) no Hoare annotation was computed. [2018-07-25 08:49:57,267 INFO L418 ceAbstractionStarter]: At program point L295(lines 258 295) the Hoare annotation is: (let ((.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2))) (or (and .cse0 .cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)) (and (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5)) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5)) .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)))) [2018-07-25 08:49:57,268 INFO L418 ceAbstractionStarter]: At program point L291(lines 291 310) the Hoare annotation is: (let ((.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse1 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse5 (<= ULTIMATE.start_ssl3_accept_~s__state~5 8576)) (.cse6 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse7 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~5))) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 2))) (or (and .cse0 .cse1 .cse2) (and .cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 3) .cse4 .cse1 .cse5 .cse6 .cse7) (and .cse3 .cse4 .cse1 .cse2 .cse5 .cse6 .cse7) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~5 8576)) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~5 3) (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~5)))) [2018-07-25 08:49:57,304 INFO L202 PluginConnector]: Adding new model s3_srvr_3.cil.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 08:49:57 BoogieIcfgContainer [2018-07-25 08:49:57,305 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 08:49:57,306 INFO L168 Benchmark]: Toolchain (without parser) took 4718.88 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 57.7 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 45.5 MB). Peak memory consumption was 490.6 MB. Max. memory is 7.1 GB. [2018-07-25 08:49:57,309 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 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-07-25 08:49:57,312 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.67 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-07-25 08:49:57,312 INFO L168 Benchmark]: Boogie Preprocessor took 37.66 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-07-25 08:49:57,313 INFO L168 Benchmark]: RCFGBuilder took 604.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. [2018-07-25 08:49:57,314 INFO L168 Benchmark]: TraceAbstraction took 4019.20 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 57.7 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 24.3 MB). Peak memory consumption was 469.4 MB. Max. memory is 7.1 GB. [2018-07-25 08:49:57,318 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.24 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 51.67 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 37.66 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 604.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4019.20 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 57.7 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 24.3 MB). Peak memory consumption was 469.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 506]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: ((((((ssl3_accept_~blastFlag~5 <= 2 && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || ((ssl3_accept_~blastFlag~5 <= 2 && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576)) || ((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~5 <= 2 && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (((((!(8656 == ssl3_accept_~s__state~5) && !(8640 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 286]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) - InvariantResult [Line: 258]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) - InvariantResult [Line: 469]: Loop Invariant Derived loop invariant: ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5 - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: ((((((ssl3_accept_~blastFlag~5 <= 2 && !(8512 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 370]: Loop Invariant Derived loop invariant: (((((((((ssl3_accept_~blastFlag~5 <= 2 && !(8512 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3 && ((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (((((ssl3_accept_~blastFlag~5 <= 2 && !(8512 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 327]: Loop Invariant Derived loop invariant: (((((((ssl3_accept_~blastFlag~5 <= 2 && !(8512 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576)) || ((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: ((((((ssl3_accept_~blastFlag~5 <= 2 && !(8512 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (!(8576 == ssl3_accept_~s__state~5) && ((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: ((((((((ssl3_accept_~blastFlag~5 <= 2 && !(8512 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || ((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || ((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~blastFlag~5 <= 2) && !(8496 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 291]: Loop Invariant Derived loop invariant: (((((ssl3_accept_~blastFlag~5 <= 2 && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) || ((((((!(8512 == ssl3_accept_~s__state~5) && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 3) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || ((((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8576 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5))) || (ssl3_accept_~blastFlag~5 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~5 <= 8576)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5) - InvariantResult [Line: 400]: Loop Invariant Derived loop invariant: ((((((ssl3_accept_~blastFlag~5 <= 2 && !(8512 == ssl3_accept_~s__state~5)) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || (((((!(8512 == ssl3_accept_~s__state~5) && !(8496 == ssl3_accept_~s__state~5)) && !(8448 == ssl3_accept_~s__state~5)) && ssl3_accept_~s__state~5 <= 8576) && !(8528 == ssl3_accept_~s__state~5)) && !(8544 == ssl3_accept_~s__state~5)) - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: ((ssl3_accept_~blastFlag~5 <= 2 && !(8448 == ssl3_accept_~s__state~5)) || (ssl3_accept_~blastFlag~5 <= 3 && 8672 <= ssl3_accept_~s__state~5)) || ((!(8656 == ssl3_accept_~s__state~5) && !(8448 == ssl3_accept_~s__state~5)) && !(8672 == ssl3_accept_~s__state~5)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. SAFE Result, 3.9s OverallTime, 14 OverallIterations, 19 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 194 SDtfs, 117 SDslu, 97 SDs, 0 SdLazy, 487 SolverSat, 172 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 144 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 18 PreInvPairs, 174 NumberOfFragments, 915 HoareAnnotationTreeSize, 18 FomulaSimplifications, 6403 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 18 FomulaSimplificationsInter, 3244 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 881 NumberOfCodeBlocks, 881 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 867 ConstructedInterpolants, 0 QuantifiedInterpolants, 123055 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 3067/3164 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_3.cil.c_20.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_08-49-57-334.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_3.cil.c_20.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_08-49-57-334.csv Received shutdown request...