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_srvr_3_alt.BV.c.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 12:16:44,782 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 12:16:44,784 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 12:16:44,796 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 12:16:44,797 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 12:16:44,798 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 12:16:44,799 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 12:16:44,801 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 12:16:44,804 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 12:16:44,805 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 12:16:44,806 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 12:16:44,806 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 12:16:44,810 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 12:16:44,811 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 12:16:44,812 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 12:16:44,815 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 12:16:44,816 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 12:16:44,818 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 12:16:44,825 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 12:16:44,826 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 12:16:44,827 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 12:16:44,830 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 12:16:44,836 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 12:16:44,837 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 12:16:44,837 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 12:16:44,838 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 12:16:44,839 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 12:16:44,839 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 12:16:44,840 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 12:16:44,841 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 12:16:44,841 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 12:16:44,842 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 12:16:44,842 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 12:16:44,842 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 12:16:44,843 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 12:16:44,844 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 12:16:44,844 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-02 12:16:44,863 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 12:16:44,863 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 12:16:44,866 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 12:16:44,866 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 12:16:44,866 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 12:16:44,867 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 12:16:44,867 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 12:16:44,867 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 12:16:44,867 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 12:16:44,867 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 12:16:44,868 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 12:16:44,868 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 12:16:44,868 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 12:16:44,868 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 12:16:44,868 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 12:16:44,869 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 12:16:44,869 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 12:16:44,869 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 12:16:44,869 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 12:16:44,871 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 12:16:44,871 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 12:16:44,871 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 12:16:44,871 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:16:44,871 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 12:16:44,872 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 12:16:44,872 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 12:16:44,872 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 12:16:44,872 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 12:16:44,873 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 12:16:44,873 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 12:16:44,873 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-02 12:16:44,942 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 12:16:44,957 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 12:16:44,966 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 12:16:44,967 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 12:16:44,968 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 12:16:44,969 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3_alt.BV.c.cil.c_19.bpl [2018-10-02 12:16:44,969 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3_alt.BV.c.cil.c_19.bpl' [2018-10-02 12:16:45,075 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 12:16:45,081 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 12:16:45,082 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 12:16:45,082 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 12:16:45,082 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 12:16:45,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:45" (1/1) ... [2018-10-02 12:16:45,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:45" (1/1) ... [2018-10-02 12:16:45,140 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 12:16:45,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 12:16:45,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 12:16:45,142 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 12:16:45,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:45" (1/1) ... [2018-10-02 12:16:45,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:45" (1/1) ... [2018-10-02 12:16:45,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:45" (1/1) ... [2018-10-02 12:16:45,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:45" (1/1) ... [2018-10-02 12:16:45,187 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:45" (1/1) ... [2018-10-02 12:16:45,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:45" (1/1) ... [2018-10-02 12:16:45,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:45" (1/1) ... [2018-10-02 12:16:45,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 12:16:45,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 12:16:45,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 12:16:45,205 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 12:16:45,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:45" (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 12:16:45,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 12:16:45,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 12:16:45,992 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 12:16:45,992 INFO L202 PluginConnector]: Adding new model s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:16:45 BoogieIcfgContainer [2018-10-02 12:16:45,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 12:16:45,994 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 12:16:45,994 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 12:16:45,997 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 12:16:45,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:16:45" (1/2) ... [2018-10-02 12:16:45,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18918696 and model type s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:16:45, skipping insertion in model container [2018-10-02 12:16:45,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:16:45" (2/2) ... [2018-10-02 12:16:46,001 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3_alt.BV.c.cil.c_19.bpl [2018-10-02 12:16:46,011 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 12:16:46,021 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 12:16:46,070 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 12:16:46,071 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 12:16:46,071 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 12:16:46,071 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 12:16:46,071 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 12:16:46,071 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 12:16:46,072 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 12:16:46,072 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 12:16:46,072 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 12:16:46,090 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-10-02 12:16:46,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-02 12:16:46,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:46,102 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:46,103 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:46,111 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:46,112 INFO L82 PathProgramCache]: Analyzing trace with hash -505433715, now seen corresponding path program 1 times [2018-10-02 12:16:46,113 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:46,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:46,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:46,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:46,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:46,374 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 12:16:46,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:46,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:46,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:46,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:46,396 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:46,399 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-10-02 12:16:47,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:47,274 INFO L93 Difference]: Finished difference Result 56 states and 94 transitions. [2018-10-02 12:16:47,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:47,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-02 12:16:47,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:47,291 INFO L225 Difference]: With dead ends: 56 [2018-10-02 12:16:47,291 INFO L226 Difference]: Without dead ends: 34 [2018-10-02 12:16:47,294 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 [2018-10-02 12:16:47,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-02 12:16:47,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-02 12:16:47,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-02 12:16:47,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-10-02 12:16:47,333 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 15 [2018-10-02 12:16:47,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:47,334 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2018-10-02 12:16:47,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:47,334 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2018-10-02 12:16:47,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-02 12:16:47,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:47,336 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:47,336 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:47,337 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:47,337 INFO L82 PathProgramCache]: Analyzing trace with hash -912155261, now seen corresponding path program 1 times [2018-10-02 12:16:47,337 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:47,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:47,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:47,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:47,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:47,414 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:16:47,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:47,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:47,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:47,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:47,417 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:47,418 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2018-10-02 12:16:48,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:48,296 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-10-02 12:16:48,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:48,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-02 12:16:48,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:48,298 INFO L225 Difference]: With dead ends: 83 [2018-10-02 12:16:48,298 INFO L226 Difference]: Without dead ends: 50 [2018-10-02 12:16:48,299 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 [2018-10-02 12:16:48,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-02 12:16:48,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-10-02 12:16:48,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-02 12:16:48,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 83 transitions. [2018-10-02 12:16:48,323 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 83 transitions. Word has length 23 [2018-10-02 12:16:48,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:48,327 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 83 transitions. [2018-10-02 12:16:48,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:48,327 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 83 transitions. [2018-10-02 12:16:48,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-02 12:16:48,328 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:48,329 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:48,329 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:48,329 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:48,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1423527967, now seen corresponding path program 1 times [2018-10-02 12:16:48,331 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:48,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:48,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:48,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:48,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:48,451 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-02 12:16:48,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:48,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:48,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:48,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:48,452 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:48,452 INFO L87 Difference]: Start difference. First operand 50 states and 83 transitions. Second operand 3 states. [2018-10-02 12:16:48,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:48,833 INFO L93 Difference]: Finished difference Result 106 states and 177 transitions. [2018-10-02 12:16:48,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:48,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-02 12:16:48,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:48,835 INFO L225 Difference]: With dead ends: 106 [2018-10-02 12:16:48,835 INFO L226 Difference]: Without dead ends: 57 [2018-10-02 12:16:48,836 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 [2018-10-02 12:16:48,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-02 12:16:48,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-02 12:16:48,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-02 12:16:48,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 92 transitions. [2018-10-02 12:16:48,850 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 92 transitions. Word has length 30 [2018-10-02 12:16:48,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:48,850 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 92 transitions. [2018-10-02 12:16:48,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:48,851 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 92 transitions. [2018-10-02 12:16:48,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-02 12:16:48,852 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:48,852 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:48,852 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:48,853 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:48,853 INFO L82 PathProgramCache]: Analyzing trace with hash 222883079, now seen corresponding path program 1 times [2018-10-02 12:16:48,853 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:48,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:48,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:48,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:48,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:48,932 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:16:48,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:48,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:48,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:48,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:48,935 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:48,935 INFO L87 Difference]: Start difference. First operand 57 states and 92 transitions. Second operand 3 states. [2018-10-02 12:16:49,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:49,325 INFO L93 Difference]: Finished difference Result 131 states and 214 transitions. [2018-10-02 12:16:49,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:49,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-02 12:16:49,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:49,327 INFO L225 Difference]: With dead ends: 131 [2018-10-02 12:16:49,327 INFO L226 Difference]: Without dead ends: 74 [2018-10-02 12:16:49,327 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 [2018-10-02 12:16:49,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-02 12:16:49,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-10-02 12:16:49,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-02 12:16:49,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 120 transitions. [2018-10-02 12:16:49,343 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 120 transitions. Word has length 30 [2018-10-02 12:16:49,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:49,344 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 120 transitions. [2018-10-02 12:16:49,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:49,344 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 120 transitions. [2018-10-02 12:16:49,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-02 12:16:49,345 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:49,346 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:49,346 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:49,346 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:49,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1035189277, now seen corresponding path program 1 times [2018-10-02 12:16:49,347 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:49,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:49,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:49,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:49,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:49,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:49,398 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-02 12:16:49,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:49,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:49,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:49,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:49,399 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:49,400 INFO L87 Difference]: Start difference. First operand 74 states and 120 transitions. Second operand 3 states. [2018-10-02 12:16:49,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:49,580 INFO L93 Difference]: Finished difference Result 153 states and 249 transitions. [2018-10-02 12:16:49,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:49,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-02 12:16:49,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:49,583 INFO L225 Difference]: With dead ends: 153 [2018-10-02 12:16:49,583 INFO L226 Difference]: Without dead ends: 80 [2018-10-02 12:16:49,584 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 [2018-10-02 12:16:49,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-02 12:16:49,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-10-02 12:16:49,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-02 12:16:49,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 125 transitions. [2018-10-02 12:16:49,599 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 125 transitions. Word has length 36 [2018-10-02 12:16:49,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:49,599 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 125 transitions. [2018-10-02 12:16:49,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:49,600 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 125 transitions. [2018-10-02 12:16:49,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-02 12:16:49,601 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:49,602 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:49,602 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:49,602 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:49,602 INFO L82 PathProgramCache]: Analyzing trace with hash -720648959, now seen corresponding path program 1 times [2018-10-02 12:16:49,602 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:49,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:49,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:49,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:49,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:49,696 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-02 12:16:49,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:49,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:49,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:49,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:49,697 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:49,698 INFO L87 Difference]: Start difference. First operand 80 states and 125 transitions. Second operand 3 states. [2018-10-02 12:16:49,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:49,912 INFO L93 Difference]: Finished difference Result 164 states and 257 transitions. [2018-10-02 12:16:49,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:49,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-02 12:16:49,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:49,916 INFO L225 Difference]: With dead ends: 164 [2018-10-02 12:16:49,916 INFO L226 Difference]: Without dead ends: 85 [2018-10-02 12:16:49,917 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 [2018-10-02 12:16:49,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-02 12:16:49,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-10-02 12:16:49,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-02 12:16:49,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2018-10-02 12:16:49,932 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 41 [2018-10-02 12:16:49,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:49,932 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2018-10-02 12:16:49,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:49,932 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2018-10-02 12:16:49,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-02 12:16:49,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:49,934 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:49,934 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:49,935 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:49,935 INFO L82 PathProgramCache]: Analyzing trace with hash -2015268825, now seen corresponding path program 1 times [2018-10-02 12:16:49,935 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:49,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:49,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:49,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:49,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:49,949 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-02 12:16:49,949 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-02 12:16:49,949 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-02 12:16:49,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:50,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:16:50,283 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-02 12:16:50,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:50,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 12:16:50,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:50,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:50,311 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:50,311 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand 3 states. [2018-10-02 12:16:50,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:50,639 INFO L93 Difference]: Finished difference Result 246 states and 370 transitions. [2018-10-02 12:16:50,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:50,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-02 12:16:50,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:50,641 INFO L225 Difference]: With dead ends: 246 [2018-10-02 12:16:50,642 INFO L226 Difference]: Without dead ends: 162 [2018-10-02 12:16:50,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime [2018-10-02 12:16:50,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-02 12:16:50,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-10-02 12:16:50,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-02 12:16:50,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2018-10-02 12:16:50,669 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 234 transitions. Word has length 44 [2018-10-02 12:16:50,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:50,670 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 234 transitions. [2018-10-02 12:16:50,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:50,670 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 234 transitions. [2018-10-02 12:16:50,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-02 12:16:50,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:50,672 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:50,673 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:50,673 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:50,673 INFO L82 PathProgramCache]: Analyzing trace with hash -688187521, now seen corresponding path program 1 times [2018-10-02 12:16:50,673 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:50,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:50,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:50,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:50,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:50,756 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-02 12:16:50,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:50,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:50,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:50,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:50,758 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:50,758 INFO L87 Difference]: Start difference. First operand 162 states and 234 transitions. Second operand 3 states. [2018-10-02 12:16:51,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:51,714 INFO L93 Difference]: Finished difference Result 250 states and 366 transitions. [2018-10-02 12:16:51,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:51,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-10-02 12:16:51,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:51,717 INFO L225 Difference]: With dead ends: 250 [2018-10-02 12:16:51,717 INFO L226 Difference]: Without dead ends: 166 [2018-10-02 12:16:51,718 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 [2018-10-02 12:16:51,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-02 12:16:51,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-10-02 12:16:51,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-02 12:16:51,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 238 transitions. [2018-10-02 12:16:51,752 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 238 transitions. Word has length 47 [2018-10-02 12:16:51,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:51,752 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 238 transitions. [2018-10-02 12:16:51,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:51,753 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 238 transitions. [2018-10-02 12:16:51,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-02 12:16:51,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:51,763 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:51,764 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:51,764 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:51,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1326956629, now seen corresponding path program 1 times [2018-10-02 12:16:51,764 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:51,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:51,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:51,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:51,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:51,976 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-02 12:16:51,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:16:51,977 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:16:51,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:52,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:16:52,336 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-02 12:16:52,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 12:16:52,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-02 12:16:52,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 12:16:52,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 12:16:52,359 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:52,359 INFO L87 Difference]: Start difference. First operand 166 states and 238 transitions. Second operand 5 states. [2018-10-02 12:16:54,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:54,194 INFO L93 Difference]: Finished difference Result 598 states and 860 transitions. [2018-10-02 12:16:54,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-02 12:16:54,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-10-02 12:16:54,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:54,197 INFO L225 Difference]: With dead ends: 598 [2018-10-02 12:16:54,197 INFO L226 Difference]: Without dead ends: 406 [2018-10-02 12:16:54,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.1s impTime [2018-10-02 12:16:54,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-10-02 12:16:54,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 240. [2018-10-02 12:16:54,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-02 12:16:54,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 333 transitions. [2018-10-02 12:16:54,233 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 333 transitions. Word has length 48 [2018-10-02 12:16:54,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:54,233 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 333 transitions. [2018-10-02 12:16:54,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 12:16:54,234 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 333 transitions. [2018-10-02 12:16:54,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-02 12:16:54,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:54,236 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:54,236 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:54,236 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:54,236 INFO L82 PathProgramCache]: Analyzing trace with hash 2115677753, now seen corresponding path program 1 times [2018-10-02 12:16:54,236 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:54,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:54,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:54,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:54,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:54,298 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-10-02 12:16:54,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:54,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:54,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:54,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:54,299 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:54,299 INFO L87 Difference]: Start difference. First operand 240 states and 333 transitions. Second operand 3 states. [2018-10-02 12:16:54,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:54,565 INFO L93 Difference]: Finished difference Result 399 states and 560 transitions. [2018-10-02 12:16:54,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:54,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-10-02 12:16:54,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:54,572 INFO L225 Difference]: With dead ends: 399 [2018-10-02 12:16:54,573 INFO L226 Difference]: Without dead ends: 239 [2018-10-02 12:16:54,573 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 [2018-10-02 12:16:54,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-02 12:16:54,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-10-02 12:16:54,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-10-02 12:16:54,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 329 transitions. [2018-10-02 12:16:54,603 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 329 transitions. Word has length 60 [2018-10-02 12:16:54,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:54,603 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 329 transitions. [2018-10-02 12:16:54,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:54,603 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 329 transitions. [2018-10-02 12:16:54,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-02 12:16:54,605 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:54,605 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:54,605 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:54,605 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:54,605 INFO L82 PathProgramCache]: Analyzing trace with hash 227864519, now seen corresponding path program 1 times [2018-10-02 12:16:54,606 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:54,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:54,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:54,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:54,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:54,694 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-10-02 12:16:54,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:54,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:54,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:54,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:54,697 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:54,697 INFO L87 Difference]: Start difference. First operand 239 states and 329 transitions. Second operand 3 states. [2018-10-02 12:16:55,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:55,168 INFO L93 Difference]: Finished difference Result 470 states and 649 transitions. [2018-10-02 12:16:55,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:55,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-10-02 12:16:55,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:55,170 INFO L225 Difference]: With dead ends: 470 [2018-10-02 12:16:55,170 INFO L226 Difference]: Without dead ends: 237 [2018-10-02 12:16:55,171 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 [2018-10-02 12:16:55,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-02 12:16:55,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-10-02 12:16:55,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-02 12:16:55,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 319 transitions. [2018-10-02 12:16:55,198 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 319 transitions. Word has length 65 [2018-10-02 12:16:55,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:55,198 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 319 transitions. [2018-10-02 12:16:55,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:55,198 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 319 transitions. [2018-10-02 12:16:55,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-02 12:16:55,199 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:55,199 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:55,200 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:55,200 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:55,200 INFO L82 PathProgramCache]: Analyzing trace with hash -242141821, now seen corresponding path program 1 times [2018-10-02 12:16:55,200 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:55,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:55,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:55,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:55,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:55,271 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-02 12:16:55,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:55,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:55,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:55,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:55,271 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:55,272 INFO L87 Difference]: Start difference. First operand 237 states and 319 transitions. Second operand 3 states. [2018-10-02 12:16:55,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:55,572 INFO L93 Difference]: Finished difference Result 465 states and 628 transitions. [2018-10-02 12:16:55,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:55,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-10-02 12:16:55,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:55,577 INFO L225 Difference]: With dead ends: 465 [2018-10-02 12:16:55,578 INFO L226 Difference]: Without dead ends: 235 [2018-10-02 12:16:55,578 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 [2018-10-02 12:16:55,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-02 12:16:55,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-10-02 12:16:55,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-02 12:16:55,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 309 transitions. [2018-10-02 12:16:55,604 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 309 transitions. Word has length 71 [2018-10-02 12:16:55,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:55,604 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 309 transitions. [2018-10-02 12:16:55,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:55,605 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 309 transitions. [2018-10-02 12:16:55,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-02 12:16:55,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:55,606 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:55,606 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:55,606 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:55,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1274982729, now seen corresponding path program 1 times [2018-10-02 12:16:55,607 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:55,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:55,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:55,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:55,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:55,692 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-02 12:16:55,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:55,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:55,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:55,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:55,693 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:55,694 INFO L87 Difference]: Start difference. First operand 235 states and 309 transitions. Second operand 3 states. [2018-10-02 12:16:56,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:56,060 INFO L93 Difference]: Finished difference Result 465 states and 615 transitions. [2018-10-02 12:16:56,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:56,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-10-02 12:16:56,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:56,062 INFO L225 Difference]: With dead ends: 465 [2018-10-02 12:16:56,062 INFO L226 Difference]: Without dead ends: 238 [2018-10-02 12:16:56,063 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 [2018-10-02 12:16:56,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-02 12:16:56,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-10-02 12:16:56,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-10-02 12:16:56,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 307 transitions. [2018-10-02 12:16:56,087 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 307 transitions. Word has length 78 [2018-10-02 12:16:56,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:56,088 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 307 transitions. [2018-10-02 12:16:56,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:56,088 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 307 transitions. [2018-10-02 12:16:56,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-02 12:16:56,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:56,089 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 6, 5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:56,089 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:56,090 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:56,090 INFO L82 PathProgramCache]: Analyzing trace with hash 409856557, now seen corresponding path program 1 times [2018-10-02 12:16:56,090 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:56,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:56,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:56,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:56,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:56,177 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-10-02 12:16:56,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:56,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:56,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:56,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:56,178 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:56,179 INFO L87 Difference]: Start difference. First operand 238 states and 307 transitions. Second operand 3 states. [2018-10-02 12:16:57,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:57,035 INFO L93 Difference]: Finished difference Result 498 states and 646 transitions. [2018-10-02 12:16:57,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:57,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-10-02 12:16:57,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:57,037 INFO L225 Difference]: With dead ends: 498 [2018-10-02 12:16:57,037 INFO L226 Difference]: Without dead ends: 268 [2018-10-02 12:16:57,038 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 [2018-10-02 12:16:57,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-10-02 12:16:57,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-10-02 12:16:57,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-02 12:16:57,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 337 transitions. [2018-10-02 12:16:57,065 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 337 transitions. Word has length 86 [2018-10-02 12:16:57,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:57,066 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 337 transitions. [2018-10-02 12:16:57,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:57,066 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 337 transitions. [2018-10-02 12:16:57,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-02 12:16:57,067 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:57,067 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:57,068 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:57,068 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:57,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1980925187, now seen corresponding path program 1 times [2018-10-02 12:16:57,068 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:57,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:57,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:57,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:57,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:57,175 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-10-02 12:16:57,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:57,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:57,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:57,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:57,176 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:57,176 INFO L87 Difference]: Start difference. First operand 268 states and 337 transitions. Second operand 3 states. [2018-10-02 12:16:57,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:57,546 INFO L93 Difference]: Finished difference Result 561 states and 712 transitions. [2018-10-02 12:16:57,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:57,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-10-02 12:16:57,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:57,548 INFO L225 Difference]: With dead ends: 561 [2018-10-02 12:16:57,548 INFO L226 Difference]: Without dead ends: 301 [2018-10-02 12:16:57,549 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 [2018-10-02 12:16:57,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-10-02 12:16:57,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-10-02 12:16:57,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-02 12:16:57,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 370 transitions. [2018-10-02 12:16:57,587 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 370 transitions. Word has length 96 [2018-10-02 12:16:57,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:57,587 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 370 transitions. [2018-10-02 12:16:57,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:57,588 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 370 transitions. [2018-10-02 12:16:57,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-02 12:16:57,589 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:57,589 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:57,589 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:57,589 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:57,590 INFO L82 PathProgramCache]: Analyzing trace with hash -93746115, now seen corresponding path program 1 times [2018-10-02 12:16:57,590 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:57,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:57,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:57,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:57,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:57,708 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-10-02 12:16:57,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:57,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:57,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:57,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:57,709 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:57,709 INFO L87 Difference]: Start difference. First operand 301 states and 370 transitions. Second operand 3 states. [2018-10-02 12:16:58,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:58,368 INFO L93 Difference]: Finished difference Result 397 states and 491 transitions. [2018-10-02 12:16:58,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:58,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-10-02 12:16:58,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:58,372 INFO L225 Difference]: With dead ends: 397 [2018-10-02 12:16:58,372 INFO L226 Difference]: Without dead ends: 395 [2018-10-02 12:16:58,373 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 [2018-10-02 12:16:58,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-02 12:16:58,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-10-02 12:16:58,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-02 12:16:58,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 489 transitions. [2018-10-02 12:16:58,420 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 489 transitions. Word has length 107 [2018-10-02 12:16:58,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:58,421 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 489 transitions. [2018-10-02 12:16:58,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:58,421 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 489 transitions. [2018-10-02 12:16:58,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-02 12:16:58,422 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:58,423 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 11, 10, 9, 8, 7, 6, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:58,423 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:58,423 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:58,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1780977529, now seen corresponding path program 1 times [2018-10-02 12:16:58,423 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:58,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:58,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:58,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:58,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:58,443 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-02 12:16:58,443 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-02 12:16:58,443 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-02 12:16:58,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:58,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:16:58,641 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2018-10-02 12:16:58,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:16:58,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 12:16:58,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 12:16:58,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 12:16:58,669 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:58,669 INFO L87 Difference]: Start difference. First operand 395 states and 489 transitions. Second operand 3 states. [2018-10-02 12:16:58,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:58,886 INFO L93 Difference]: Finished difference Result 782 states and 969 transitions. [2018-10-02 12:16:58,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 12:16:58,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2018-10-02 12:16:58,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:58,889 INFO L225 Difference]: With dead ends: 782 [2018-10-02 12:16:58,889 INFO L226 Difference]: Without dead ends: 395 [2018-10-02 12:16:58,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:16:58,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-02 12:16:58,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-10-02 12:16:58,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-02 12:16:58,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 466 transitions. [2018-10-02 12:16:58,937 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 466 transitions. Word has length 136 [2018-10-02 12:16:58,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:58,938 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 466 transitions. [2018-10-02 12:16:58,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 12:16:58,938 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 466 transitions. [2018-10-02 12:16:58,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-02 12:16:58,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:16:58,940 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 16, 15, 14, 12, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:16:58,941 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:16:58,941 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:16:58,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1988836963, now seen corresponding path program 1 times [2018-10-02 12:16:58,941 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:16:58,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:16:58,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:58,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:58,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:16:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:59,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 740 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-10-02 12:16:59,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:16:59,204 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 12:16:59,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:16:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:16:59,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:16:59,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 740 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-10-02 12:16:59,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:16:59,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-02 12:16:59,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 12:16:59,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 12:16:59,448 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:16:59,449 INFO L87 Difference]: Start difference. First operand 395 states and 466 transitions. Second operand 4 states. [2018-10-02 12:16:59,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:16:59,628 INFO L93 Difference]: Finished difference Result 629 states and 744 transitions. [2018-10-02 12:16:59,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 12:16:59,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-10-02 12:16:59,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:16:59,629 INFO L225 Difference]: With dead ends: 629 [2018-10-02 12:16:59,629 INFO L226 Difference]: Without dead ends: 0 [2018-10-02 12:16:59,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime [2018-10-02 12:16:59,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-02 12:16:59,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-02 12:16:59,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-02 12:16:59,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-02 12:16:59,631 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2018-10-02 12:16:59,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:16:59,631 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-02 12:16:59,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 12:16:59,631 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-02 12:16:59,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-02 12:16:59,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-02 12:16:59,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:16:59,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 12:17:01,050 WARN L178 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2018-10-02 12:17:01,247 WARN L178 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-10-02 12:17:01,651 WARN L178 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-10-02 12:17:01,788 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2018-10-02 12:17:02,044 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-02 12:17:02,172 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-02 12:17:02,480 WARN L178 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2018-10-02 12:17:02,733 WARN L178 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-02 12:17:03,015 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2018-10-02 12:17:03,118 INFO L421 ceAbstractionStarter]: At program point L345(lines 345 353) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)) (and .cse2 .cse3 .cse4 .cse5 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)))) [2018-10-02 12:17:03,118 INFO L421 ceAbstractionStarter]: At program point L304(lines 304 320) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0) (and .cse1 .cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and .cse3 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)) (and .cse3 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)))) [2018-10-02 12:17:03,118 INFO L421 ceAbstractionStarter]: At program point L420(lines 420 440) the Hoare annotation is: (let ((.cse0 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) .cse0 .cse1) (and (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) .cse0 .cse1))) [2018-10-02 12:17:03,118 INFO L421 ceAbstractionStarter]: At program point L482(lines 264 482) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-10-02 12:17:03,118 INFO L421 ceAbstractionStarter]: At program point L416(lines 416 427) the Hoare annotation is: (and (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) [2018-10-02 12:17:03,118 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 3 485) no Hoare annotation was computed. [2018-10-02 12:17:03,118 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 3 485) no Hoare annotation was computed. [2018-10-02 12:17:03,119 INFO L421 ceAbstractionStarter]: At program point L408(lines 408 417) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~4 8576) .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) .cse0 .cse1 .cse2 .cse3))) [2018-10-02 12:17:03,119 INFO L421 ceAbstractionStarter]: At program point L375(lines 375 387) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~4 8576) .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) .cse0 .cse1 .cse2 .cse3))) [2018-10-02 12:17:03,119 INFO L421 ceAbstractionStarter]: At program point L462(lines 459 477) the Hoare annotation is: (and (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) [2018-10-02 12:17:03,119 INFO L421 ceAbstractionStarter]: At program point L429(lines 426 448) the Hoare annotation is: (and (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) [2018-10-02 12:17:03,119 INFO L421 ceAbstractionStarter]: At program point L355(lines 355 372) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-10-02 12:17:03,119 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 3 485) no Hoare annotation was computed. [2018-10-02 12:17:03,119 INFO L421 ceAbstractionStarter]: At program point L273(lines 236 273) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-10-02 12:17:03,119 INFO L421 ceAbstractionStarter]: At program point L269(lines 269 288) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-10-02 12:17:03,120 INFO L421 ceAbstractionStarter]: At program point L323(lines 323 340) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse4 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)) (and .cse2 .cse3 .cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse3 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)))) [2018-10-02 12:17:03,120 INFO L421 ceAbstractionStarter]: At program point L447(lines 447 473) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) [2018-10-02 12:17:03,120 INFO L421 ceAbstractionStarter]: At program point L476(lines 476 483) the Hoare annotation is: false [2018-10-02 12:17:03,120 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 484) no Hoare annotation was computed. [2018-10-02 12:17:03,120 INFO L421 ceAbstractionStarter]: At program point L249(lines 249 265) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-10-02 12:17:03,120 INFO L421 ceAbstractionStarter]: At program point L439(lines 439 460) the Hoare annotation is: (and (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) [2018-10-02 12:17:03,120 INFO L421 ceAbstractionStarter]: At program point L390(lines 390 405) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~4 8576) .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) .cse0 .cse1 .cse2 .cse3))) [2018-10-02 12:17:03,121 INFO L421 ceAbstractionStarter]: At program point L291(lines 291 301) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-10-02 12:17:03,138 INFO L202 PluginConnector]: Adding new model s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:17:03 BoogieIcfgContainer [2018-10-02 12:17:03,138 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 12:17:03,139 INFO L168 Benchmark]: Toolchain (without parser) took 18063.59 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 134.7 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 279.2 MB). Peak memory consumption was 413.9 MB. Max. memory is 7.1 GB. [2018-10-02 12:17:03,141 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 12:17:03,141 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.95 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 12:17:03,142 INFO L168 Benchmark]: Boogie Preprocessor took 63.35 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 12:17:03,142 INFO L168 Benchmark]: RCFGBuilder took 787.88 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-02 12:17:03,143 INFO L168 Benchmark]: TraceAbstraction took 17144.53 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 134.7 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 247.5 MB). Peak memory consumption was 382.2 MB. Max. memory is 7.1 GB. [2018-10-02 12:17:03,148 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.95 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 63.35 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 787.88 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 17144.53 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 134.7 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 247.5 MB). Peak memory consumption was 382.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 484]: 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: 420]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || ((ssl3_accept_~blastFlag~4 <= 2 && !(8544 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || (((!(8656 == ssl3_accept_~s__state~4) && !(8672 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: (((((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3)) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) - InvariantResult [Line: 459]: Loop Invariant Derived loop invariant: ((((!(8672 == ssl3_accept_~s__state~4) && !(8512 == ssl3_accept_~s__state~4)) && ssl3_accept_~blastFlag~4 <= 3) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4) - InvariantResult [Line: 323]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3)) || (((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || (((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448) - InvariantResult [Line: 355]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || (((((!(8512 == ssl3_accept_~s__state~4) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) && ssl3_accept_~s__state~4 <= 8576) && !(8448 == ssl3_accept_~s__state~4))) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 426]: Loop Invariant Derived loop invariant: (((((!(8656 == ssl3_accept_~s__state~4) && !(8672 == ssl3_accept_~s__state~4)) && ssl3_accept_~blastFlag~4 <= 2) && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4) - InvariantResult [Line: 236]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || (((((!(8512 == ssl3_accept_~s__state~4) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) && ssl3_accept_~s__state~4 <= 8576) && !(8448 == ssl3_accept_~s__state~4))) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 439]: Loop Invariant Derived loop invariant: ((((!(8672 == ssl3_accept_~s__state~4) && ssl3_accept_~blastFlag~4 <= 2) && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: (((((!(8656 == ssl3_accept_~s__state~4) && !(8672 == ssl3_accept_~s__state~4)) && ssl3_accept_~blastFlag~4 <= 2) && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4) - InvariantResult [Line: 447]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3 - InvariantResult [Line: 476]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || (((((!(8512 == ssl3_accept_~s__state~4) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) && ssl3_accept_~s__state~4 <= 8576) && !(8448 == ssl3_accept_~s__state~4))) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 291]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 304]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || ((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448) - InvariantResult [Line: 249]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. SAFE Result, 17.0s OverallTime, 18 OverallIterations, 19 TraceHistogramMax, 9.8s AutomataDifference, 0.0s DeadEndRemovalTime, 3.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 463 SDtfs, 165 SDslu, 184 SDs, 0 SdLazy, 673 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=395occurred in iteration=16, 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.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 166 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 19 PreInvPairs, 288 NumberOfFragments, 732 HoareAnnotationTreeSize, 19 FomulaSimplifications, 12030 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 19 FomulaSimplificationsInter, 1541 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1437 NumberOfCodeBlocks, 1437 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1417 ConstructedInterpolants, 0 QuantifiedInterpolants, 184792 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2058 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 5056/5080 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_3_alt.BV.c.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_12-17-03-168.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_3_alt.BV.c.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_12-17-03-168.csv Received shutdown request...