java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_1.cil.c_16.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 11:48:55,552 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 11:48:55,554 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 11:48:55,567 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 11:48:55,567 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 11:48:55,568 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 11:48:55,569 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 11:48:55,571 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 11:48:55,573 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 11:48:55,574 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 11:48:55,575 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 11:48:55,575 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 11:48:55,576 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 11:48:55,577 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 11:48:55,578 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 11:48:55,579 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 11:48:55,580 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 11:48:55,582 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 11:48:55,584 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 11:48:55,585 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 11:48:55,587 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 11:48:55,588 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 11:48:55,590 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 11:48:55,590 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 11:48:55,591 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 11:48:55,591 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 11:48:55,592 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 11:48:55,593 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 11:48:55,594 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 11:48:55,595 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 11:48:55,595 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 11:48:55,596 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 11:48:55,596 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 11:48:55,596 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 11:48:55,597 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 11:48:55,598 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 11:48:55,598 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-02 11:48:55,626 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 11:48:55,627 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 11:48:55,628 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 11:48:55,628 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 11:48:55,631 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 11:48:55,631 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 11:48:55,631 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 11:48:55,631 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 11:48:55,632 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 11:48:55,632 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 11:48:55,632 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 11:48:55,632 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 11:48:55,633 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 11:48:55,633 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 11:48:55,633 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 11:48:55,634 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 11:48:55,634 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 11:48:55,634 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 11:48:55,634 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 11:48:55,634 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 11:48:55,635 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 11:48:55,635 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 11:48:55,635 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:48:55,635 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 11:48:55,636 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 11:48:55,637 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 11:48:55,637 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 11:48:55,637 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 11:48:55,637 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 11:48:55,637 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 11:48:55,708 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 11:48:55,724 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 11:48:55,730 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 11:48:55,732 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 11:48:55,733 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 11:48:55,734 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_1.cil.c_16.bpl [2018-10-02 11:48:55,734 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_1.cil.c_16.bpl' [2018-10-02 11:48:55,849 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 11:48:55,853 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 11:48:55,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 11:48:55,854 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 11:48:55,854 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 11:48:55,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:55" (1/1) ... [2018-10-02 11:48:55,897 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:55" (1/1) ... [2018-10-02 11:48:55,910 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 11:48:55,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 11:48:55,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 11:48:55,911 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 11:48:55,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:55" (1/1) ... [2018-10-02 11:48:55,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:55" (1/1) ... [2018-10-02 11:48:55,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:55" (1/1) ... [2018-10-02 11:48:55,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:55" (1/1) ... [2018-10-02 11:48:55,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:55" (1/1) ... [2018-10-02 11:48:55,960 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:55" (1/1) ... [2018-10-02 11:48:55,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:55" (1/1) ... [2018-10-02 11:48:55,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 11:48:55,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 11:48:55,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 11:48:55,978 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 11:48:55,979 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:48:56,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 11:48:56,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 11:48:56,713 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 11:48:56,713 INFO L202 PluginConnector]: Adding new model s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:48:56 BoogieIcfgContainer [2018-10-02 11:48:56,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 11:48:56,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 11:48:56,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 11:48:56,718 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 11:48:56,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:48:55" (1/2) ... [2018-10-02 11:48:56,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da6ef09 and model type s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:48:56, skipping insertion in model container [2018-10-02 11:48:56,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:48:56" (2/2) ... [2018-10-02 11:48:56,721 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.cil.c_16.bpl [2018-10-02 11:48:56,731 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 11:48:56,740 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 11:48:56,784 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 11:48:56,785 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 11:48:56,785 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 11:48:56,785 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 11:48:56,785 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 11:48:56,786 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 11:48:56,786 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 11:48:56,786 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 11:48:56,786 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 11:48:56,804 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-10-02 11:48:56,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 11:48:56,811 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:56,812 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:56,813 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:56,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:56,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1912595551, now seen corresponding path program 1 times [2018-10-02 11:48:56,822 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:56,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:56,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:56,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:56,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:57,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:48:57,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:57,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:48:57,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:57,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:57,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:57,048 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. [2018-10-02 11:48:57,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:57,255 INFO L93 Difference]: Finished difference Result 33 states and 56 transitions. [2018-10-02 11:48:57,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:57,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-02 11:48:57,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:57,269 INFO L225 Difference]: With dead ends: 33 [2018-10-02 11:48:57,269 INFO L226 Difference]: Without dead ends: 18 [2018-10-02 11:48:57,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:57,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-02 11:48:57,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-02 11:48:57,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-02 11:48:57,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2018-10-02 11:48:57,311 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 28 transitions. Word has length 10 [2018-10-02 11:48:57,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:57,312 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 28 transitions. [2018-10-02 11:48:57,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:57,312 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 28 transitions. [2018-10-02 11:48:57,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 11:48:57,313 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:57,313 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:57,314 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:57,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:57,314 INFO L82 PathProgramCache]: Analyzing trace with hash -694754889, now seen corresponding path program 1 times [2018-10-02 11:48:57,315 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:57,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:57,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:57,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:57,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:48:57,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:57,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:48:57,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:57,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:57,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:57,404 INFO L87 Difference]: Start difference. First operand 18 states and 28 transitions. Second operand 3 states. [2018-10-02 11:48:57,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:57,698 INFO L93 Difference]: Finished difference Result 37 states and 59 transitions. [2018-10-02 11:48:57,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:57,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-10-02 11:48:57,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:57,700 INFO L225 Difference]: With dead ends: 37 [2018-10-02 11:48:57,701 INFO L226 Difference]: Without dead ends: 22 [2018-10-02 11:48:57,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:57,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-02 11:48:57,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-02 11:48:57,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-02 11:48:57,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2018-10-02 11:48:57,711 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 13 [2018-10-02 11:48:57,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:57,714 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-10-02 11:48:57,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:57,714 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2018-10-02 11:48:57,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-02 11:48:57,715 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:57,715 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:57,718 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:57,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:57,719 INFO L82 PathProgramCache]: Analyzing trace with hash 479368949, now seen corresponding path program 1 times [2018-10-02 11:48:57,719 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:57,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:57,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:57,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:57,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:57,829 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-02 11:48:57,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:57,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:48:57,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:57,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:57,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:57,832 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2018-10-02 11:48:57,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:57,960 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2018-10-02 11:48:57,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:57,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-02 11:48:57,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:57,962 INFO L225 Difference]: With dead ends: 46 [2018-10-02 11:48:57,962 INFO L226 Difference]: Without dead ends: 27 [2018-10-02 11:48:57,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:57,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-02 11:48:57,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-02 11:48:57,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-02 11:48:57,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-10-02 11:48:57,969 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 17 [2018-10-02 11:48:57,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:57,970 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-10-02 11:48:57,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:57,970 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-10-02 11:48:57,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-02 11:48:57,971 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:57,971 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:57,972 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:57,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:57,972 INFO L82 PathProgramCache]: Analyzing trace with hash 2107312679, now seen corresponding path program 1 times [2018-10-02 11:48:57,972 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:57,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:57,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:57,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:57,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:58,074 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-02 11:48:58,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:58,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:48:58,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:58,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:58,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:58,076 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 3 states. [2018-10-02 11:48:58,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:58,340 INFO L93 Difference]: Finished difference Result 57 states and 81 transitions. [2018-10-02 11:48:58,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:58,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-02 11:48:58,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:58,343 INFO L225 Difference]: With dead ends: 57 [2018-10-02 11:48:58,343 INFO L226 Difference]: Without dead ends: 33 [2018-10-02 11:48:58,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:58,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-02 11:48:58,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-02 11:48:58,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-02 11:48:58,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2018-10-02 11:48:58,358 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 22 [2018-10-02 11:48:58,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:58,359 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2018-10-02 11:48:58,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:58,359 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2018-10-02 11:48:58,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-02 11:48:58,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:58,363 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:58,364 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:58,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:58,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1908478443, now seen corresponding path program 1 times [2018-10-02 11:48:58,365 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:58,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:58,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:58,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:58,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:58,501 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-02 11:48:58,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:58,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:48:58,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:58,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:58,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:58,503 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand 3 states. [2018-10-02 11:48:58,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:58,706 INFO L93 Difference]: Finished difference Result 70 states and 95 transitions. [2018-10-02 11:48:58,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:58,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-02 11:48:58,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:58,707 INFO L225 Difference]: With dead ends: 70 [2018-10-02 11:48:58,708 INFO L226 Difference]: Without dead ends: 40 [2018-10-02 11:48:58,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:58,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-02 11:48:58,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-02 11:48:58,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-02 11:48:58,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2018-10-02 11:48:58,716 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 28 [2018-10-02 11:48:58,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:58,717 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2018-10-02 11:48:58,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:58,717 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2018-10-02 11:48:58,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-02 11:48:58,719 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:58,719 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:58,719 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:58,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:58,720 INFO L82 PathProgramCache]: Analyzing trace with hash 685039927, now seen corresponding path program 1 times [2018-10-02 11:48:58,720 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:58,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:58,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:58,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:58,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:58,836 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-02 11:48:58,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:58,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:48:58,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:58,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:58,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:58,838 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand 3 states. [2018-10-02 11:48:58,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:58,899 INFO L93 Difference]: Finished difference Result 59 states and 79 transitions. [2018-10-02 11:48:58,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:58,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-10-02 11:48:58,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:58,902 INFO L225 Difference]: With dead ends: 59 [2018-10-02 11:48:58,903 INFO L226 Difference]: Without dead ends: 57 [2018-10-02 11:48:58,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:58,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-02 11:48:58,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-10-02 11:48:58,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-02 11:48:58,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 73 transitions. [2018-10-02 11:48:58,915 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 73 transitions. Word has length 35 [2018-10-02 11:48:58,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:58,915 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 73 transitions. [2018-10-02 11:48:58,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:58,915 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 73 transitions. [2018-10-02 11:48:58,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-02 11:48:58,917 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:58,917 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:58,917 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:58,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:58,918 INFO L82 PathProgramCache]: Analyzing trace with hash -82130889, now seen corresponding path program 1 times [2018-10-02 11:48:58,918 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:58,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:58,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:58,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:58,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:59,011 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-02 11:48:59,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:59,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:48:59,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:59,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:59,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:59,014 INFO L87 Difference]: Start difference. First operand 53 states and 73 transitions. Second operand 3 states. [2018-10-02 11:48:59,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:59,137 INFO L93 Difference]: Finished difference Result 111 states and 157 transitions. [2018-10-02 11:48:59,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:59,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-02 11:48:59,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:59,140 INFO L225 Difference]: With dead ends: 111 [2018-10-02 11:48:59,141 INFO L226 Difference]: Without dead ends: 61 [2018-10-02 11:48:59,141 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:59,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-02 11:48:59,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-10-02 11:48:59,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-02 11:48:59,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2018-10-02 11:48:59,152 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 44 [2018-10-02 11:48:59,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:59,152 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2018-10-02 11:48:59,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:59,152 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2018-10-02 11:48:59,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-02 11:48:59,154 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:59,154 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:59,154 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:59,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:59,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1942977721, now seen corresponding path program 1 times [2018-10-02 11:48:59,155 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:59,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:59,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:59,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:59,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:59,227 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-10-02 11:48:59,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:59,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:48:59,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:59,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:59,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:59,229 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand 3 states. [2018-10-02 11:48:59,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:48:59,645 INFO L93 Difference]: Finished difference Result 143 states and 203 transitions. [2018-10-02 11:48:59,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:48:59,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-10-02 11:48:59,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:48:59,647 INFO L225 Difference]: With dead ends: 143 [2018-10-02 11:48:59,647 INFO L226 Difference]: Without dead ends: 85 [2018-10-02 11:48:59,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:59,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-02 11:48:59,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-10-02 11:48:59,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-02 11:48:59,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2018-10-02 11:48:59,661 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 53 [2018-10-02 11:48:59,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:48:59,662 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2018-10-02 11:48:59,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:48:59,662 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2018-10-02 11:48:59,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-02 11:48:59,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:48:59,664 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:48:59,665 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:48:59,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:48:59,665 INFO L82 PathProgramCache]: Analyzing trace with hash 138737266, now seen corresponding path program 1 times [2018-10-02 11:48:59,665 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:48:59,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:48:59,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:59,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:48:59,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:48:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:48:59,802 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-10-02 11:48:59,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:48:59,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:48:59,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:48:59,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:48:59,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:48:59,804 INFO L87 Difference]: Start difference. First operand 85 states and 111 transitions. Second operand 3 states. [2018-10-02 11:49:00,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:00,216 INFO L93 Difference]: Finished difference Result 177 states and 231 transitions. [2018-10-02 11:49:00,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:00,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-10-02 11:49:00,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:00,218 INFO L225 Difference]: With dead ends: 177 [2018-10-02 11:49:00,218 INFO L226 Difference]: Without dead ends: 95 [2018-10-02 11:49:00,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:00,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-02 11:49:00,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-10-02 11:49:00,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-02 11:49:00,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 121 transitions. [2018-10-02 11:49:00,232 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 121 transitions. Word has length 65 [2018-10-02 11:49:00,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:00,233 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 121 transitions. [2018-10-02 11:49:00,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:00,233 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2018-10-02 11:49:00,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-02 11:49:00,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:00,235 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 6, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:00,235 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:00,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:00,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1273491131, now seen corresponding path program 1 times [2018-10-02 11:49:00,236 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:00,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:00,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:00,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:00,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:00,344 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-10-02 11:49:00,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:00,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:00,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:00,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:00,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:00,347 INFO L87 Difference]: Start difference. First operand 95 states and 121 transitions. Second operand 3 states. [2018-10-02 11:49:00,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:00,615 INFO L93 Difference]: Finished difference Result 209 states and 267 transitions. [2018-10-02 11:49:00,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:00,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-10-02 11:49:00,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:00,617 INFO L225 Difference]: With dead ends: 209 [2018-10-02 11:49:00,617 INFO L226 Difference]: Without dead ends: 117 [2018-10-02 11:49:00,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:00,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-02 11:49:00,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-10-02 11:49:00,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-02 11:49:00,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2018-10-02 11:49:00,636 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 75 [2018-10-02 11:49:00,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:00,637 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2018-10-02 11:49:00,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:00,637 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2018-10-02 11:49:00,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-02 11:49:00,640 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:00,641 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:00,641 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:00,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:00,641 INFO L82 PathProgramCache]: Analyzing trace with hash 739368033, now seen corresponding path program 1 times [2018-10-02 11:49:00,642 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:00,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:00,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:00,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:00,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:00,745 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-10-02 11:49:00,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:00,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:00,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:00,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:00,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:00,747 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 3 states. [2018-10-02 11:49:01,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:01,004 INFO L93 Difference]: Finished difference Result 255 states and 327 transitions. [2018-10-02 11:49:01,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:01,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-10-02 11:49:01,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:01,006 INFO L225 Difference]: With dead ends: 255 [2018-10-02 11:49:01,006 INFO L226 Difference]: Without dead ends: 141 [2018-10-02 11:49:01,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:01,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-02 11:49:01,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-10-02 11:49:01,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-02 11:49:01,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 167 transitions. [2018-10-02 11:49:01,023 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 167 transitions. Word has length 86 [2018-10-02 11:49:01,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:01,023 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 167 transitions. [2018-10-02 11:49:01,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:01,024 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 167 transitions. [2018-10-02 11:49:01,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-02 11:49:01,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:01,026 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 8, 7, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:01,026 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:01,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:01,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1128890468, now seen corresponding path program 1 times [2018-10-02 11:49:01,027 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:01,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:01,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:01,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:01,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:01,219 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 139 proven. 8 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-10-02 11:49:01,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:49:01,220 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:49:01,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:01,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:49:01,383 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 139 proven. 8 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-10-02 11:49:01,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:49:01,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-02 11:49:01,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 11:49:01,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 11:49:01,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:49:01,425 INFO L87 Difference]: Start difference. First operand 141 states and 167 transitions. Second operand 4 states. [2018-10-02 11:49:02,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:02,066 INFO L93 Difference]: Finished difference Result 387 states and 465 transitions. [2018-10-02 11:49:02,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 11:49:02,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-10-02 11:49:02,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:02,067 INFO L225 Difference]: With dead ends: 387 [2018-10-02 11:49:02,068 INFO L226 Difference]: Without dead ends: 0 [2018-10-02 11:49:02,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:49:02,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-02 11:49:02,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-02 11:49:02,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-02 11:49:02,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-02 11:49:02,070 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2018-10-02 11:49:02,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:02,070 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-02 11:49:02,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 11:49:02,070 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-02 11:49:02,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-02 11:49:02,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-02 11:49:02,533 WARN L178 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-10-02 11:49:02,922 WARN L178 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-10-02 11:49:03,271 WARN L178 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-10-02 11:49:03,551 WARN L178 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-10-02 11:49:03,862 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-10-02 11:49:03,994 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-10-02 11:49:04,088 INFO L421 ceAbstractionStarter]: At program point L353(lines 353 368) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-10-02 11:49:04,088 INFO L421 ceAbstractionStarter]: At program point L420(lines 417 434) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-10-02 11:49:04,089 INFO L421 ceAbstractionStarter]: At program point L383(lines 383 410) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-10-02 11:49:04,089 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 486) no Hoare annotation was computed. [2018-10-02 11:49:04,089 INFO L421 ceAbstractionStarter]: At program point L317(lines 317 332) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-10-02 11:49:04,089 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 486) no Hoare annotation was computed. [2018-10-02 11:49:04,089 INFO L421 ceAbstractionStarter]: At program point L379(lines 379 390) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) [2018-10-02 11:49:04,090 INFO L421 ceAbstractionStarter]: At program point L371(lines 371 380) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-10-02 11:49:04,090 INFO L421 ceAbstractionStarter]: At program point L264(lines 264 288) the Hoare annotation is: (or (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-10-02 11:49:04,090 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 486) no Hoare annotation was computed. [2018-10-02 11:49:04,090 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 419) no Hoare annotation was computed. [2018-10-02 11:49:04,091 INFO L421 ceAbstractionStarter]: At program point L335(lines 335 350) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-10-02 11:49:04,091 INFO L421 ceAbstractionStarter]: At program point L459(lines 459 476) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-10-02 11:49:04,091 INFO L421 ceAbstractionStarter]: At program point L298(lines 259 298) the Hoare annotation is: (or (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-10-02 11:49:04,091 INFO L421 ceAbstractionStarter]: At program point L294(lines 294 314) the Hoare annotation is: (or (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-10-02 11:49:04,091 INFO L421 ceAbstractionStarter]: At program point L389(lines 389 418) the Hoare annotation is: false [2018-10-02 11:49:04,092 INFO L421 ceAbstractionStarter]: At program point L439(lines 439 456) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-10-02 11:49:04,092 INFO L421 ceAbstractionStarter]: At program point L485(lines 287 485) the Hoare annotation is: (or (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-10-02 11:49:04,106 INFO L202 PluginConnector]: Adding new model s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:49:04 BoogieIcfgContainer [2018-10-02 11:49:04,106 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 11:49:04,107 INFO L168 Benchmark]: Toolchain (without parser) took 8257.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 404.4 MB). Peak memory consumption was 404.4 MB. Max. memory is 7.1 GB. [2018-10-02 11:49:04,108 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:49:04,109 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:49:04,109 INFO L168 Benchmark]: Boogie Preprocessor took 65.94 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:49:04,110 INFO L168 Benchmark]: RCFGBuilder took 736.19 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-02 11:49:04,111 INFO L168 Benchmark]: TraceAbstraction took 7391.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 362.1 MB). Peak memory consumption was 362.1 MB. Max. memory is 7.1 GB. [2018-10-02 11:49:04,115 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 56.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 65.94 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 736.19 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7391.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 362.1 MB). Peak memory consumption was 362.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 419]: 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: 417]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 294]: Loop Invariant Derived loop invariant: ((ssl3_connect_~s__state~4 == 4368 || ssl3_connect_~blastFlag~4 <= 4) || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 439]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: ((ssl3_connect_~s__state~4 == 4368 || ssl3_connect_~blastFlag~4 <= 4) || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 459]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 383]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: ((ssl3_connect_~s__state~4 == 4368 || ssl3_connect_~blastFlag~4 <= 4) || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432 - InvariantResult [Line: 287]: Loop Invariant Derived loop invariant: ((ssl3_connect_~s__state~4 == 4368 || ssl3_connect_~blastFlag~4 <= 4) || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 389]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4 && ssl3_connect_~s__state~4 <= 4352)) || 4480 <= ssl3_connect_~s__state~4 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. SAFE Result, 7.3s OverallTime, 12 OverallIterations, 12 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 2.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 318 SDtfs, 36 SDslu, 67 SDs, 0 SdLazy, 361 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=11, 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.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 262 NumberOfFragments, 188 HoareAnnotationTreeSize, 14 FomulaSimplifications, 1789 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 14 FomulaSimplificationsInter, 84 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 644 NumberOfCodeBlocks, 644 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 631 ConstructedInterpolants, 0 QuantifiedInterpolants, 58057 SizeOfPredicates, 2 NumberOfNonLiveVariables, 506 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 1854/1870 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_1.cil.c_16.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_11-49-04-130.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_1.cil.c_16.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_11-49-04-130.csv Received shutdown request...