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-00a8621 [2018-09-30 10:56:05,584 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:56:05,586 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:56:05,601 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:56:05,601 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:56:05,603 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:56:05,604 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:56:05,606 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:56:05,607 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:56:05,608 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:56:05,609 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:56:05,609 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:56:05,610 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:56:05,611 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:56:05,612 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:56:05,613 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:56:05,614 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:56:05,615 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:56:05,617 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:56:05,619 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:56:05,620 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:56:05,621 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:56:05,623 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:56:05,623 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:56:05,624 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:56:05,625 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:56:05,625 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:56:05,626 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:56:05,627 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:56:05,628 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:56:05,628 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:56:05,629 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:56:05,629 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:56:05,629 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:56:05,633 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:56:05,634 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:56:05,634 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 10:56:05,660 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:56:05,660 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:56:05,661 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:56:05,661 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:56:05,662 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:56:05,662 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:56:05,662 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:56:05,663 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:56:05,663 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:56:05,663 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:56:05,663 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:56:05,663 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:56:05,664 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:56:05,664 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:56:05,664 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:56:05,664 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:56:05,664 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:56:05,664 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:56:05,665 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:56:05,665 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:56:05,665 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:56:05,665 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:56:05,665 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:56:05,666 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:56:05,666 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:56:05,666 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:56:05,666 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:56:05,669 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:56:05,669 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:56:05,669 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:56:05,670 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 10:56:05,730 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:56:05,744 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:56:05,748 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:56:05,749 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:56:05,750 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:56:05,751 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 10:56:05,751 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 10:56:05,833 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:56:05,840 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:56:05,840 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:56:05,841 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:56:05,841 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:56:05,861 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 10:56:05" (1/1) ... [2018-09-30 10:56:05,888 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 10:56:05" (1/1) ... [2018-09-30 10:56:05,902 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:56:05,903 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:56:05,903 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:56:05,903 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:56:05,914 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 10:56:05" (1/1) ... [2018-09-30 10:56:05,915 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 10:56:05" (1/1) ... [2018-09-30 10:56:05,919 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 10:56:05" (1/1) ... [2018-09-30 10:56:05,920 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 10:56:05" (1/1) ... [2018-09-30 10:56:05,943 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 10:56:05" (1/1) ... [2018-09-30 10:56:05,948 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 10:56:05" (1/1) ... [2018-09-30 10:56:05,951 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 10:56:05" (1/1) ... [2018-09-30 10:56:05,962 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:56:05,963 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:56:05,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:56:05,963 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:56:05,964 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 10:56:05" (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 10:56:06,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 10:56:06,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 10:56:06,621 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 10:56:06,622 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 10:56:06 BoogieIcfgContainer [2018-09-30 10:56:06,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:56:06,623 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:56:06,623 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:56:06,627 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:56:06,627 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 10:56:05" (1/2) ... [2018-09-30 10:56:06,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26cb8bc7 and model type s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:56:06, skipping insertion in model container [2018-09-30 10:56:06,628 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 10:56:06" (2/2) ... [2018-09-30 10:56:06,630 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.BV.c.cil.c_19.bpl [2018-09-30 10:56:06,640 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:56:06,651 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 10:56:06,698 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:56:06,698 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:56:06,699 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:56:06,699 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:56:06,699 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:56:06,699 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:56:06,699 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:56:06,699 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:56:06,700 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:56:06,716 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-09-30 10:56:06,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:56:06,723 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:56:06,723 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:56:06,725 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:56:06,732 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:56:06,732 INFO L82 PathProgramCache]: Analyzing trace with hash -505433715, now seen corresponding path program 1 times [2018-09-30 10:56:06,735 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:56:06,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:56:06,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:06,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:56:06,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:56:06,968 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 10:56:06,970 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:56:06,971 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:56:06,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:56:06,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:56:06,986 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:56:06,988 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-09-30 10:56:07,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:56:07,876 INFO L93 Difference]: Finished difference Result 56 states and 94 transitions. [2018-09-30 10:56:07,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:56:07,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-30 10:56:07,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:56:07,892 INFO L225 Difference]: With dead ends: 56 [2018-09-30 10:56:07,893 INFO L226 Difference]: Without dead ends: 34 [2018-09-30 10:56:07,896 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 10:56:07,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-30 10:56:07,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-09-30 10:56:07,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-30 10:56:07,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-09-30 10:56:07,936 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 15 [2018-09-30 10:56:07,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:56:07,936 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2018-09-30 10:56:07,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:56:07,937 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2018-09-30 10:56:07,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-30 10:56:07,938 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:56:07,938 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 10:56:07,939 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:56:07,939 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:56:07,939 INFO L82 PathProgramCache]: Analyzing trace with hash -912155261, now seen corresponding path program 1 times [2018-09-30 10:56:07,939 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:56:07,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:56:07,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:07,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:56:07,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:56:08,037 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 10:56:08,037 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:56:08,037 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:56:08,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:56:08,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:56:08,040 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:56:08,040 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2018-09-30 10:56:08,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:56:08,579 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-09-30 10:56:08,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:56:08,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-09-30 10:56:08,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:56:08,582 INFO L225 Difference]: With dead ends: 83 [2018-09-30 10:56:08,582 INFO L226 Difference]: Without dead ends: 50 [2018-09-30 10:56:08,583 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 10:56:08,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-30 10:56:08,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-09-30 10:56:08,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-30 10:56:08,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 83 transitions. [2018-09-30 10:56:08,597 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 83 transitions. Word has length 23 [2018-09-30 10:56:08,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:56:08,597 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 83 transitions. [2018-09-30 10:56:08,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:56:08,598 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 83 transitions. [2018-09-30 10:56:08,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-30 10:56:08,599 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:56:08,599 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 10:56:08,599 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:56:08,600 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:56:08,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1423527967, now seen corresponding path program 1 times [2018-09-30 10:56:08,600 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:56:08,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:56:08,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:08,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:56:08,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:56:08,671 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 10:56:08,671 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:56:08,671 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:56:08,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:56:08,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:56:08,672 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:56:08,672 INFO L87 Difference]: Start difference. First operand 50 states and 83 transitions. Second operand 3 states. [2018-09-30 10:56:09,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:56:09,304 INFO L93 Difference]: Finished difference Result 106 states and 177 transitions. [2018-09-30 10:56:09,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:56:09,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-30 10:56:09,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:56:09,307 INFO L225 Difference]: With dead ends: 106 [2018-09-30 10:56:09,307 INFO L226 Difference]: Without dead ends: 57 [2018-09-30 10:56:09,308 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 10:56:09,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-30 10:56:09,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-30 10:56:09,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-30 10:56:09,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 92 transitions. [2018-09-30 10:56:09,321 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 92 transitions. Word has length 30 [2018-09-30 10:56:09,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:56:09,322 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 92 transitions. [2018-09-30 10:56:09,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:56:09,322 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 92 transitions. [2018-09-30 10:56:09,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-30 10:56:09,323 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:56:09,324 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 10:56:09,324 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:56:09,324 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:56:09,324 INFO L82 PathProgramCache]: Analyzing trace with hash 222883079, now seen corresponding path program 1 times [2018-09-30 10:56:09,325 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:56:09,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:56:09,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:09,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:56:09,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:56:09,391 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 10:56:09,391 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:56:09,391 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:56:09,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:56:09,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:56:09,392 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:56:09,392 INFO L87 Difference]: Start difference. First operand 57 states and 92 transitions. Second operand 3 states. [2018-09-30 10:56:09,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:56:09,753 INFO L93 Difference]: Finished difference Result 131 states and 214 transitions. [2018-09-30 10:56:09,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:56:09,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-09-30 10:56:09,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:56:09,755 INFO L225 Difference]: With dead ends: 131 [2018-09-30 10:56:09,755 INFO L226 Difference]: Without dead ends: 74 [2018-09-30 10:56:09,756 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 10:56:09,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-30 10:56:09,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-09-30 10:56:09,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-30 10:56:09,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 120 transitions. [2018-09-30 10:56:09,772 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 120 transitions. Word has length 30 [2018-09-30 10:56:09,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:56:09,772 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 120 transitions. [2018-09-30 10:56:09,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:56:09,773 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 120 transitions. [2018-09-30 10:56:09,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-30 10:56:09,774 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:56:09,774 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 10:56:09,775 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:56:09,775 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:56:09,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1035189277, now seen corresponding path program 1 times [2018-09-30 10:56:09,775 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:56:09,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:56:09,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:09,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:56:09,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:56:09,857 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 10:56:09,859 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:56:09,859 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:56:09,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:56:09,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:56:09,860 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:56:09,860 INFO L87 Difference]: Start difference. First operand 74 states and 120 transitions. Second operand 3 states. [2018-09-30 10:56:10,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:56:10,063 INFO L93 Difference]: Finished difference Result 153 states and 249 transitions. [2018-09-30 10:56:10,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:56:10,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-09-30 10:56:10,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:56:10,065 INFO L225 Difference]: With dead ends: 153 [2018-09-30 10:56:10,065 INFO L226 Difference]: Without dead ends: 80 [2018-09-30 10:56:10,066 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 10:56:10,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-30 10:56:10,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-09-30 10:56:10,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-30 10:56:10,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 125 transitions. [2018-09-30 10:56:10,081 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 125 transitions. Word has length 36 [2018-09-30 10:56:10,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:56:10,082 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 125 transitions. [2018-09-30 10:56:10,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:56:10,082 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 125 transitions. [2018-09-30 10:56:10,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-30 10:56:10,084 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:56:10,084 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 10:56:10,084 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:56:10,084 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:56:10,085 INFO L82 PathProgramCache]: Analyzing trace with hash -720648959, now seen corresponding path program 1 times [2018-09-30 10:56:10,085 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:56:10,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:56:10,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:10,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:56:10,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:56:10,139 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 10:56:10,139 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:56:10,139 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:56:10,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:56:10,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:56:10,140 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:56:10,140 INFO L87 Difference]: Start difference. First operand 80 states and 125 transitions. Second operand 3 states. [2018-09-30 10:56:10,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:56:10,431 INFO L93 Difference]: Finished difference Result 164 states and 257 transitions. [2018-09-30 10:56:10,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:56:10,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-09-30 10:56:10,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:56:10,436 INFO L225 Difference]: With dead ends: 164 [2018-09-30 10:56:10,436 INFO L226 Difference]: Without dead ends: 85 [2018-09-30 10:56:10,436 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 10:56:10,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-30 10:56:10,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-30 10:56:10,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-30 10:56:10,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2018-09-30 10:56:10,453 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 41 [2018-09-30 10:56:10,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:56:10,453 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2018-09-30 10:56:10,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:56:10,454 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2018-09-30 10:56:10,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-30 10:56:10,459 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:56:10,459 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 10:56:10,460 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:56:10,460 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:56:10,460 INFO L82 PathProgramCache]: Analyzing trace with hash -2015268825, now seen corresponding path program 1 times [2018-09-30 10:56:10,460 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:56:10,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:56:10,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:10,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:56:10,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:10,474 ERROR L236 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-09-30 10:56:10,474 INFO L259 seRefinementStrategy]: Advancing trace checker [2018-09-30 10:56:10,474 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 10:56:10,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:56:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:56:10,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:56:10,695 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 10:56:10,718 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:56:10,718 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:56:10,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:56:10,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:56:10,719 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:56:10,719 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand 3 states. [2018-09-30 10:56:11,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:56:11,015 INFO L93 Difference]: Finished difference Result 246 states and 370 transitions. [2018-09-30 10:56:11,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:56:11,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-09-30 10:56:11,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:56:11,018 INFO L225 Difference]: With dead ends: 246 [2018-09-30 10:56:11,019 INFO L226 Difference]: Without dead ends: 162 [2018-09-30 10:56:11,019 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 10:56:11,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-09-30 10:56:11,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-09-30 10:56:11,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-09-30 10:56:11,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2018-09-30 10:56:11,048 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 234 transitions. Word has length 44 [2018-09-30 10:56:11,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:56:11,048 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 234 transitions. [2018-09-30 10:56:11,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:56:11,049 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 234 transitions. [2018-09-30 10:56:11,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-30 10:56:11,051 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:56:11,051 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 10:56:11,051 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:56:11,051 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:56:11,052 INFO L82 PathProgramCache]: Analyzing trace with hash -688187521, now seen corresponding path program 1 times [2018-09-30 10:56:11,052 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:56:11,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:56:11,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:11,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:56:11,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:56:11,118 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 10:56:11,119 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:56:11,119 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:56:11,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:56:11,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:56:11,121 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:56:11,121 INFO L87 Difference]: Start difference. First operand 162 states and 234 transitions. Second operand 3 states. [2018-09-30 10:56:11,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:56:11,793 INFO L93 Difference]: Finished difference Result 250 states and 366 transitions. [2018-09-30 10:56:11,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:56:11,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-09-30 10:56:11,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:56:11,795 INFO L225 Difference]: With dead ends: 250 [2018-09-30 10:56:11,795 INFO L226 Difference]: Without dead ends: 166 [2018-09-30 10:56:11,796 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 10:56:11,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-09-30 10:56:11,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-09-30 10:56:11,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-09-30 10:56:11,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 238 transitions. [2018-09-30 10:56:11,836 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 238 transitions. Word has length 47 [2018-09-30 10:56:11,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:56:11,836 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 238 transitions. [2018-09-30 10:56:11,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:56:11,837 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 238 transitions. [2018-09-30 10:56:11,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-30 10:56:11,838 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:56:11,838 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 10:56:11,841 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:56:11,841 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:56:11,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1326956629, now seen corresponding path program 1 times [2018-09-30 10:56:11,841 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:56:11,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:56:11,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:11,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:56:11,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:56:11,980 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 10:56:11,980 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:56:11,980 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 10:56:11,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:56:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:56:12,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:56:12,717 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 10:56:12,738 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 10:56:12,738 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-09-30 10:56:12,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:56:12,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:56:12,739 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:56:12,739 INFO L87 Difference]: Start difference. First operand 166 states and 238 transitions. Second operand 5 states. [2018-09-30 10:56:15,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:56:15,760 INFO L93 Difference]: Finished difference Result 598 states and 860 transitions. [2018-09-30 10:56:15,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 10:56:15,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-09-30 10:56:15,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:56:15,763 INFO L225 Difference]: With dead ends: 598 [2018-09-30 10:56:15,763 INFO L226 Difference]: Without dead ends: 406 [2018-09-30 10:56:15,764 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:56:15,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-09-30 10:56:15,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 240. [2018-09-30 10:56:15,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-09-30 10:56:15,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 333 transitions. [2018-09-30 10:56:15,799 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 333 transitions. Word has length 48 [2018-09-30 10:56:15,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:56:15,799 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 333 transitions. [2018-09-30 10:56:15,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:56:15,800 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 333 transitions. [2018-09-30 10:56:15,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-30 10:56:15,801 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:56:15,801 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 10:56:15,802 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:56:15,802 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:56:15,802 INFO L82 PathProgramCache]: Analyzing trace with hash 2115677753, now seen corresponding path program 1 times [2018-09-30 10:56:15,802 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:56:15,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:56:15,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:15,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:56:15,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:56:15,900 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 10:56:15,901 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:56:15,901 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:56:15,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:56:15,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:56:15,902 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:56:15,902 INFO L87 Difference]: Start difference. First operand 240 states and 333 transitions. Second operand 3 states. [2018-09-30 10:56:16,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:56:16,320 INFO L93 Difference]: Finished difference Result 399 states and 560 transitions. [2018-09-30 10:56:16,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:56:16,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-09-30 10:56:16,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:56:16,325 INFO L225 Difference]: With dead ends: 399 [2018-09-30 10:56:16,325 INFO L226 Difference]: Without dead ends: 239 [2018-09-30 10:56:16,326 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 10:56:16,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-09-30 10:56:16,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-09-30 10:56:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-09-30 10:56:16,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 329 transitions. [2018-09-30 10:56:16,353 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 329 transitions. Word has length 60 [2018-09-30 10:56:16,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:56:16,353 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 329 transitions. [2018-09-30 10:56:16,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:56:16,353 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 329 transitions. [2018-09-30 10:56:16,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-30 10:56:16,354 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:56:16,355 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 10:56:16,355 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:56:16,355 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:56:16,355 INFO L82 PathProgramCache]: Analyzing trace with hash 227864519, now seen corresponding path program 1 times [2018-09-30 10:56:16,355 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:56:16,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:56:16,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:16,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:56:16,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:56:16,474 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 10:56:16,475 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:56:16,475 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:56:16,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:56:16,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:56:16,478 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:56:16,478 INFO L87 Difference]: Start difference. First operand 239 states and 329 transitions. Second operand 3 states. [2018-09-30 10:56:16,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:56:16,915 INFO L93 Difference]: Finished difference Result 470 states and 649 transitions. [2018-09-30 10:56:16,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:56:16,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-09-30 10:56:16,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:56:16,923 INFO L225 Difference]: With dead ends: 470 [2018-09-30 10:56:16,923 INFO L226 Difference]: Without dead ends: 237 [2018-09-30 10:56:16,924 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 10:56:16,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-09-30 10:56:16,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-09-30 10:56:16,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-30 10:56:16,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 319 transitions. [2018-09-30 10:56:16,949 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 319 transitions. Word has length 65 [2018-09-30 10:56:16,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:56:16,950 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 319 transitions. [2018-09-30 10:56:16,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:56:16,950 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 319 transitions. [2018-09-30 10:56:16,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-30 10:56:16,951 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:56:16,951 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 10:56:16,951 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:56:16,951 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:56:16,952 INFO L82 PathProgramCache]: Analyzing trace with hash -242141821, now seen corresponding path program 1 times [2018-09-30 10:56:16,952 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:56:16,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:56:16,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:16,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:56:16,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:56:17,033 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 10:56:17,034 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:56:17,034 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:56:17,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:56:17,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:56:17,034 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:56:17,035 INFO L87 Difference]: Start difference. First operand 237 states and 319 transitions. Second operand 3 states. [2018-09-30 10:56:17,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:56:17,302 INFO L93 Difference]: Finished difference Result 465 states and 628 transitions. [2018-09-30 10:56:17,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:56:17,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-09-30 10:56:17,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:56:17,304 INFO L225 Difference]: With dead ends: 465 [2018-09-30 10:56:17,304 INFO L226 Difference]: Without dead ends: 235 [2018-09-30 10:56:17,305 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 10:56:17,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-09-30 10:56:17,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-09-30 10:56:17,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-09-30 10:56:17,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 309 transitions. [2018-09-30 10:56:17,329 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 309 transitions. Word has length 71 [2018-09-30 10:56:17,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:56:17,329 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 309 transitions. [2018-09-30 10:56:17,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:56:17,329 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 309 transitions. [2018-09-30 10:56:17,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-30 10:56:17,330 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:56:17,330 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 10:56:17,331 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:56:17,331 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:56:17,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1274982729, now seen corresponding path program 1 times [2018-09-30 10:56:17,331 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:56:17,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:56:17,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:17,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:56:17,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:56:17,406 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 10:56:17,406 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:56:17,406 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:56:17,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:56:17,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:56:17,407 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:56:17,407 INFO L87 Difference]: Start difference. First operand 235 states and 309 transitions. Second operand 3 states. [2018-09-30 10:56:17,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:56:17,694 INFO L93 Difference]: Finished difference Result 465 states and 615 transitions. [2018-09-30 10:56:17,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:56:17,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-09-30 10:56:17,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:56:17,697 INFO L225 Difference]: With dead ends: 465 [2018-09-30 10:56:17,697 INFO L226 Difference]: Without dead ends: 238 [2018-09-30 10:56:17,698 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 10:56:17,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-09-30 10:56:17,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-09-30 10:56:17,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-09-30 10:56:17,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 307 transitions. [2018-09-30 10:56:17,723 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 307 transitions. Word has length 78 [2018-09-30 10:56:17,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:56:17,723 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 307 transitions. [2018-09-30 10:56:17,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:56:17,724 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 307 transitions. [2018-09-30 10:56:17,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-30 10:56:17,724 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:56:17,725 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 10:56:17,725 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:56:17,725 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:56:17,725 INFO L82 PathProgramCache]: Analyzing trace with hash 409856557, now seen corresponding path program 1 times [2018-09-30 10:56:17,725 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:56:17,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:56:17,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:17,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:56:17,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:56:17,830 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 10:56:17,830 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:56:17,831 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:56:17,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:56:17,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:56:17,831 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:56:17,831 INFO L87 Difference]: Start difference. First operand 238 states and 307 transitions. Second operand 3 states. [2018-09-30 10:56:18,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:56:18,836 INFO L93 Difference]: Finished difference Result 498 states and 646 transitions. [2018-09-30 10:56:18,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:56:18,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-09-30 10:56:18,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:56:18,838 INFO L225 Difference]: With dead ends: 498 [2018-09-30 10:56:18,839 INFO L226 Difference]: Without dead ends: 268 [2018-09-30 10:56:18,839 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 10:56:18,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-09-30 10:56:18,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-09-30 10:56:18,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-09-30 10:56:18,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 337 transitions. [2018-09-30 10:56:18,864 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 337 transitions. Word has length 86 [2018-09-30 10:56:18,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:56:18,865 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 337 transitions. [2018-09-30 10:56:18,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:56:18,865 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 337 transitions. [2018-09-30 10:56:18,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-30 10:56:18,866 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:56:18,866 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 10:56:18,867 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:56:18,867 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:56:18,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1980925187, now seen corresponding path program 1 times [2018-09-30 10:56:18,867 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:56:18,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:56:18,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:18,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:56:18,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:56:18,963 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 10:56:18,963 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:56:18,964 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:56:18,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:56:18,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:56:18,964 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:56:18,964 INFO L87 Difference]: Start difference. First operand 268 states and 337 transitions. Second operand 3 states. [2018-09-30 10:56:19,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:56:19,883 INFO L93 Difference]: Finished difference Result 561 states and 712 transitions. [2018-09-30 10:56:19,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:56:19,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-09-30 10:56:19,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:56:19,885 INFO L225 Difference]: With dead ends: 561 [2018-09-30 10:56:19,886 INFO L226 Difference]: Without dead ends: 301 [2018-09-30 10:56:19,886 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 10:56:19,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-09-30 10:56:19,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-09-30 10:56:19,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-30 10:56:19,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 370 transitions. [2018-09-30 10:56:19,924 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 370 transitions. Word has length 96 [2018-09-30 10:56:19,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:56:19,925 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 370 transitions. [2018-09-30 10:56:19,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:56:19,925 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 370 transitions. [2018-09-30 10:56:19,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-09-30 10:56:19,926 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:56:19,927 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 10:56:19,928 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:56:19,928 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:56:19,928 INFO L82 PathProgramCache]: Analyzing trace with hash -93746115, now seen corresponding path program 1 times [2018-09-30 10:56:19,928 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:56:19,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:56:19,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:19,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:56:19,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:56:20,062 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 10:56:20,062 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:56:20,062 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:56:20,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:56:20,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:56:20,065 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:56:20,065 INFO L87 Difference]: Start difference. First operand 301 states and 370 transitions. Second operand 3 states. [2018-09-30 10:56:20,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:56:20,221 INFO L93 Difference]: Finished difference Result 397 states and 491 transitions. [2018-09-30 10:56:20,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:56:20,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-09-30 10:56:20,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:56:20,224 INFO L225 Difference]: With dead ends: 397 [2018-09-30 10:56:20,224 INFO L226 Difference]: Without dead ends: 395 [2018-09-30 10:56:20,224 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 10:56:20,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-09-30 10:56:20,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-09-30 10:56:20,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-09-30 10:56:20,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 489 transitions. [2018-09-30 10:56:20,264 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 489 transitions. Word has length 107 [2018-09-30 10:56:20,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:56:20,265 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 489 transitions. [2018-09-30 10:56:20,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:56:20,265 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 489 transitions. [2018-09-30 10:56:20,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-30 10:56:20,267 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:56:20,267 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 10:56:20,267 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:56:20,267 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:56:20,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1780977529, now seen corresponding path program 1 times [2018-09-30 10:56:20,268 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:56:20,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:56:20,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:20,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:56:20,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:20,284 ERROR L236 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-09-30 10:56:20,285 INFO L259 seRefinementStrategy]: Advancing trace checker [2018-09-30 10:56:20,285 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 10:56:20,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:56:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:56:20,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:56:20,665 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 10:56:20,689 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:56:20,689 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:56:20,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:56:20,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:56:20,690 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:56:20,690 INFO L87 Difference]: Start difference. First operand 395 states and 489 transitions. Second operand 3 states. [2018-09-30 10:56:20,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:56:20,882 INFO L93 Difference]: Finished difference Result 782 states and 969 transitions. [2018-09-30 10:56:20,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:56:20,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2018-09-30 10:56:20,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:56:20,884 INFO L225 Difference]: With dead ends: 782 [2018-09-30 10:56:20,884 INFO L226 Difference]: Without dead ends: 395 [2018-09-30 10:56:20,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:56:20,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-09-30 10:56:20,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-09-30 10:56:20,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-09-30 10:56:20,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 466 transitions. [2018-09-30 10:56:20,939 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 466 transitions. Word has length 136 [2018-09-30 10:56:20,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:56:20,940 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 466 transitions. [2018-09-30 10:56:20,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:56:20,940 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 466 transitions. [2018-09-30 10:56:20,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-30 10:56:20,943 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:56:20,943 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 10:56:20,943 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:56:20,944 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:56:20,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1988836963, now seen corresponding path program 1 times [2018-09-30 10:56:20,944 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:56:20,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:56:20,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:20,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:56:20,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:56:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:56:21,207 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 10:56:21,207 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:56:21,207 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 10:56:21,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:56:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:56:21,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:56:21,428 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 10:56:21,449 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:56:21,450 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-09-30 10:56:21,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:56:21,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:56:21,450 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:56:21,450 INFO L87 Difference]: Start difference. First operand 395 states and 466 transitions. Second operand 4 states. [2018-09-30 10:56:21,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:56:21,641 INFO L93 Difference]: Finished difference Result 629 states and 744 transitions. [2018-09-30 10:56:21,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 10:56:21,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-09-30 10:56:21,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:56:21,642 INFO L225 Difference]: With dead ends: 629 [2018-09-30 10:56:21,642 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 10:56:21,643 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:56:21,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 10:56:21,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 10:56:21,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 10:56:21,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 10:56:21,644 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2018-09-30 10:56:21,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:56:21,644 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 10:56:21,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:56:21,645 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 10:56:21,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 10:56:21,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 10:56:21,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:21,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-30 10:56:22,944 WARN L178 SmtUtils]: Spent 968.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2018-09-30 10:56:23,149 WARN L178 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-30 10:56:24,106 WARN L178 SmtUtils]: Spent 954.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-09-30 10:56:24,225 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-09-30 10:56:24,626 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2018-09-30 10:56:24,933 WARN L178 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-09-30 10:56:25,036 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-30 10:56:25,162 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-30 10:56:25,305 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-09-30 10:56:25,411 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-30 10:56:25,529 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-09-30 10:56:25,616 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 10:56:25,616 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 10:56:25,617 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 10:56:25,617 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 10:56:25,617 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 3 481) no Hoare annotation was computed. [2018-09-30 10:56:25,617 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 3 481) no Hoare annotation was computed. [2018-09-30 10:56:25,618 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 10:56:25,618 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 10:56:25,618 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 10:56:25,618 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 10:56:25,618 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 10:56:25,618 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 10:56:25,619 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 10:56:25,619 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 3 481) no Hoare annotation was computed. [2018-09-30 10:56:25,619 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 10:56:25,619 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 480) no Hoare annotation was computed. [2018-09-30 10:56:25,619 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 10:56:25,619 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 10:56:25,620 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 10:56:25,620 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 10:56:25,620 INFO L422 ceAbstractionStarter]: At program point L472(lines 472 479) the Hoare annotation is: false [2018-09-30 10:56:25,620 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 10:56:25,620 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 10:56:25,638 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 10:56:25 BoogieIcfgContainer [2018-09-30 10:56:25,638 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:56:25,639 INFO L168 Benchmark]: Toolchain (without parser) took 19805.01 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 145.2 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 261.4 MB). Peak memory consumption was 406.7 MB. Max. memory is 7.1 GB. [2018-09-30 10:56:25,641 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:56:25,641 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:56:25,642 INFO L168 Benchmark]: Boogie Preprocessor took 59.36 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:56:25,642 INFO L168 Benchmark]: RCFGBuilder took 659.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 10:56:25,643 INFO L168 Benchmark]: TraceAbstraction took 19015.10 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 145.2 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 229.7 MB). Peak memory consumption was 375.0 MB. Max. memory is 7.1 GB. [2018-09-30 10:56:25,648 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.36 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 659.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 19015.10 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 145.2 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 229.7 MB). Peak memory consumption was 375.0 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, 18.9s OverallTime, 18 OverallIterations, 19 TraceHistogramMax, 10.8s AutomataDifference, 0.0s DeadEndRemovalTime, 3.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 463 SDtfs, 167 SDslu, 186 SDs, 0 SdLazy, 670 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s 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.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s 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_10-56-25-673.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_10-56-25-673.csv Received shutdown request...