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_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:47:21,610 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:47:21,612 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:47:21,624 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:47:21,625 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:47:21,626 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:47:21,627 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:47:21,628 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:47:21,630 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:47:21,631 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:47:21,632 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:47:21,632 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:47:21,633 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:47:21,636 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:47:21,637 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:47:21,638 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:47:21,638 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:47:21,643 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:47:21,652 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:47:21,654 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:47:21,655 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:47:21,656 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:47:21,658 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:47:21,659 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:47:21,659 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:47:21,660 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:47:21,661 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:47:21,661 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:47:21,662 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:47:21,663 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:47:21,663 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:47:21,664 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:47:21,664 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:47:21,664 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:47:21,665 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:47:21,666 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:47:21,666 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 09:47:21,681 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:47:21,681 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:47:21,682 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:47:21,682 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:47:21,684 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:47:21,684 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:47:21,685 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:47:21,685 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:47:21,685 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:47:21,685 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:47:21,686 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:47:21,686 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:47:21,686 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:47:21,686 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:47:21,686 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:47:21,687 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:47:21,687 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:47:21,688 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:47:21,688 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:47:21,688 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:47:21,688 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:47:21,688 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:47:21,689 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:47:21,689 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:47:21,689 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:47:21,689 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:47:21,690 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:47:21,690 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:47:21,690 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:47:21,690 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:47:21,690 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 09:47:21,742 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:47:21,754 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:47:21,758 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:47:21,760 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:47:21,760 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:47:21,761 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl [2018-10-04 09:47:21,761 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl' [2018-10-04 09:47:21,854 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:47:21,856 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:47:21,856 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:47:21,857 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:47:21,859 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:47:21,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:21" (1/1) ... [2018-10-04 09:47:21,893 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:21" (1/1) ... [2018-10-04 09:47:21,900 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:47:21,901 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:47:21,901 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:47:21,901 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:47:21,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:21" (1/1) ... [2018-10-04 09:47:21,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:21" (1/1) ... [2018-10-04 09:47:21,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:21" (1/1) ... [2018-10-04 09:47:21,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:21" (1/1) ... [2018-10-04 09:47:21,938 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:21" (1/1) ... [2018-10-04 09:47:21,941 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:21" (1/1) ... [2018-10-04 09:47:21,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:21" (1/1) ... [2018-10-04 09:47:21,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:47:21,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:47:21,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:47:21,959 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:47:21,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:21" (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-04 09:47:22,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:47:22,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:47:22,624 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:47:22,625 INFO L202 PluginConnector]: Adding new model s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:47:22 BoogieIcfgContainer [2018-10-04 09:47:22,625 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:47:22,626 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:47:22,626 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:47:22,629 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:47:22,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:21" (1/2) ... [2018-10-04 09:47:22,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5bd9b3 and model type s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:47:22, skipping insertion in model container [2018-10-04 09:47:22,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:47:22" (2/2) ... [2018-10-04 09:47:22,633 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil.c_19.bpl [2018-10-04 09:47:22,642 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:47:22,653 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:47:22,698 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:47:22,699 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:47:22,699 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:47:22,700 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:47:22,700 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:47:22,700 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:47:22,700 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:47:22,700 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:47:22,700 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:47:22,715 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-10-04 09:47:22,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 09:47:22,721 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:22,722 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:22,723 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:22,730 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:22,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1918382949, now seen corresponding path program 1 times [2018-10-04 09:47:22,733 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:22,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:22,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:22,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:22,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:22,931 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-04 09:47:22,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:22,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:47:22,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:22,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:22,950 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:22,952 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-10-04 09:47:23,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:23,130 INFO L93 Difference]: Finished difference Result 37 states and 62 transitions. [2018-10-04 09:47:23,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:23,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-04 09:47:23,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:23,146 INFO L225 Difference]: With dead ends: 37 [2018-10-04 09:47:23,146 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 09:47:23,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:23,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 09:47:23,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-04 09:47:23,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 09:47:23,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2018-10-04 09:47:23,184 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 31 transitions. Word has length 10 [2018-10-04 09:47:23,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:23,184 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 31 transitions. [2018-10-04 09:47:23,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:23,185 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 31 transitions. [2018-10-04 09:47:23,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:47:23,186 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:23,186 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:23,186 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:23,186 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:23,187 INFO L82 PathProgramCache]: Analyzing trace with hash -688967491, now seen corresponding path program 1 times [2018-10-04 09:47:23,187 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:23,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:23,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:23,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:23,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:23,278 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-04 09:47:23,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:23,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:23,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:23,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:23,281 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:23,281 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. Second operand 3 states. [2018-10-04 09:47:23,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:23,514 INFO L93 Difference]: Finished difference Result 41 states and 65 transitions. [2018-10-04 09:47:23,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:23,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-10-04 09:47:23,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:23,516 INFO L225 Difference]: With dead ends: 41 [2018-10-04 09:47:23,516 INFO L226 Difference]: Without dead ends: 24 [2018-10-04 09:47:23,517 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:23,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-04 09:47:23,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-04 09:47:23,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:47:23,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2018-10-04 09:47:23,527 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 13 [2018-10-04 09:47:23,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:23,527 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2018-10-04 09:47:23,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:23,528 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2018-10-04 09:47:23,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:47:23,528 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:23,529 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:23,529 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:23,529 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:23,530 INFO L82 PathProgramCache]: Analyzing trace with hash 485156347, now seen corresponding path program 1 times [2018-10-04 09:47:23,530 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:23,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:23,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:23,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:23,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:23,639 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-04 09:47:23,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:23,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:23,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:23,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:23,641 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:23,641 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 3 states. [2018-10-04 09:47:23,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:23,793 INFO L93 Difference]: Finished difference Result 50 states and 75 transitions. [2018-10-04 09:47:23,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:23,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-04 09:47:23,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:23,796 INFO L225 Difference]: With dead ends: 50 [2018-10-04 09:47:23,797 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 09:47:23,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:23,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 09:47:23,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-04 09:47:23,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 09:47:23,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2018-10-04 09:47:23,804 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 17 [2018-10-04 09:47:23,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:23,804 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2018-10-04 09:47:23,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:23,805 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2018-10-04 09:47:23,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 09:47:23,806 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:23,806 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:23,807 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:23,807 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:23,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1400979255, now seen corresponding path program 1 times [2018-10-04 09:47:23,807 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:23,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:23,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:23,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:23,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:23,922 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-04 09:47:23,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:23,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:23,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:23,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:23,923 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:23,924 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 3 states. [2018-10-04 09:47:24,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:24,053 INFO L93 Difference]: Finished difference Result 74 states and 108 transitions. [2018-10-04 09:47:24,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:24,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-04 09:47:24,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:24,056 INFO L225 Difference]: With dead ends: 74 [2018-10-04 09:47:24,057 INFO L226 Difference]: Without dead ends: 48 [2018-10-04 09:47:24,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:24,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-04 09:47:24,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-10-04 09:47:24,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-04 09:47:24,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2018-10-04 09:47:24,073 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 24 [2018-10-04 09:47:24,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:24,073 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2018-10-04 09:47:24,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:24,074 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2018-10-04 09:47:24,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 09:47:24,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:24,076 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:24,076 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:24,077 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:24,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1854060543, now seen corresponding path program 1 times [2018-10-04 09:47:24,077 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:24,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:24,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:24,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:24,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:24,227 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-04 09:47:24,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:24,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:24,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:24,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:24,230 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:24,230 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand 3 states. [2018-10-04 09:47:24,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:24,455 INFO L93 Difference]: Finished difference Result 92 states and 137 transitions. [2018-10-04 09:47:24,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:24,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-04 09:47:24,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:24,460 INFO L225 Difference]: With dead ends: 92 [2018-10-04 09:47:24,461 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 09:47:24,461 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:24,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 09:47:24,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-10-04 09:47:24,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-04 09:47:24,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2018-10-04 09:47:24,472 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 30 [2018-10-04 09:47:24,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:24,472 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2018-10-04 09:47:24,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:24,473 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2018-10-04 09:47:24,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-04 09:47:24,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:24,474 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:24,474 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:24,474 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:24,475 INFO L82 PathProgramCache]: Analyzing trace with hash 122269039, now seen corresponding path program 1 times [2018-10-04 09:47:24,475 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:24,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:24,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:24,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:24,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:24,584 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-04 09:47:24,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:24,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:24,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:24,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:24,586 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:24,586 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand 3 states. [2018-10-04 09:47:24,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:24,692 INFO L93 Difference]: Finished difference Result 71 states and 102 transitions. [2018-10-04 09:47:24,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:24,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-10-04 09:47:24,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:24,696 INFO L225 Difference]: With dead ends: 71 [2018-10-04 09:47:24,696 INFO L226 Difference]: Without dead ends: 69 [2018-10-04 09:47:24,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:24,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-04 09:47:24,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2018-10-04 09:47:24,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-04 09:47:24,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 94 transitions. [2018-10-04 09:47:24,708 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 94 transitions. Word has length 37 [2018-10-04 09:47:24,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:24,709 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 94 transitions. [2018-10-04 09:47:24,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:24,709 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 94 transitions. [2018-10-04 09:47:24,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 09:47:24,711 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:24,711 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:24,711 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:24,711 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:24,712 INFO L82 PathProgramCache]: Analyzing trace with hash -827312127, now seen corresponding path program 1 times [2018-10-04 09:47:24,712 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:24,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:24,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:24,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:24,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:24,796 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-04 09:47:24,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:24,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:24,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:24,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:24,797 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:24,797 INFO L87 Difference]: Start difference. First operand 64 states and 94 transitions. Second operand 3 states. [2018-10-04 09:47:24,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:24,979 INFO L93 Difference]: Finished difference Result 161 states and 250 transitions. [2018-10-04 09:47:24,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:24,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-04 09:47:24,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:24,987 INFO L225 Difference]: With dead ends: 161 [2018-10-04 09:47:24,987 INFO L226 Difference]: Without dead ends: 100 [2018-10-04 09:47:24,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:24,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-04 09:47:25,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-10-04 09:47:25,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-04 09:47:25,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 145 transitions. [2018-10-04 09:47:25,003 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 145 transitions. Word has length 44 [2018-10-04 09:47:25,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:25,004 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 145 transitions. [2018-10-04 09:47:25,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:25,004 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 145 transitions. [2018-10-04 09:47:25,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-04 09:47:25,006 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:25,006 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:25,007 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:25,007 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:25,007 INFO L82 PathProgramCache]: Analyzing trace with hash -520844702, now seen corresponding path program 1 times [2018-10-04 09:47:25,007 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:25,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:25,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:25,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:25,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:25,108 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-04 09:47:25,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:25,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:25,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:25,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:25,110 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:25,110 INFO L87 Difference]: Start difference. First operand 100 states and 145 transitions. Second operand 3 states. [2018-10-04 09:47:25,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:25,408 INFO L93 Difference]: Finished difference Result 205 states and 297 transitions. [2018-10-04 09:47:25,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:25,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-10-04 09:47:25,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:25,411 INFO L225 Difference]: With dead ends: 205 [2018-10-04 09:47:25,412 INFO L226 Difference]: Without dead ends: 108 [2018-10-04 09:47:25,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:25,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-04 09:47:25,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-10-04 09:47:25,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-04 09:47:25,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2018-10-04 09:47:25,439 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 56 [2018-10-04 09:47:25,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:25,440 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2018-10-04 09:47:25,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:25,440 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2018-10-04 09:47:25,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-04 09:47:25,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:25,443 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:25,447 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:25,447 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:25,448 INFO L82 PathProgramCache]: Analyzing trace with hash 743728902, now seen corresponding path program 1 times [2018-10-04 09:47:25,448 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:25,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:25,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:25,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:25,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:25,588 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-04 09:47:25,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:25,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:25,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:25,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:25,589 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:25,590 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand 3 states. [2018-10-04 09:47:25,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:25,729 INFO L93 Difference]: Finished difference Result 240 states and 339 transitions. [2018-10-04 09:47:25,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:25,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-10-04 09:47:25,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:25,731 INFO L225 Difference]: With dead ends: 240 [2018-10-04 09:47:25,731 INFO L226 Difference]: Without dead ends: 135 [2018-10-04 09:47:25,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:25,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-04 09:47:25,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-10-04 09:47:25,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-04 09:47:25,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 180 transitions. [2018-10-04 09:47:25,761 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 180 transitions. Word has length 65 [2018-10-04 09:47:25,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:25,762 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 180 transitions. [2018-10-04 09:47:25,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:25,762 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 180 transitions. [2018-10-04 09:47:25,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-04 09:47:25,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:25,764 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 6, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:25,765 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:25,765 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:25,765 INFO L82 PathProgramCache]: Analyzing trace with hash 77382112, now seen corresponding path program 1 times [2018-10-04 09:47:25,765 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:25,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:25,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:25,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:25,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:25,895 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-04 09:47:25,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:25,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:25,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:25,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:25,898 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:25,898 INFO L87 Difference]: Start difference. First operand 135 states and 180 transitions. Second operand 3 states. [2018-10-04 09:47:26,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:26,205 INFO L93 Difference]: Finished difference Result 297 states and 399 transitions. [2018-10-04 09:47:26,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:26,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-10-04 09:47:26,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:26,210 INFO L225 Difference]: With dead ends: 297 [2018-10-04 09:47:26,210 INFO L226 Difference]: Without dead ends: 165 [2018-10-04 09:47:26,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:26,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-04 09:47:26,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-10-04 09:47:26,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-04 09:47:26,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 210 transitions. [2018-10-04 09:47:26,228 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 210 transitions. Word has length 74 [2018-10-04 09:47:26,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:26,228 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 210 transitions. [2018-10-04 09:47:26,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:26,229 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 210 transitions. [2018-10-04 09:47:26,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-04 09:47:26,230 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:26,230 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 7, 6, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:26,230 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:26,231 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:26,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1320054553, now seen corresponding path program 1 times [2018-10-04 09:47:26,231 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:26,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:26,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:26,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:26,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:26,349 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-10-04 09:47:26,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:26,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:26,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:26,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:26,350 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:26,350 INFO L87 Difference]: Start difference. First operand 165 states and 210 transitions. Second operand 3 states. [2018-10-04 09:47:26,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:26,547 INFO L93 Difference]: Finished difference Result 360 states and 465 transitions. [2018-10-04 09:47:26,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:26,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-10-04 09:47:26,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:26,550 INFO L225 Difference]: With dead ends: 360 [2018-10-04 09:47:26,550 INFO L226 Difference]: Without dead ends: 198 [2018-10-04 09:47:26,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:26,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-04 09:47:26,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-10-04 09:47:26,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-10-04 09:47:26,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 243 transitions. [2018-10-04 09:47:26,568 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 243 transitions. Word has length 84 [2018-10-04 09:47:26,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:26,568 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 243 transitions. [2018-10-04 09:47:26,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:26,568 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 243 transitions. [2018-10-04 09:47:26,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-04 09:47:26,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:26,570 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 8, 7, 6, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:26,570 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:26,571 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:26,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1153559737, now seen corresponding path program 1 times [2018-10-04 09:47:26,571 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:26,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:26,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:26,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:26,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:26,697 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-10-04 09:47:26,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:26,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:26,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:26,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:26,699 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:26,699 INFO L87 Difference]: Start difference. First operand 198 states and 243 transitions. Second operand 3 states. [2018-10-04 09:47:27,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:27,013 INFO L93 Difference]: Finished difference Result 429 states and 548 transitions. [2018-10-04 09:47:27,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:27,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2018-10-04 09:47:27,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:27,015 INFO L225 Difference]: With dead ends: 429 [2018-10-04 09:47:27,015 INFO L226 Difference]: Without dead ends: 234 [2018-10-04 09:47:27,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:27,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-04 09:47:27,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-10-04 09:47:27,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-10-04 09:47:27,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 279 transitions. [2018-10-04 09:47:27,035 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 279 transitions. Word has length 95 [2018-10-04 09:47:27,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:27,036 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 279 transitions. [2018-10-04 09:47:27,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:27,036 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 279 transitions. [2018-10-04 09:47:27,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-04 09:47:27,037 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:27,037 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 9, 8, 7, 5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:27,038 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:27,038 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:27,038 INFO L82 PathProgramCache]: Analyzing trace with hash -580341928, now seen corresponding path program 1 times [2018-10-04 09:47:27,038 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:27,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:27,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:27,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:27,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:27,256 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 200 proven. 5 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-10-04 09:47:27,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:47:27,257 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-04 09:47:27,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:27,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:47:27,862 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 200 proven. 5 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-10-04 09:47:27,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:47:27,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 09:47:27,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:47:27,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:47:27,893 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:27,893 INFO L87 Difference]: Start difference. First operand 234 states and 279 transitions. Second operand 4 states. [2018-10-04 09:47:28,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:28,468 INFO L93 Difference]: Finished difference Result 530 states and 632 transitions. [2018-10-04 09:47:28,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:47:28,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-10-04 09:47:28,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:28,469 INFO L225 Difference]: With dead ends: 530 [2018-10-04 09:47:28,469 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 09:47:28,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.0s impTime 3 [2018-10-04 09:47:28,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 09:47:28,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 09:47:28,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 09:47:28,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 09:47:28,471 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 107 [2018-10-04 09:47:28,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:28,472 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 09:47:28,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:47:28,472 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 09:47:28,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 09:47:28,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 09:47:29,221 WARN L178 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-10-04 09:47:29,456 WARN L178 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-10-04 09:47:29,903 WARN L178 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-10-04 09:47:30,154 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-10-04 09:47:30,312 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-10-04 09:47:31,211 WARN L178 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2018-10-04 09:47:31,575 WARN L178 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-10-04 09:47:31,578 INFO L421 ceAbstractionStarter]: At program point L440(lines 440 455) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-04 09:47:31,578 INFO L421 ceAbstractionStarter]: At program point L366(lines 366 391) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-04 09:47:31,578 INFO L421 ceAbstractionStarter]: At program point L300(lines 300 326) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-04 09:47:31,578 INFO L421 ceAbstractionStarter]: At program point L362(lines 362 373) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4) (= ULTIMATE.start_ssl3_connect_~s__state~3 4432)) [2018-10-04 09:47:31,578 INFO L421 ceAbstractionStarter]: At program point L329(lines 329 351) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-04 09:47:31,578 INFO L421 ceAbstractionStarter]: At program point L296(lines 296 307) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4384) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2)) [2018-10-04 09:47:31,578 INFO L421 ceAbstractionStarter]: At program point L420(lines 420 437) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-04 09:47:31,579 INFO L421 ceAbstractionStarter]: At program point L354(lines 354 363) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-04 09:47:31,579 INFO L421 ceAbstractionStarter]: At program point L288(lines 288 297) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-04 09:47:31,579 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 2 464) no Hoare annotation was computed. [2018-10-04 09:47:31,579 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 2 464) no Hoare annotation was computed. [2018-10-04 09:47:31,579 INFO L421 ceAbstractionStarter]: At program point L239(lines 239 258) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-04 09:47:31,579 INFO L421 ceAbstractionStarter]: At program point L268(lines 234 268) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-04 09:47:31,579 INFO L421 ceAbstractionStarter]: At program point L264(lines 264 285) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-04 09:47:31,579 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 2 464) no Hoare annotation was computed. [2018-10-04 09:47:31,579 INFO L421 ceAbstractionStarter]: At program point L372(lines 372 399) the Hoare annotation is: false [2018-10-04 09:47:31,580 INFO L421 ceAbstractionStarter]: At program point L401(lines 398 415) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-04 09:47:31,580 INFO L421 ceAbstractionStarter]: At program point L463(lines 257 463) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 4))) (or (and .cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~3) (<= ULTIMATE.start_ssl3_connect_~s__state~3 4352)) (= ULTIMATE.start_ssl3_connect_~s__state~3 4368) (and .cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~3)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~3 4416)) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2))) [2018-10-04 09:47:31,580 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 400) no Hoare annotation was computed. [2018-10-04 09:47:31,580 INFO L421 ceAbstractionStarter]: At program point L311(lines 306 330) the Hoare annotation is: (and (= ULTIMATE.start_ssl3_connect_~s__state~3 4384) (<= ULTIMATE.start_ssl3_connect_~blastFlag~3 2)) [2018-10-04 09:47:31,594 INFO L202 PluginConnector]: Adding new model s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:47:31 BoogieIcfgContainer [2018-10-04 09:47:31,594 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:47:31,595 INFO L168 Benchmark]: Toolchain (without parser) took 9740.60 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 30.4 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -18.0 MB). Peak memory consumption was 490.3 MB. Max. memory is 7.1 GB. [2018-10-04 09:47:31,599 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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-04 09:47:31,600 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.27 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-04 09:47:31,600 INFO L168 Benchmark]: Boogie Preprocessor took 57.30 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-04 09:47:31,604 INFO L168 Benchmark]: RCFGBuilder took 666.17 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 09:47:31,605 INFO L168 Benchmark]: TraceAbstraction took 8968.45 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 30.4 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -49.7 MB). Peak memory consumption was 458.6 MB. Max. memory is 7.1 GB. [2018-10-04 09:47:31,619 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.21 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 44.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.30 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 666.17 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8968.45 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 30.4 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -49.7 MB). Peak memory consumption was 458.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 400]: 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: 239]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || ssl3_connect_~s__state~3 == 4368) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 420]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 366]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 440]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 306]: Loop Invariant Derived loop invariant: ssl3_connect_~s__state~3 == 4384 && ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || ssl3_connect_~s__state~3 == 4368) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: ssl3_connect_~s__state~3 == 4384 && ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 362]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4432 - InvariantResult [Line: 372]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 234]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || ssl3_connect_~s__state~3 == 4368) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 300]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || ssl3_connect_~blastFlag~3 <= 2 - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~blastFlag~3 <= 4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~3) && ssl3_connect_~s__state~3 <= 4352) || ssl3_connect_~s__state~3 == 4368) || (ssl3_connect_~blastFlag~3 <= 4 && 4432 <= ssl3_connect_~s__state~3)) || (ssl3_connect_~blastFlag~3 <= 4 && ssl3_connect_~s__state~3 == 4416)) || ssl3_connect_~blastFlag~3 <= 2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. SAFE Result, 8.8s OverallTime, 13 OverallIterations, 13 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 3.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 385 SDtfs, 66 SDslu, 111 SDs, 0 SdLazy, 384 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred 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.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 314 NumberOfFragments, 335 HoareAnnotationTreeSize, 16 FomulaSimplifications, 3068 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 16 FomulaSimplificationsInter, 177 FormulaSimplificationTreeSizeReductionInter, 2.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 763 NumberOfCodeBlocks, 763 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 749 ConstructedInterpolants, 0 QuantifiedInterpolants, 71345 SizeOfPredicates, 2 NumberOfNonLiveVariables, 518 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 2279/2289 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_3.BV.c.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-47-31-647.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_3.BV.c.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-47-31-647.csv Received shutdown request...