java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:42:01,943 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:42:01,945 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:42:01,956 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:42:01,957 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:42:01,958 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:42:01,959 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:42:01,961 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:42:01,962 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:42:01,963 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:42:01,964 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:42:01,964 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:42:01,965 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:42:01,966 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:42:01,967 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:42:01,968 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:42:01,969 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:42:01,971 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:42:01,973 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:42:01,975 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:42:01,976 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:42:01,977 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:42:01,981 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:42:01,981 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:42:01,982 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:42:01,983 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:42:01,984 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:42:01,984 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:42:01,985 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:42:01,986 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:42:01,987 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:42:01,987 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:42:01,988 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:42:01,988 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:42:01,989 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:42:01,989 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:42:01,990 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:42:02,002 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:42:02,003 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:42:02,003 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:42:02,003 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:42:02,004 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:42:02,004 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:42:02,004 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:42:02,004 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:42:02,004 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:42:02,005 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:42:02,005 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:42:02,005 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:42:02,005 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:42:02,005 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:42:02,006 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:42:02,006 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:42:02,006 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:42:02,006 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:42:02,007 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:42:02,007 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:42:02,007 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:42:02,007 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:42:02,007 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:42:02,008 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:42:02,008 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:42:02,008 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:42:02,008 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:42:02,008 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:42:02,009 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:42:02,009 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:42:02,009 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:42:02,009 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:42:02,009 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:42:02,010 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:42:02,010 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:42:02,010 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:42:02,010 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:42:02,010 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:42:02,011 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:42:02,011 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:42:02,011 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:42:02,048 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:42:02,061 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:42:02,064 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:42:02,066 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:42:02,067 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:42:02,068 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl [2018-12-03 16:42:02,068 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl' [2018-12-03 16:42:02,131 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:42:02,133 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:42:02,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:42:02,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:42:02,134 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:42:02,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:02" (1/1) ... [2018-12-03 16:42:02,164 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:02" (1/1) ... [2018-12-03 16:42:02,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:42:02,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:42:02,175 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:42:02,175 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:42:02,188 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:02" (1/1) ... [2018-12-03 16:42:02,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:02" (1/1) ... [2018-12-03 16:42:02,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:02" (1/1) ... [2018-12-03 16:42:02,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:02" (1/1) ... [2018-12-03 16:42:02,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:02" (1/1) ... [2018-12-03 16:42:02,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:02" (1/1) ... [2018-12-03 16:42:02,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:02" (1/1) ... [2018-12-03 16:42:02,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:42:02,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:42:02,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:42:02,234 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:42:02,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:02" (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-12-03 16:42:02,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:42:02,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:42:02,880 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:42:02,880 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:42:02,881 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:42:02 BoogieIcfgContainer [2018-12-03 16:42:02,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:42:02,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:42:02,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:42:02,885 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:42:02,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:02" (1/2) ... [2018-12-03 16:42:02,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26495c0 and model type pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:42:02, skipping insertion in model container [2018-12-03 16:42:02,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:42:02" (2/2) ... [2018-12-03 16:42:02,889 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl [2018-12-03 16:42:02,898 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:42:02,906 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:42:02,924 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:42:02,957 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:42:02,957 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:42:02,958 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:42:02,958 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:42:02,958 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:42:02,958 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:42:02,958 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:42:02,958 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:42:02,974 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-12-03 16:42:02,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:42:02,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:02,981 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:02,984 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:02,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:02,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1823027031, now seen corresponding path program 1 times [2018-12-03 16:42:02,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:03,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:03,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:03,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:03,051 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:03,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:03,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:03,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:03,220 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:03,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:03,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:03,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:03,238 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-12-03 16:42:03,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:03,278 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2018-12-03 16:42:03,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:03,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 16:42:03,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:03,291 INFO L225 Difference]: With dead ends: 45 [2018-12-03 16:42:03,291 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:42:03,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:03,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:42:03,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-12-03 16:42:03,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 16:42:03,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-03 16:42:03,337 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2018-12-03 16:42:03,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:03,338 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-03 16:42:03,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:03,338 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-03 16:42:03,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:42:03,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:03,339 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:03,339 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:03,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:03,340 INFO L82 PathProgramCache]: Analyzing trace with hash 2081192469, now seen corresponding path program 1 times [2018-12-03 16:42:03,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:03,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:03,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:03,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:03,344 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:03,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:03,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:03,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:03,491 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:03,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:03,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:03,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:03,494 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 3 states. [2018-12-03 16:42:03,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:03,549 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2018-12-03 16:42:03,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:03,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 16:42:03,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:03,551 INFO L225 Difference]: With dead ends: 79 [2018-12-03 16:42:03,552 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 16:42:03,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:03,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 16:42:03,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-12-03 16:42:03,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 16:42:03,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2018-12-03 16:42:03,568 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 14 [2018-12-03 16:42:03,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:03,569 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2018-12-03 16:42:03,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:03,569 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2018-12-03 16:42:03,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:42:03,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:03,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:03,570 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:03,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:03,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1271845843, now seen corresponding path program 1 times [2018-12-03 16:42:03,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:03,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:03,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:03,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:03,574 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:03,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:03,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:03,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:42:03,808 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:03,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:42:03,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:42:03,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:42:03,810 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand 4 states. [2018-12-03 16:42:04,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:04,006 INFO L93 Difference]: Finished difference Result 109 states and 147 transitions. [2018-12-03 16:42:04,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:42:04,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-03 16:42:04,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:04,015 INFO L225 Difference]: With dead ends: 109 [2018-12-03 16:42:04,015 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 16:42:04,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:42:04,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 16:42:04,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 59. [2018-12-03 16:42:04,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 16:42:04,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2018-12-03 16:42:04,058 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 14 [2018-12-03 16:42:04,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:04,058 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2018-12-03 16:42:04,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:42:04,059 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2018-12-03 16:42:04,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:42:04,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:04,060 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:04,060 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:04,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:04,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1271905425, now seen corresponding path program 1 times [2018-12-03 16:42:04,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:04,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:04,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:04,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:04,064 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:04,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:04,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:04,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:04,168 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:04,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:04,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:04,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:04,170 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand 3 states. [2018-12-03 16:42:04,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:04,267 INFO L93 Difference]: Finished difference Result 143 states and 190 transitions. [2018-12-03 16:42:04,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:04,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 16:42:04,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:04,269 INFO L225 Difference]: With dead ends: 143 [2018-12-03 16:42:04,269 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 16:42:04,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:04,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 16:42:04,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 16:42:04,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 16:42:04,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2018-12-03 16:42:04,308 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 14 [2018-12-03 16:42:04,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:04,309 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2018-12-03 16:42:04,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:04,309 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2018-12-03 16:42:04,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 16:42:04,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:04,310 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:04,311 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:04,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:04,311 INFO L82 PathProgramCache]: Analyzing trace with hash -602166477, now seen corresponding path program 1 times [2018-12-03 16:42:04,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:04,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:04,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:04,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:04,314 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:04,459 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:04,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:04,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:04,459 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:04,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:04,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:04,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:04,461 INFO L87 Difference]: Start difference. First operand 85 states and 111 transitions. Second operand 3 states. [2018-12-03 16:42:04,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:04,532 INFO L93 Difference]: Finished difference Result 249 states and 327 transitions. [2018-12-03 16:42:04,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:04,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-03 16:42:04,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:04,535 INFO L225 Difference]: With dead ends: 249 [2018-12-03 16:42:04,535 INFO L226 Difference]: Without dead ends: 167 [2018-12-03 16:42:04,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:04,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-03 16:42:04,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-12-03 16:42:04,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 16:42:04,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 212 transitions. [2018-12-03 16:42:04,575 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 212 transitions. Word has length 26 [2018-12-03 16:42:04,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:04,575 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 212 transitions. [2018-12-03 16:42:04,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:04,576 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 212 transitions. [2018-12-03 16:42:04,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 16:42:04,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:04,578 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:04,578 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:04,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:04,578 INFO L82 PathProgramCache]: Analyzing trace with hash -209139467, now seen corresponding path program 1 times [2018-12-03 16:42:04,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:04,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:04,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:04,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:04,581 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:04,758 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 16:42:04,762 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:04,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:04,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:04,762 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:04,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:04,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:04,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:04,764 INFO L87 Difference]: Start difference. First operand 165 states and 212 transitions. Second operand 3 states. [2018-12-03 16:42:04,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:04,885 INFO L93 Difference]: Finished difference Result 489 states and 630 transitions. [2018-12-03 16:42:04,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:04,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-03 16:42:04,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:04,888 INFO L225 Difference]: With dead ends: 489 [2018-12-03 16:42:04,889 INFO L226 Difference]: Without dead ends: 327 [2018-12-03 16:42:04,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:04,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-03 16:42:04,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2018-12-03 16:42:04,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-12-03 16:42:04,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 408 transitions. [2018-12-03 16:42:04,983 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 408 transitions. Word has length 26 [2018-12-03 16:42:04,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:04,983 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 408 transitions. [2018-12-03 16:42:04,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:04,983 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 408 transitions. [2018-12-03 16:42:04,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 16:42:04,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:04,986 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:04,986 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:04,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:04,987 INFO L82 PathProgramCache]: Analyzing trace with hash -266397769, now seen corresponding path program 1 times [2018-12-03 16:42:04,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:04,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:04,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:04,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:04,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:05,454 WARN L180 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-12-03 16:42:05,555 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:05,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:05,555 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:42:05,556 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-03 16:42:05,558 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50] [2018-12-03 16:42:05,599 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:42:05,600 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:42:06,840 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:42:06,842 INFO L272 AbstractInterpreter]: Visited 20 different actions 150 times. Merged at 19 different actions 95 times. Widened at 12 different actions 12 times. Found 34 fixpoints after 14 different actions. Largest state had 0 variables. [2018-12-03 16:42:06,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:06,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:42:06,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:06,889 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:42:06,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:06,909 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:42:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:07,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:42:07,096 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 16:42:07,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:42:07,227 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 16:42:07,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:42:07,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2018-12-03 16:42:07,255 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:42:07,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:42:07,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:42:07,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:42:07,257 INFO L87 Difference]: Start difference. First operand 325 states and 408 transitions. Second operand 8 states. [2018-12-03 16:42:07,680 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 16:42:08,185 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-03 16:42:08,697 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 16:42:08,992 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-03 16:42:09,293 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 16:42:09,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:09,954 INFO L93 Difference]: Finished difference Result 723 states and 911 transitions. [2018-12-03 16:42:09,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:42:09,955 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-12-03 16:42:09,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:09,958 INFO L225 Difference]: With dead ends: 723 [2018-12-03 16:42:09,958 INFO L226 Difference]: Without dead ends: 497 [2018-12-03 16:42:09,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:42:09,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2018-12-03 16:42:10,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 413. [2018-12-03 16:42:10,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-12-03 16:42:10,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 500 transitions. [2018-12-03 16:42:10,040 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 500 transitions. Word has length 26 [2018-12-03 16:42:10,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:10,040 INFO L480 AbstractCegarLoop]: Abstraction has 413 states and 500 transitions. [2018-12-03 16:42:10,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:42:10,040 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 500 transitions. [2018-12-03 16:42:10,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 16:42:10,044 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:10,044 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 16:42:10,044 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:10,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:10,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1932160773, now seen corresponding path program 2 times [2018-12-03 16:42:10,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:10,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:10,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:10,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:10,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:10,130 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-03 16:42:10,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:10,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:10,131 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:10,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:10,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:10,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:10,132 INFO L87 Difference]: Start difference. First operand 413 states and 500 transitions. Second operand 3 states. [2018-12-03 16:42:10,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:10,250 INFO L93 Difference]: Finished difference Result 769 states and 934 transitions. [2018-12-03 16:42:10,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:10,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 16:42:10,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:10,253 INFO L225 Difference]: With dead ends: 769 [2018-12-03 16:42:10,253 INFO L226 Difference]: Without dead ends: 359 [2018-12-03 16:42:10,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:10,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-12-03 16:42:10,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 309. [2018-12-03 16:42:10,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-12-03 16:42:10,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 360 transitions. [2018-12-03 16:42:10,318 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 360 transitions. Word has length 50 [2018-12-03 16:42:10,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:10,319 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 360 transitions. [2018-12-03 16:42:10,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:10,319 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 360 transitions. [2018-12-03 16:42:10,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 16:42:10,321 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:10,321 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 16:42:10,321 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:10,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:10,322 INFO L82 PathProgramCache]: Analyzing trace with hash -238903015, now seen corresponding path program 3 times [2018-12-03 16:42:10,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:10,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:10,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:42:10,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:10,324 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:10,533 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 16:42:10,540 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-03 16:42:10,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:10,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:10,541 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:10,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:10,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:10,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:10,542 INFO L87 Difference]: Start difference. First operand 309 states and 360 transitions. Second operand 3 states. [2018-12-03 16:42:10,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:10,578 INFO L93 Difference]: Finished difference Result 331 states and 383 transitions. [2018-12-03 16:42:10,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:10,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-12-03 16:42:10,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:10,580 INFO L225 Difference]: With dead ends: 331 [2018-12-03 16:42:10,580 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 16:42:10,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:10,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 16:42:10,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 16:42:10,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 16:42:10,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 16:42:10,582 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2018-12-03 16:42:10,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:10,583 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 16:42:10,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:10,583 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 16:42:10,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 16:42:10,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 16:42:10,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:10,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:10,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:10,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:42:10,873 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-12-03 16:42:11,016 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-12-03 16:42:11,175 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2018-12-03 16:42:11,600 INFO L444 ceAbstractionStarter]: At program point L353(lines 353 360) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (= ~r1 0) (<= 1 ~mode4) (<= (div ~mode1 256) 0) (<= 1 ~mode1) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (not (= ~p4_old ~nomsg)) (< 0 (+ (div ~send4 256) 1))) [2018-12-03 16:42:11,600 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 74 389) no Hoare annotation was computed. [2018-12-03 16:42:11,601 INFO L444 ceAbstractionStarter]: At program point L316(lines 310 317) the Hoare annotation is: (and (= ~r1 0) (<= (div ~mode1 256) 0) (<= 1 ~mode1) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (< 0 (+ (div ~send4 256) 1)) (= ~mode4 (* 256 (div ~mode4 256)))) [2018-12-03 16:42:11,601 INFO L444 ceAbstractionStarter]: At program point L380(lines 380 387) the Hoare annotation is: false [2018-12-03 16:42:11,601 INFO L444 ceAbstractionStarter]: At program point L281(lines 281 291) the Hoare annotation is: (and (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (<= (div ~mode1 256) 0) (<= 1 ~mode1) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (< 0 (+ (div ~send4 256) 1)) (= ~mode4 (* 256 (div ~mode4 256)))) [2018-12-03 16:42:11,601 INFO L444 ceAbstractionStarter]: At program point L374(lines 374 381) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (<= ULTIMATE.start_check_~tmp~100 1) (<= 1 ~mode4) (= 0 (+ ~nomsg 1)) (not (= ~p4_old ~nomsg)) (< 0 (+ (div ~send4 256) 1)) (<= (div ~mode4 256) 0) (= ~r1 0) (<= (div ~mode1 256) 0) (<= 1 ~mode1) (<= ~send4 127) (<= 1 ULTIMATE.start_assert_~arg) (<= 1 ULTIMATE.start_check_~tmp~100)) [2018-12-03 16:42:11,602 INFO L444 ceAbstractionStarter]: At program point L339(lines 330 340) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (= ~r1 0) (<= (div ~mode1 256) 0) (<= 1 ~mode4) (<= 1 ~mode1) (not (= ~p4_new ~nomsg)) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (< 0 (+ (div ~send4 256) 1))) [2018-12-03 16:42:11,602 INFO L444 ceAbstractionStarter]: At program point L364(lines 359 365) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (= ~r1 0) (<= ULTIMATE.start_check_~tmp~100 1) (<= 1 ~mode4) (<= (div ~mode1 256) 0) (<= 1 ~mode1) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_check_~tmp~100) (not (= ~p4_old ~nomsg)) (< 0 (+ (div ~send4 256) 1))) [2018-12-03 16:42:11,602 INFO L444 ceAbstractionStarter]: At program point L296(lines 290 297) the Hoare annotation is: (and (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (<= (div ~mode1 256) 0) (<= 1 ~mode1) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (< 0 (+ (div ~send4 256) 1)) (= ~mode4 (* 256 (div ~mode4 256)))) [2018-12-03 16:42:11,603 INFO L444 ceAbstractionStarter]: At program point L261(lines 261 272) the Hoare annotation is: (let ((.cse4 (div ~mode4 256)) (.cse0 (= ~r1 0)) (.cse1 (div ~mode1 256)) (.cse2 (<= ~send4 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse5 (< 0 (+ (div ~send4 256) 1)))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 .cse1)) .cse2 .cse3 (= ~mode4 (* 256 .cse4)) .cse5) (and (<= .cse4 0) .cse0 (<= 1 ~mode4) (<= .cse1 0) (<= 1 ~mode1) .cse2 .cse3 (<= 1 ULTIMATE.start_check_~tmp~100) (not (= ~p4_old ~nomsg)) .cse5))) [2018-12-03 16:42:11,603 INFO L444 ceAbstractionStarter]: At program point L321(lines 321 331) the Hoare annotation is: (and (= ~r1 0) (<= (div ~mode1 256) 0) (<= 1 ~mode1) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (< 0 (+ (div ~send4 256) 1)) (= ~mode4 (* 256 (div ~mode4 256)))) [2018-12-03 16:42:11,603 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 74 389) no Hoare annotation was computed. [2018-12-03 16:42:11,603 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 74 389) no Hoare annotation was computed. [2018-12-03 16:42:11,604 INFO L444 ceAbstractionStarter]: At program point L276(lines 271 277) the Hoare annotation is: (and (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (<= (div ~mode1 256) 0) (<= 1 ~mode1) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (< 0 (+ (div ~send4 256) 1)) (= ~mode4 (* 256 (div ~mode4 256)))) [2018-12-03 16:42:11,604 INFO L444 ceAbstractionStarter]: At program point L301(lines 301 311) the Hoare annotation is: (and (= ~r1 0) (= ~mode3 (* 256 (div ~mode3 256))) (<= (div ~mode1 256) 0) (<= 1 ~mode1) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (< 0 (+ (div ~send4 256) 1)) (= ~mode4 (* 256 (div ~mode4 256)))) [2018-12-03 16:42:11,604 INFO L444 ceAbstractionStarter]: At program point L386(lines 254 386) the Hoare annotation is: (let ((.cse4 (div ~mode4 256)) (.cse0 (= ~r1 0)) (.cse1 (div ~mode1 256)) (.cse2 (<= ~send4 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse5 (< 0 (+ (div ~send4 256) 1)))) (or (and .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 .cse1)) .cse2 .cse3 (= ~mode4 (* 256 .cse4)) .cse5) (and (<= .cse4 0) .cse0 (<= 1 ~mode4) (<= .cse1 0) (<= 1 ~mode1) .cse2 .cse3 (<= 1 ULTIMATE.start_check_~tmp~100) (not (= ~p4_old ~nomsg)) .cse5))) [2018-12-03 16:42:11,604 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 388) no Hoare annotation was computed. [2018-12-03 16:42:11,625 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:42:11 BoogieIcfgContainer [2018-12-03 16:42:11,625 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:42:11,626 INFO L168 Benchmark]: Toolchain (without parser) took 9494.51 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 698.4 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -160.7 MB). Peak memory consumption was 537.7 MB. Max. memory is 7.1 GB. [2018-12-03 16:42:11,627 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:42:11,628 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:42:11,628 INFO L168 Benchmark]: Boogie Preprocessor took 59.08 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:42:11,629 INFO L168 Benchmark]: RCFGBuilder took 647.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-12-03 16:42:11,630 INFO L168 Benchmark]: TraceAbstraction took 8742.96 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 698.4 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -203.0 MB). Peak memory consumption was 495.4 MB. Max. memory is 7.1 GB. [2018-12-03 16:42:11,634 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.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.08 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 647.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8742.96 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 698.4 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -203.0 MB). Peak memory consumption was 495.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 388]: 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: 261]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1) || (((((((((~mode4 / 256 <= 0 && ~r1 == 0) && 1 <= ~mode4) && ~mode1 / 256 <= 0) && 1 <= ~mode1) && ~send4 <= 127) && 0 == ~nomsg + 1) && 1 <= check_~tmp~100) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1) || (((((((((~mode4 / 256 <= 0 && ~r1 == 0) && 1 <= ~mode4) && ~mode1 / 256 <= 0) && 1 <= ~mode1) && ~send4 <= 127) && 0 == ~nomsg + 1) && 1 <= check_~tmp~100) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) - InvariantResult [Line: 359]: Loop Invariant Derived loop invariant: (((((((((~mode4 / 256 <= 0 && ~r1 == 0) && check_~tmp~100 <= 1) && 1 <= ~mode4) && ~mode1 / 256 <= 0) && 1 <= ~mode1) && ~send4 <= 127) && 0 == ~nomsg + 1) && 1 <= check_~tmp~100) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1 - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: (((((~r1 == 0 && ~mode1 / 256 <= 0) && 1 <= ~mode1) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 < ~send4 / 256 + 1) && ~mode4 == 256 * (~mode4 / 256) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (((((((~mode4 / 256 <= 0 && ~r1 == 0) && 1 <= ~mode4) && ~mode1 / 256 <= 0) && 1 <= ~mode1) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1 - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: (((((((((((assert_~arg <= 1 && check_~tmp~100 <= 1) && 1 <= ~mode4) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode4 / 256 <= 0) && ~r1 == 0) && ~mode1 / 256 <= 0) && 1 <= ~mode1) && ~send4 <= 127) && 1 <= assert_~arg) && 1 <= check_~tmp~100 - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 / 256 <= 0) && 1 <= ~mode1) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 < ~send4 / 256 + 1) && ~mode4 == 256 * (~mode4 / 256) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 / 256 <= 0) && 1 <= ~mode1) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 < ~send4 / 256 + 1) && ~mode4 == 256 * (~mode4 / 256) - InvariantResult [Line: 330]: Loop Invariant Derived loop invariant: (((((((~mode4 / 256 <= 0 && ~r1 == 0) && ~mode1 / 256 <= 0) && 1 <= ~mode4) && 1 <= ~mode1) && !(~p4_new == ~nomsg)) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 < ~send4 / 256 + 1 - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: (((((~r1 == 0 && ~mode1 / 256 <= 0) && 1 <= ~mode1) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 < ~send4 / 256 + 1) && ~mode4 == 256 * (~mode4 / 256) - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 301]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 / 256 <= 0) && 1 <= ~mode1) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 < ~send4 / 256 + 1) && ~mode4 == 256 * (~mode4 / 256) - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 / 256 <= 0) && 1 <= ~mode1) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 < ~send4 / 256 + 1) && ~mode4 == 256 * (~mode4 / 256) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 8.6s OverallTime, 9 OverallIterations, 5 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 226 SDtfs, 204 SDslu, 181 SDs, 0 SdLazy, 157 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=413occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 190 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 37 NumberOfFragments, 573 HoareAnnotationTreeSize, 13 FomulaSimplifications, 1293 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 42 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 272 NumberOfCodeBlocks, 272 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 287 ConstructedInterpolants, 0 QuantifiedInterpolants, 33921 SizeOfPredicates, 7 NumberOfNonLiveVariables, 249 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 234/252 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...