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.BV.c.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 20:47:18,738 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:47:18,740 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:47:18,757 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:47:18,758 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:47:18,759 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:47:18,761 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:47:18,763 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:47:18,772 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:47:18,773 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:47:18,776 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:47:18,777 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:47:18,778 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:47:18,781 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:47:18,782 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:47:18,783 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:47:18,785 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:47:18,788 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:47:18,793 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:47:18,795 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:47:18,797 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:47:18,799 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:47:18,801 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:47:18,801 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:47:18,802 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:47:18,802 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:47:18,804 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:47:18,804 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:47:18,805 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:47:18,808 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:47:18,809 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:47:18,810 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:47:18,811 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:47:18,811 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:47:18,814 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:47:18,815 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:47:18,815 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-09-30 20:47:18,840 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:47:18,840 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:47:18,842 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:47:18,842 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:47:18,842 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:47:18,843 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:47:18,843 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:47:18,843 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:47:18,844 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:47:18,844 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:47:18,844 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:47:18,845 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:47:18,845 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:47:18,845 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:47:18,845 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:47:18,845 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:47:18,846 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:47:18,846 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:47:18,846 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:47:18,846 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:47:18,847 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:47:18,848 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:47:18,848 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:47:18,848 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:47:18,848 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:47:18,849 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:47:18,849 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:47:18,849 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:47:18,849 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:47:18,849 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:47:18,849 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 20:47:18,911 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:47:18,928 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:47:18,935 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:47:18,937 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:47:18,938 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:47:18,939 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3.BV.c.cil.c_19.bpl [2018-09-30 20:47:18,939 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3.BV.c.cil.c_19.bpl' [2018-09-30 20:47:19,045 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:47:19,049 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:47:19,050 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:47:19,050 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:47:19,050 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:47:19,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:19" (1/1) ... [2018-09-30 20:47:19,097 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:19" (1/1) ... [2018-09-30 20:47:19,107 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:47:19,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:47:19,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:47:19,109 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:47:19,121 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:19" (1/1) ... [2018-09-30 20:47:19,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:19" (1/1) ... [2018-09-30 20:47:19,133 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:19" (1/1) ... [2018-09-30 20:47:19,133 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:19" (1/1) ... [2018-09-30 20:47:19,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:19" (1/1) ... [2018-09-30 20:47:19,159 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:19" (1/1) ... [2018-09-30 20:47:19,164 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:19" (1/1) ... [2018-09-30 20:47:19,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:47:19,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:47:19,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:47:19,178 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:47:19,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:19" (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-09-30 20:47:19,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 20:47:19,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 20:47:19,942 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 20:47:19,943 INFO L202 PluginConnector]: Adding new model s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:47:19 BoogieIcfgContainer [2018-09-30 20:47:19,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:47:19,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:47:19,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:47:19,947 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:47:19,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:19" (1/2) ... [2018-09-30 20:47:19,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de8e1d9 and model type s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:47:19, skipping insertion in model container [2018-09-30 20:47:19,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:47:19" (2/2) ... [2018-09-30 20:47:19,951 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.BV.c.cil.c_19.bpl [2018-09-30 20:47:19,960 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:47:19,970 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 20:47:20,022 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:47:20,023 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:47:20,023 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:47:20,023 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:47:20,023 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:47:20,023 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:47:20,023 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:47:20,024 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:47:20,024 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:47:20,040 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-09-30 20:47:20,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 20:47:20,047 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:20,048 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:20,049 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:20,056 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:20,057 INFO L82 PathProgramCache]: Analyzing trace with hash -505433715, now seen corresponding path program 1 times [2018-09-30 20:47:20,059 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:20,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:20,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:20,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:20,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:20,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:47:20,320 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:20,321 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:47:20,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:20,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:20,339 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:20,341 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-09-30 20:47:21,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:21,162 INFO L93 Difference]: Finished difference Result 56 states and 94 transitions. [2018-09-30 20:47:21,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:21,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-30 20:47:21,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:21,180 INFO L225 Difference]: With dead ends: 56 [2018-09-30 20:47:21,180 INFO L226 Difference]: Without dead ends: 34 [2018-09-30 20:47:21,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:21,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-30 20:47:21,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-09-30 20:47:21,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-30 20:47:21,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-09-30 20:47:21,231 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 15 [2018-09-30 20:47:21,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:21,231 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2018-09-30 20:47:21,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:21,232 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2018-09-30 20:47:21,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-30 20:47:21,233 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:21,233 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:21,234 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:21,234 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:21,235 INFO L82 PathProgramCache]: Analyzing trace with hash -912155261, now seen corresponding path program 1 times [2018-09-30 20:47:21,235 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:21,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:21,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:21,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:21,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:21,351 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:47:21,351 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:21,351 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:47:21,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:21,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:21,354 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:21,354 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2018-09-30 20:47:22,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:22,282 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-09-30 20:47:22,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:22,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-09-30 20:47:22,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:22,285 INFO L225 Difference]: With dead ends: 83 [2018-09-30 20:47:22,285 INFO L226 Difference]: Without dead ends: 50 [2018-09-30 20:47:22,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:22,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-30 20:47:22,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-09-30 20:47:22,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-30 20:47:22,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 83 transitions. [2018-09-30 20:47:22,300 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 83 transitions. Word has length 23 [2018-09-30 20:47:22,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:22,301 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 83 transitions. [2018-09-30 20:47:22,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:22,301 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 83 transitions. [2018-09-30 20:47:22,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-30 20:47:22,302 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:22,303 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:47:22,303 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:22,303 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:22,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1423527967, now seen corresponding path program 1 times [2018-09-30 20:47:22,304 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:22,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:22,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:22,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:22,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:22,425 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-30 20:47:22,425 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:22,425 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:47:22,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:22,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:22,426 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:22,427 INFO L87 Difference]: Start difference. First operand 50 states and 83 transitions. Second operand 3 states. [2018-09-30 20:47:22,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:22,787 INFO L93 Difference]: Finished difference Result 106 states and 177 transitions. [2018-09-30 20:47:22,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:22,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-30 20:47:22,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:22,789 INFO L225 Difference]: With dead ends: 106 [2018-09-30 20:47:22,790 INFO L226 Difference]: Without dead ends: 57 [2018-09-30 20:47:22,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:22,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-30 20:47:22,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-30 20:47:22,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-30 20:47:22,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 92 transitions. [2018-09-30 20:47:22,808 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 92 transitions. Word has length 30 [2018-09-30 20:47:22,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:22,808 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 92 transitions. [2018-09-30 20:47:22,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:22,809 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 92 transitions. [2018-09-30 20:47:22,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-30 20:47:22,810 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:22,810 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-09-30 20:47:22,811 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:22,811 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:22,811 INFO L82 PathProgramCache]: Analyzing trace with hash 222883079, now seen corresponding path program 1 times [2018-09-30 20:47:22,811 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:22,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:22,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:22,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:22,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:22,880 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:47:22,881 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:22,881 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:47:22,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:22,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:22,882 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:22,882 INFO L87 Difference]: Start difference. First operand 57 states and 92 transitions. Second operand 3 states. [2018-09-30 20:47:23,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:23,272 INFO L93 Difference]: Finished difference Result 131 states and 214 transitions. [2018-09-30 20:47:23,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:23,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-30 20:47:23,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:23,275 INFO L225 Difference]: With dead ends: 131 [2018-09-30 20:47:23,276 INFO L226 Difference]: Without dead ends: 74 [2018-09-30 20:47:23,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:23,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-30 20:47:23,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-09-30 20:47:23,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-30 20:47:23,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 120 transitions. [2018-09-30 20:47:23,290 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 120 transitions. Word has length 30 [2018-09-30 20:47:23,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:23,290 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 120 transitions. [2018-09-30 20:47:23,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:23,291 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 120 transitions. [2018-09-30 20:47:23,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-30 20:47:23,292 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:23,292 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-09-30 20:47:23,293 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:23,293 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:23,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1035189277, now seen corresponding path program 1 times [2018-09-30 20:47:23,293 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:23,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:23,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:23,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:23,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:23,434 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-09-30 20:47:23,435 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:23,436 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:47:23,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:23,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:23,436 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:23,437 INFO L87 Difference]: Start difference. First operand 74 states and 120 transitions. Second operand 3 states. [2018-09-30 20:47:23,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:23,608 INFO L93 Difference]: Finished difference Result 153 states and 249 transitions. [2018-09-30 20:47:23,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:23,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-09-30 20:47:23,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:23,610 INFO L225 Difference]: With dead ends: 153 [2018-09-30 20:47:23,611 INFO L226 Difference]: Without dead ends: 80 [2018-09-30 20:47:23,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:23,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-30 20:47:23,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-09-30 20:47:23,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-30 20:47:23,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 125 transitions. [2018-09-30 20:47:23,627 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 125 transitions. Word has length 36 [2018-09-30 20:47:23,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:23,627 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 125 transitions. [2018-09-30 20:47:23,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:23,628 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 125 transitions. [2018-09-30 20:47:23,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-30 20:47:23,630 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:23,630 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-09-30 20:47:23,630 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:23,630 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:23,631 INFO L82 PathProgramCache]: Analyzing trace with hash -720648959, now seen corresponding path program 1 times [2018-09-30 20:47:23,631 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:23,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:23,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:23,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:23,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:23,702 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-09-30 20:47:23,703 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:23,703 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:47:23,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:23,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:23,704 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:23,704 INFO L87 Difference]: Start difference. First operand 80 states and 125 transitions. Second operand 3 states. [2018-09-30 20:47:23,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:23,901 INFO L93 Difference]: Finished difference Result 164 states and 257 transitions. [2018-09-30 20:47:23,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:23,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-09-30 20:47:23,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:23,905 INFO L225 Difference]: With dead ends: 164 [2018-09-30 20:47:23,905 INFO L226 Difference]: Without dead ends: 85 [2018-09-30 20:47:23,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:23,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-30 20:47:23,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-30 20:47:23,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-30 20:47:23,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2018-09-30 20:47:23,921 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 41 [2018-09-30 20:47:23,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:23,921 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2018-09-30 20:47:23,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:23,922 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2018-09-30 20:47:23,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-30 20:47:23,923 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:23,923 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-09-30 20:47:23,924 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:23,924 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:23,924 INFO L82 PathProgramCache]: Analyzing trace with hash -2015268825, now seen corresponding path program 1 times [2018-09-30 20:47:23,924 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:23,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:23,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:23,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:23,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:23,938 ERROR L236 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-09-30 20:47:23,938 INFO L259 seRefinementStrategy]: Advancing trace checker [2018-09-30 20:47:23,938 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-09-30 20:47:23,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:24,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:47:24,164 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-09-30 20:47:24,194 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:24,194 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:47:24,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:24,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:24,195 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:24,195 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand 3 states. [2018-09-30 20:47:24,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:24,539 INFO L93 Difference]: Finished difference Result 246 states and 370 transitions. [2018-09-30 20:47:24,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:24,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-09-30 20:47:24,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:24,542 INFO L225 Difference]: With dead ends: 246 [2018-09-30 20:47:24,543 INFO L226 Difference]: Without dead ends: 162 [2018-09-30 20:47:24,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:24,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-09-30 20:47:24,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-09-30 20:47:24,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-09-30 20:47:24,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2018-09-30 20:47:24,571 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 234 transitions. Word has length 44 [2018-09-30 20:47:24,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:24,571 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 234 transitions. [2018-09-30 20:47:24,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:24,572 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 234 transitions. [2018-09-30 20:47:24,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-30 20:47:24,574 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:24,574 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-09-30 20:47:24,575 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:24,575 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:24,575 INFO L82 PathProgramCache]: Analyzing trace with hash -688187521, now seen corresponding path program 1 times [2018-09-30 20:47:24,575 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:24,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:24,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:24,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:24,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:24,683 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-09-30 20:47:24,685 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:24,685 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:24,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:24,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:24,687 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:24,687 INFO L87 Difference]: Start difference. First operand 162 states and 234 transitions. Second operand 3 states. [2018-09-30 20:47:25,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:25,499 INFO L93 Difference]: Finished difference Result 250 states and 366 transitions. [2018-09-30 20:47:25,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:25,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-09-30 20:47:25,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:25,501 INFO L225 Difference]: With dead ends: 250 [2018-09-30 20:47:25,501 INFO L226 Difference]: Without dead ends: 166 [2018-09-30 20:47:25,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:25,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-09-30 20:47:25,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-09-30 20:47:25,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-09-30 20:47:25,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 238 transitions. [2018-09-30 20:47:25,526 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 238 transitions. Word has length 47 [2018-09-30 20:47:25,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:25,526 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 238 transitions. [2018-09-30 20:47:25,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:25,527 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 238 transitions. [2018-09-30 20:47:25,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-30 20:47:25,529 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:25,529 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-09-30 20:47:25,530 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:25,530 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:25,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1326956629, now seen corresponding path program 1 times [2018-09-30 20:47:25,530 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:25,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:25,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:25,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:25,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:25,758 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-30 20:47:25,758 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:47:25,758 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-09-30 20:47:25,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:25,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:47:26,587 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-09-30 20:47:26,608 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 20:47:26,609 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-09-30 20:47:26,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:47:26,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:47:26,610 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:26,610 INFO L87 Difference]: Start difference. First operand 166 states and 238 transitions. Second operand 5 states. [2018-09-30 20:47:29,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:29,616 INFO L93 Difference]: Finished difference Result 598 states and 860 transitions. [2018-09-30 20:47:29,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 20:47:29,617 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-09-30 20:47:29,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:29,620 INFO L225 Difference]: With dead ends: 598 [2018-09-30 20:47:29,620 INFO L226 Difference]: Without dead ends: 406 [2018-09-30 20:47:29,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-09-30 20:47:29,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-09-30 20:47:29,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 240. [2018-09-30 20:47:29,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-09-30 20:47:29,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 333 transitions. [2018-09-30 20:47:29,660 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 333 transitions. Word has length 48 [2018-09-30 20:47:29,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:29,661 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 333 transitions. [2018-09-30 20:47:29,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:47:29,661 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 333 transitions. [2018-09-30 20:47:29,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-30 20:47:29,663 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:29,663 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-09-30 20:47:29,664 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:29,664 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:29,664 INFO L82 PathProgramCache]: Analyzing trace with hash 2115677753, now seen corresponding path program 1 times [2018-09-30 20:47:29,664 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:29,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:29,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:29,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:29,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:29,763 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-09-30 20:47:29,763 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:29,764 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:29,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:29,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:29,765 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:29,765 INFO L87 Difference]: Start difference. First operand 240 states and 333 transitions. Second operand 3 states. [2018-09-30 20:47:30,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:30,149 INFO L93 Difference]: Finished difference Result 399 states and 560 transitions. [2018-09-30 20:47:30,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:30,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-09-30 20:47:30,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:30,158 INFO L225 Difference]: With dead ends: 399 [2018-09-30 20:47:30,158 INFO L226 Difference]: Without dead ends: 239 [2018-09-30 20:47:30,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:30,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-09-30 20:47:30,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-09-30 20:47:30,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-09-30 20:47:30,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 329 transitions. [2018-09-30 20:47:30,181 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 329 transitions. Word has length 60 [2018-09-30 20:47:30,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:30,182 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 329 transitions. [2018-09-30 20:47:30,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:30,182 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 329 transitions. [2018-09-30 20:47:30,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-30 20:47:30,184 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:30,184 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-09-30 20:47:30,184 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:30,184 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:30,184 INFO L82 PathProgramCache]: Analyzing trace with hash 227864519, now seen corresponding path program 1 times [2018-09-30 20:47:30,185 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:30,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:30,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:30,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:30,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:30,257 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-09-30 20:47:30,258 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:30,258 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:30,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:30,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:30,259 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:30,259 INFO L87 Difference]: Start difference. First operand 239 states and 329 transitions. Second operand 3 states. [2018-09-30 20:47:30,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:30,441 INFO L93 Difference]: Finished difference Result 470 states and 649 transitions. [2018-09-30 20:47:30,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:30,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-09-30 20:47:30,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:30,445 INFO L225 Difference]: With dead ends: 470 [2018-09-30 20:47:30,445 INFO L226 Difference]: Without dead ends: 237 [2018-09-30 20:47:30,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:30,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-09-30 20:47:30,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-09-30 20:47:30,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-30 20:47:30,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 319 transitions. [2018-09-30 20:47:30,475 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 319 transitions. Word has length 65 [2018-09-30 20:47:30,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:30,476 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 319 transitions. [2018-09-30 20:47:30,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:30,476 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 319 transitions. [2018-09-30 20:47:30,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-30 20:47:30,477 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:30,477 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-09-30 20:47:30,477 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:30,478 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:30,478 INFO L82 PathProgramCache]: Analyzing trace with hash -242141821, now seen corresponding path program 1 times [2018-09-30 20:47:30,478 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:30,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:30,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:30,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:30,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:30,553 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-09-30 20:47:30,553 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:30,554 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:30,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:30,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:30,554 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:30,554 INFO L87 Difference]: Start difference. First operand 237 states and 319 transitions. Second operand 3 states. [2018-09-30 20:47:30,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:30,813 INFO L93 Difference]: Finished difference Result 465 states and 628 transitions. [2018-09-30 20:47:30,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:30,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-09-30 20:47:30,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:30,817 INFO L225 Difference]: With dead ends: 465 [2018-09-30 20:47:30,817 INFO L226 Difference]: Without dead ends: 235 [2018-09-30 20:47:30,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:30,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-09-30 20:47:30,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-09-30 20:47:30,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-09-30 20:47:30,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 309 transitions. [2018-09-30 20:47:30,843 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 309 transitions. Word has length 71 [2018-09-30 20:47:30,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:30,843 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 309 transitions. [2018-09-30 20:47:30,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:30,843 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 309 transitions. [2018-09-30 20:47:30,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-30 20:47:30,844 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:30,845 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-09-30 20:47:30,845 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:30,845 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:30,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1274982729, now seen corresponding path program 1 times [2018-09-30 20:47:30,845 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:30,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:30,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:30,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:30,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:30,929 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-09-30 20:47:30,929 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:30,930 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:30,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:30,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:30,930 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:30,930 INFO L87 Difference]: Start difference. First operand 235 states and 309 transitions. Second operand 3 states. [2018-09-30 20:47:31,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:31,225 INFO L93 Difference]: Finished difference Result 465 states and 615 transitions. [2018-09-30 20:47:31,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:31,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-09-30 20:47:31,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:31,227 INFO L225 Difference]: With dead ends: 465 [2018-09-30 20:47:31,227 INFO L226 Difference]: Without dead ends: 238 [2018-09-30 20:47:31,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:31,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-09-30 20:47:31,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-09-30 20:47:31,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-09-30 20:47:31,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 307 transitions. [2018-09-30 20:47:31,254 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 307 transitions. Word has length 78 [2018-09-30 20:47:31,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:31,254 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 307 transitions. [2018-09-30 20:47:31,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:31,254 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 307 transitions. [2018-09-30 20:47:31,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-30 20:47:31,255 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:31,256 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-09-30 20:47:31,256 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:31,256 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:31,256 INFO L82 PathProgramCache]: Analyzing trace with hash 409856557, now seen corresponding path program 1 times [2018-09-30 20:47:31,256 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:31,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:31,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:31,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:31,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:31,366 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-09-30 20:47:31,366 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:31,366 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:31,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:31,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:31,367 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:31,367 INFO L87 Difference]: Start difference. First operand 238 states and 307 transitions. Second operand 3 states. [2018-09-30 20:47:32,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:32,232 INFO L93 Difference]: Finished difference Result 498 states and 646 transitions. [2018-09-30 20:47:32,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:32,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-09-30 20:47:32,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:32,235 INFO L225 Difference]: With dead ends: 498 [2018-09-30 20:47:32,235 INFO L226 Difference]: Without dead ends: 268 [2018-09-30 20:47:32,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:32,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-09-30 20:47:32,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-09-30 20:47:32,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-09-30 20:47:32,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 337 transitions. [2018-09-30 20:47:32,260 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 337 transitions. Word has length 86 [2018-09-30 20:47:32,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:32,261 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 337 transitions. [2018-09-30 20:47:32,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:32,261 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 337 transitions. [2018-09-30 20:47:32,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-30 20:47:32,262 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:32,262 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-09-30 20:47:32,263 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:32,263 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:32,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1980925187, now seen corresponding path program 1 times [2018-09-30 20:47:32,263 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:32,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:32,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:32,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:32,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:32,377 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-09-30 20:47:32,377 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:32,377 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:32,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:32,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:32,378 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:32,378 INFO L87 Difference]: Start difference. First operand 268 states and 337 transitions. Second operand 3 states. [2018-09-30 20:47:32,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:32,703 INFO L93 Difference]: Finished difference Result 561 states and 712 transitions. [2018-09-30 20:47:32,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:32,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-09-30 20:47:32,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:32,705 INFO L225 Difference]: With dead ends: 561 [2018-09-30 20:47:32,705 INFO L226 Difference]: Without dead ends: 301 [2018-09-30 20:47:32,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:32,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-09-30 20:47:32,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-09-30 20:47:32,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-30 20:47:32,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 370 transitions. [2018-09-30 20:47:32,740 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 370 transitions. Word has length 96 [2018-09-30 20:47:32,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:32,740 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 370 transitions. [2018-09-30 20:47:32,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:32,741 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 370 transitions. [2018-09-30 20:47:32,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-09-30 20:47:32,742 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:32,742 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-09-30 20:47:32,742 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:32,742 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:32,742 INFO L82 PathProgramCache]: Analyzing trace with hash -93746115, now seen corresponding path program 1 times [2018-09-30 20:47:32,743 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:32,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:32,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:32,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:32,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:32,868 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-09-30 20:47:32,869 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:32,869 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:32,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:32,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:32,870 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:32,870 INFO L87 Difference]: Start difference. First operand 301 states and 370 transitions. Second operand 3 states. [2018-09-30 20:47:32,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:32,997 INFO L93 Difference]: Finished difference Result 397 states and 491 transitions. [2018-09-30 20:47:32,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:32,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-09-30 20:47:32,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:33,000 INFO L225 Difference]: With dead ends: 397 [2018-09-30 20:47:33,000 INFO L226 Difference]: Without dead ends: 395 [2018-09-30 20:47:33,001 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:47:33,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-09-30 20:47:33,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-09-30 20:47:33,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-09-30 20:47:33,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 489 transitions. [2018-09-30 20:47:33,043 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 489 transitions. Word has length 107 [2018-09-30 20:47:33,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:33,043 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 489 transitions. [2018-09-30 20:47:33,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:33,043 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 489 transitions. [2018-09-30 20:47:33,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-30 20:47:33,045 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:33,045 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-09-30 20:47:33,046 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:33,046 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:33,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1780977529, now seen corresponding path program 1 times [2018-09-30 20:47:33,046 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:33,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:33,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:33,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:33,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:33,064 ERROR L236 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-09-30 20:47:33,064 INFO L259 seRefinementStrategy]: Advancing trace checker [2018-09-30 20:47:33,064 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-09-30 20:47:33,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:33,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:47:33,661 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2018-09-30 20:47:33,701 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:47:33,701 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:47:33,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:47:33,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:47:33,702 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:33,702 INFO L87 Difference]: Start difference. First operand 395 states and 489 transitions. Second operand 3 states. [2018-09-30 20:47:34,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:34,279 INFO L93 Difference]: Finished difference Result 782 states and 969 transitions. [2018-09-30 20:47:34,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:47:34,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2018-09-30 20:47:34,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:34,281 INFO L225 Difference]: With dead ends: 782 [2018-09-30 20:47:34,281 INFO L226 Difference]: Without dead ends: 395 [2018-09-30 20:47:34,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-09-30 20:47:34,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-09-30 20:47:34,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-09-30 20:47:34,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-09-30 20:47:34,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 466 transitions. [2018-09-30 20:47:34,333 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 466 transitions. Word has length 136 [2018-09-30 20:47:34,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:34,333 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 466 transitions. [2018-09-30 20:47:34,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:47:34,333 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 466 transitions. [2018-09-30 20:47:34,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-30 20:47:34,336 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:47:34,336 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-09-30 20:47:34,336 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:47:34,337 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:47:34,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1988836963, now seen corresponding path program 1 times [2018-09-30 20:47:34,337 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:47:34,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:47:34,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:34,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:34,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:47:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:34,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 740 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-09-30 20:47:34,588 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:47:34,588 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-09-30 20:47:34,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:47:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:47:34,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:47:34,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 740 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-09-30 20:47:34,885 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:47:34,885 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-09-30 20:47:34,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:47:34,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:47:34,886 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:47:34,886 INFO L87 Difference]: Start difference. First operand 395 states and 466 transitions. Second operand 4 states. [2018-09-30 20:47:35,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:47:35,105 INFO L93 Difference]: Finished difference Result 629 states and 744 transitions. [2018-09-30 20:47:35,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 20:47:35,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-09-30 20:47:35,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:47:35,106 INFO L225 Difference]: With dead ends: 629 [2018-09-30 20:47:35,106 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 20:47:35,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:47:35,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 20:47:35,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 20:47:35,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 20:47:35,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 20:47:35,108 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2018-09-30 20:47:35,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:47:35,108 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 20:47:35,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:47:35,109 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 20:47:35,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 20:47:35,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 20:47:35,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:35,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 20:47:36,518 WARN L178 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2018-09-30 20:47:37,558 WARN L178 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-30 20:47:37,887 WARN L178 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-09-30 20:47:38,005 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-09-30 20:47:38,107 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2018-09-30 20:47:38,664 WARN L178 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2018-09-30 20:47:38,791 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-30 20:47:38,917 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-30 20:47:39,032 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-09-30 20:47:39,138 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-30 20:47:39,256 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-30 20:47:39,341 INFO L422 ceAbstractionStarter]: At program point L374(lines 374 386) 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-09-30 20:47:39,342 INFO L422 ceAbstractionStarter]: At program point L354(lines 354 371) 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-09-30 20:47:39,342 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 480) no Hoare annotation was computed. [2018-09-30 20:47:39,342 INFO L422 ceAbstractionStarter]: At program point L416(lines 416 436) 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-09-30 20:47:39,342 INFO L422 ceAbstractionStarter]: At program point L478(lines 263 478) 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-09-30 20:47:39,342 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 3 481) no Hoare annotation was computed. [2018-09-30 20:47:39,342 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 3 481) no Hoare annotation was computed. [2018-09-30 20:47:39,343 INFO L422 ceAbstractionStarter]: At program point L412(lines 412 423) 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-09-30 20:47:39,343 INFO L422 ceAbstractionStarter]: At program point L404(lines 404 413) 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-09-30 20:47:39,343 INFO L422 ceAbstractionStarter]: At program point L272(lines 235 272) 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-09-30 20:47:39,343 INFO L422 ceAbstractionStarter]: At program point L268(lines 268 287) 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-09-30 20:47:39,343 INFO L422 ceAbstractionStarter]: At program point L458(lines 455 473) 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-09-30 20:47:39,343 INFO L422 ceAbstractionStarter]: At program point L425(lines 422 444) 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-09-30 20:47:39,343 INFO L422 ceAbstractionStarter]: At program point L322(lines 322 339) 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-09-30 20:47:39,343 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 3 481) no Hoare annotation was computed. [2018-09-30 20:47:39,344 INFO L422 ceAbstractionStarter]: At program point L248(lines 248 264) 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-09-30 20:47:39,344 INFO L422 ceAbstractionStarter]: At program point L389(lines 389 401) 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-09-30 20:47:39,344 INFO L422 ceAbstractionStarter]: At program point L290(lines 290 300) 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-09-30 20:47:39,344 INFO L422 ceAbstractionStarter]: At program point L443(lines 443 469) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) [2018-09-30 20:47:39,344 INFO L422 ceAbstractionStarter]: At program point L344(lines 344 352) 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-09-30 20:47:39,344 INFO L422 ceAbstractionStarter]: At program point L472(lines 472 479) the Hoare annotation is: false [2018-09-30 20:47:39,344 INFO L422 ceAbstractionStarter]: At program point L435(lines 435 456) 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-09-30 20:47:39,344 INFO L422 ceAbstractionStarter]: At program point L303(lines 303 319) 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-09-30 20:47:39,361 INFO L202 PluginConnector]: Adding new model s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:47:39 BoogieIcfgContainer [2018-09-30 20:47:39,361 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:47:39,362 INFO L168 Benchmark]: Toolchain (without parser) took 20316.73 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 118.5 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 299.0 MB). Peak memory consumption was 417.5 MB. Max. memory is 7.1 GB. [2018-09-30 20:47:39,364 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-09-30 20:47:39,364 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:47:39,365 INFO L168 Benchmark]: Boogie Preprocessor took 68.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:47:39,365 INFO L168 Benchmark]: RCFGBuilder took 766.01 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-09-30 20:47:39,366 INFO L168 Benchmark]: TraceAbstraction took 19417.47 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 118.5 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 267.3 MB). Peak memory consumption was 385.8 MB. Max. memory is 7.1 GB. [2018-09-30 20:47:39,371 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.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 68.17 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 766.01 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 19417.47 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 118.5 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 267.3 MB). Peak memory consumption was 385.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 480]: 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: 303]: 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: 235]: 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: 344]: 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: 472]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 322]: 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: 354]: 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: 374]: 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: 416]: 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: 455]: 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: 404]: 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: 422]: 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: 263]: 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: 435]: 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: 268]: 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: 412]: 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: 290]: 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: 248]: 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: 443]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3 - InvariantResult [Line: 389]: 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)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. SAFE Result, 19.3s OverallTime, 18 OverallIterations, 19 TraceHistogramMax, 10.3s AutomataDifference, 0.0s DeadEndRemovalTime, 4.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 463 SDtfs, 167 SDslu, 186 SDs, 0 SdLazy, 670 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, 2.6s 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.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1437 NumberOfCodeBlocks, 1437 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1417 ConstructedInterpolants, 0 QuantifiedInterpolants, 184792 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2046 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.BV.c.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_20-47-39-389.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_3.BV.c.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_20-47-39-389.csv Received shutdown request...