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_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 19:18:27,146 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 19:18:27,148 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 19:18:27,164 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 19:18:27,165 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 19:18:27,166 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 19:18:27,167 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 19:18:27,172 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 19:18:27,174 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 19:18:27,174 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 19:18:27,178 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 19:18:27,178 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 19:18:27,179 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 19:18:27,181 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 19:18:27,184 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 19:18:27,185 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 19:18:27,186 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 19:18:27,188 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 19:18:27,190 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 19:18:27,192 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 19:18:27,193 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 19:18:27,194 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 19:18:27,197 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 19:18:27,197 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 19:18:27,197 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 19:18:27,198 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 19:18:27,199 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 19:18:27,200 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 19:18:27,201 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 19:18:27,202 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 19:18:27,202 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 19:18:27,204 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 19:18:27,204 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 19:18:27,205 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 19:18:27,206 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 19:18:27,207 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 19:18:27,208 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-03 19:18:27,233 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 19:18:27,233 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 19:18:27,234 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 19:18:27,235 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 19:18:27,235 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 19:18:27,235 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 19:18:27,235 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 19:18:27,235 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 19:18:27,236 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 19:18:27,236 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-03 19:18:27,236 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 19:18:27,236 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 19:18:27,236 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 19:18:27,237 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 19:18:27,237 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 19:18:27,237 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 19:18:27,238 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 19:18:27,238 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 19:18:27,238 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 19:18:27,238 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 19:18:27,238 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 19:18:27,239 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 19:18:27,239 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 19:18:27,239 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 19:18:27,239 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 19:18:27,239 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 19:18:27,240 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 19:18:27,240 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 19:18:27,240 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 19:18:27,240 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 19:18:27,241 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 19:18:27,241 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 19:18:27,241 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 19:18:27,241 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 19:18:27,241 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 19:18:27,242 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 19:18:27,242 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 19:18:27,242 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 19:18:27,242 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 19:18:27,242 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 19:18:27,276 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 19:18:27,289 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 19:18:27,295 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 19:18:27,297 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 19:18:27,298 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 19:18:27,298 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl [2018-12-03 19:18:27,299 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl' [2018-12-03 19:18:27,362 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 19:18:27,364 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 19:18:27,365 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 19:18:27,365 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 19:18:27,365 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 19:18:27,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:18:27" (1/1) ... [2018-12-03 19:18:27,398 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:18:27" (1/1) ... [2018-12-03 19:18:27,411 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 19:18:27,412 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 19:18:27,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 19:18:27,413 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 19:18:27,425 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:18:27" (1/1) ... [2018-12-03 19:18:27,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:18:27" (1/1) ... [2018-12-03 19:18:27,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:18:27" (1/1) ... [2018-12-03 19:18:27,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:18:27" (1/1) ... [2018-12-03 19:18:27,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:18:27" (1/1) ... [2018-12-03 19:18:27,467 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:18:27" (1/1) ... [2018-12-03 19:18:27,471 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:18:27" (1/1) ... [2018-12-03 19:18:27,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 19:18:27,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 19:18:27,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 19:18:27,485 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 19:18:27,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:18:27" (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 19:18:27,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 19:18:27,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 19:18:28,340 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 19:18:28,341 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 19:18:28,341 INFO L202 PluginConnector]: Adding new model pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:18:28 BoogieIcfgContainer [2018-12-03 19:18:28,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 19:18:28,343 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 19:18:28,343 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 19:18:28,348 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 19:18:28,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:18:27" (1/2) ... [2018-12-03 19:18:28,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792425ee and model type pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:18:28, skipping insertion in model container [2018-12-03 19:18:28,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:18:28" (2/2) ... [2018-12-03 19:18:28,352 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl [2018-12-03 19:18:28,363 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 19:18:28,374 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 19:18:28,394 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 19:18:28,438 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 19:18:28,438 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 19:18:28,439 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 19:18:28,439 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 19:18:28,439 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 19:18:28,439 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 19:18:28,439 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 19:18:28,439 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 19:18:28,461 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-12-03 19:18:28,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 19:18:28,472 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:28,474 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:18:28,484 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:28,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:28,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1242790345, now seen corresponding path program 1 times [2018-12-03 19:18:28,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:28,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:28,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:28,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:28,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:28,827 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 19:18:28,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:28,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:18:28,831 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:28,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:28,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:28,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:28,857 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2018-12-03 19:18:28,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:28,931 INFO L93 Difference]: Finished difference Result 60 states and 86 transitions. [2018-12-03 19:18:28,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:28,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-03 19:18:28,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:28,945 INFO L225 Difference]: With dead ends: 60 [2018-12-03 19:18:28,946 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 19:18:28,950 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 19:18:28,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 19:18:28,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-12-03 19:18:28,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 19:18:28,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 53 transitions. [2018-12-03 19:18:28,997 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 53 transitions. Word has length 19 [2018-12-03 19:18:28,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:28,997 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 53 transitions. [2018-12-03 19:18:28,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:28,998 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 53 transitions. [2018-12-03 19:18:28,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 19:18:28,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:28,999 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:18:28,999 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:29,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:29,000 INFO L82 PathProgramCache]: Analyzing trace with hash -345557557, now seen corresponding path program 1 times [2018-12-03 19:18:29,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:29,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:29,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:29,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:29,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:29,207 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 19:18:29,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:29,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:18:29,208 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:29,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:29,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:29,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:29,215 INFO L87 Difference]: Start difference. First operand 37 states and 53 transitions. Second operand 3 states. [2018-12-03 19:18:29,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:29,298 INFO L93 Difference]: Finished difference Result 109 states and 157 transitions. [2018-12-03 19:18:29,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:29,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-03 19:18:29,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:29,305 INFO L225 Difference]: With dead ends: 109 [2018-12-03 19:18:29,305 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 19:18:29,307 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 19:18:29,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 19:18:29,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-12-03 19:18:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-03 19:18:29,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 102 transitions. [2018-12-03 19:18:29,344 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 102 transitions. Word has length 19 [2018-12-03 19:18:29,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:29,344 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 102 transitions. [2018-12-03 19:18:29,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:29,349 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2018-12-03 19:18:29,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 19:18:29,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:29,350 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:18:29,351 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:29,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:29,351 INFO L82 PathProgramCache]: Analyzing trace with hash -932363571, now seen corresponding path program 1 times [2018-12-03 19:18:29,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:29,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:29,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:29,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:29,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:29,511 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 19:18:29,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:29,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:18:29,512 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:29,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:29,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:29,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:29,513 INFO L87 Difference]: Start difference. First operand 71 states and 102 transitions. Second operand 3 states. [2018-12-03 19:18:29,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:29,582 INFO L93 Difference]: Finished difference Result 211 states and 304 transitions. [2018-12-03 19:18:29,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:29,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-03 19:18:29,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:29,592 INFO L225 Difference]: With dead ends: 211 [2018-12-03 19:18:29,592 INFO L226 Difference]: Without dead ends: 141 [2018-12-03 19:18:29,594 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 19:18:29,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-03 19:18:29,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-12-03 19:18:29,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-03 19:18:29,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 198 transitions. [2018-12-03 19:18:29,647 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 198 transitions. Word has length 19 [2018-12-03 19:18:29,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:29,648 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 198 transitions. [2018-12-03 19:18:29,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:29,648 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 198 transitions. [2018-12-03 19:18:29,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 19:18:29,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:29,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:18:29,652 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:29,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:29,653 INFO L82 PathProgramCache]: Analyzing trace with hash -252305201, now seen corresponding path program 1 times [2018-12-03 19:18:29,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:29,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:29,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:29,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:29,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:29,768 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 19:18:29,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:29,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:18:29,769 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:29,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:29,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:29,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:29,771 INFO L87 Difference]: Start difference. First operand 139 states and 198 transitions. Second operand 3 states. [2018-12-03 19:18:29,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:29,858 INFO L93 Difference]: Finished difference Result 349 states and 498 transitions. [2018-12-03 19:18:29,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:29,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-03 19:18:29,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:29,861 INFO L225 Difference]: With dead ends: 349 [2018-12-03 19:18:29,861 INFO L226 Difference]: Without dead ends: 211 [2018-12-03 19:18:29,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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 19:18:29,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-03 19:18:29,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2018-12-03 19:18:29,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-12-03 19:18:29,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 292 transitions. [2018-12-03 19:18:29,900 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 292 transitions. Word has length 19 [2018-12-03 19:18:29,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:29,900 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 292 transitions. [2018-12-03 19:18:29,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:29,901 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 292 transitions. [2018-12-03 19:18:29,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 19:18:29,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:29,902 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:18:29,902 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:29,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:29,902 INFO L82 PathProgramCache]: Analyzing trace with hash -250458159, now seen corresponding path program 1 times [2018-12-03 19:18:29,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:29,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:29,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:29,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:29,906 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:30,017 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 19:18:30,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:30,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 19:18:30,018 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:30,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 19:18:30,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 19:18:30,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 19:18:30,019 INFO L87 Difference]: Start difference. First operand 209 states and 292 transitions. Second operand 4 states. [2018-12-03 19:18:30,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:30,223 INFO L93 Difference]: Finished difference Result 377 states and 522 transitions. [2018-12-03 19:18:30,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 19:18:30,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-12-03 19:18:30,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:30,227 INFO L225 Difference]: With dead ends: 377 [2018-12-03 19:18:30,227 INFO L226 Difference]: Without dead ends: 375 [2018-12-03 19:18:30,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 19:18:30,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-12-03 19:18:30,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 225. [2018-12-03 19:18:30,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-12-03 19:18:30,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 304 transitions. [2018-12-03 19:18:30,313 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 304 transitions. Word has length 19 [2018-12-03 19:18:30,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:30,313 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 304 transitions. [2018-12-03 19:18:30,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 19:18:30,316 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 304 transitions. [2018-12-03 19:18:30,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 19:18:30,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:30,318 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:18:30,319 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:30,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:30,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1238295361, now seen corresponding path program 1 times [2018-12-03 19:18:30,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:30,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:30,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:30,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:30,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:30,589 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 19:18:30,594 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:18:30,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:30,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:18:30,595 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:30,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:30,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:30,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:30,596 INFO L87 Difference]: Start difference. First operand 225 states and 304 transitions. Second operand 3 states. [2018-12-03 19:18:30,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:30,728 INFO L93 Difference]: Finished difference Result 669 states and 906 transitions. [2018-12-03 19:18:30,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:30,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-03 19:18:30,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:30,733 INFO L225 Difference]: With dead ends: 669 [2018-12-03 19:18:30,733 INFO L226 Difference]: Without dead ends: 447 [2018-12-03 19:18:30,738 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 19:18:30,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-12-03 19:18:30,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 445. [2018-12-03 19:18:30,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-12-03 19:18:30,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 592 transitions. [2018-12-03 19:18:30,831 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 592 transitions. Word has length 36 [2018-12-03 19:18:30,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:30,831 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 592 transitions. [2018-12-03 19:18:30,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:30,832 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 592 transitions. [2018-12-03 19:18:30,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 19:18:30,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:30,837 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:18:30,837 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:30,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:30,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1776808257, now seen corresponding path program 1 times [2018-12-03 19:18:30,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:30,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:30,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:30,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:30,844 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:31,017 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:18:31,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:31,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:18:31,018 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:31,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:31,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:31,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:31,019 INFO L87 Difference]: Start difference. First operand 445 states and 592 transitions. Second operand 3 states. [2018-12-03 19:18:31,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:31,247 INFO L93 Difference]: Finished difference Result 1329 states and 1770 transitions. [2018-12-03 19:18:31,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:31,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-03 19:18:31,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:31,254 INFO L225 Difference]: With dead ends: 1329 [2018-12-03 19:18:31,254 INFO L226 Difference]: Without dead ends: 887 [2018-12-03 19:18:31,260 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 19:18:31,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-12-03 19:18:31,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2018-12-03 19:18:31,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2018-12-03 19:18:31,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1156 transitions. [2018-12-03 19:18:31,413 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1156 transitions. Word has length 36 [2018-12-03 19:18:31,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:31,414 INFO L480 AbstractCegarLoop]: Abstraction has 885 states and 1156 transitions. [2018-12-03 19:18:31,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:31,414 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1156 transitions. [2018-12-03 19:18:31,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 19:18:31,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:31,425 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:18:31,425 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:31,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:31,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1817094461, now seen corresponding path program 1 times [2018-12-03 19:18:31,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:31,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:31,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:31,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:31,428 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:18:31,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:18:31,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:18:31,563 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:18:31,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:18:31,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:18:31,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:18:31,564 INFO L87 Difference]: Start difference. First operand 885 states and 1156 transitions. Second operand 3 states. [2018-12-03 19:18:31,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:18:31,906 INFO L93 Difference]: Finished difference Result 2649 states and 3462 transitions. [2018-12-03 19:18:31,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:18:31,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-03 19:18:31,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:18:31,917 INFO L225 Difference]: With dead ends: 2649 [2018-12-03 19:18:31,917 INFO L226 Difference]: Without dead ends: 1767 [2018-12-03 19:18:31,919 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 19:18:31,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2018-12-03 19:18:32,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1765. [2018-12-03 19:18:32,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2018-12-03 19:18:32,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2260 transitions. [2018-12-03 19:18:32,182 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2260 transitions. Word has length 36 [2018-12-03 19:18:32,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:18:32,183 INFO L480 AbstractCegarLoop]: Abstraction has 1765 states and 2260 transitions. [2018-12-03 19:18:32,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:18:32,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2260 transitions. [2018-12-03 19:18:32,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 19:18:32,186 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:18:32,186 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:18:32,187 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:18:32,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:18:32,187 INFO L82 PathProgramCache]: Analyzing trace with hash 42087099, now seen corresponding path program 1 times [2018-12-03 19:18:32,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:18:32,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:32,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:18:32,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:18:32,189 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:18:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:18:32,546 WARN L180 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2018-12-03 19:18:32,612 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:18:32,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:18:32,612 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:18:32,613 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-12-03 19:18:32,615 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50], [54], [56], [60], [62], [64], [68], [70], [72] [2018-12-03 19:18:32,708 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 19:18:32,708 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 19:18:34,235 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 19:22:36,582 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 19:22:36,583 INFO L272 AbstractInterpreter]: Visited 28 different actions 897 times. Merged at 26 different actions 631 times. Widened at 19 different actions 297 times. Found 246 fixpoints after 15 different actions. Largest state had 0 variables. [2018-12-03 19:22:36,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:36,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 19:22:36,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:36,601 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 19:22:36,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:22:36,625 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:22:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:36,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:22:37,042 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 19:22:37,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:22:37,423 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 19:22:37,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:22:37,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2018-12-03 19:22:37,458 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:22:37,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 19:22:37,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 19:22:37,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-03 19:22:37,459 INFO L87 Difference]: Start difference. First operand 1765 states and 2260 transitions. Second operand 7 states. [2018-12-03 19:22:37,686 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-03 19:22:38,173 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 19:22:38,575 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 19:22:38,881 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-03 19:22:40,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:40,808 INFO L93 Difference]: Finished difference Result 4087 states and 5237 transitions. [2018-12-03 19:22:40,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 19:22:40,808 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-12-03 19:22:40,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:40,817 INFO L225 Difference]: With dead ends: 4087 [2018-12-03 19:22:40,817 INFO L226 Difference]: Without dead ends: 1617 [2018-12-03 19:22:40,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-12-03 19:22:40,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2018-12-03 19:22:41,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1454. [2018-12-03 19:22:41,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2018-12-03 19:22:41,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 1737 transitions. [2018-12-03 19:22:41,048 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 1737 transitions. Word has length 36 [2018-12-03 19:22:41,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:41,048 INFO L480 AbstractCegarLoop]: Abstraction has 1454 states and 1737 transitions. [2018-12-03 19:22:41,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 19:22:41,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 1737 transitions. [2018-12-03 19:22:41,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 19:22:41,051 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:41,051 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 19:22:41,052 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:41,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:41,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1718966135, now seen corresponding path program 2 times [2018-12-03 19:22:41,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:41,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:41,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:22:41,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:41,056 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:41,133 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-03 19:22:41,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:22:41,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:22:41,133 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:22:41,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:22:41,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:22:41,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:22:41,135 INFO L87 Difference]: Start difference. First operand 1454 states and 1737 transitions. Second operand 3 states. [2018-12-03 19:22:41,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:41,168 INFO L93 Difference]: Finished difference Result 1464 states and 1748 transitions. [2018-12-03 19:22:41,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:22:41,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-12-03 19:22:41,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:41,169 INFO L225 Difference]: With dead ends: 1464 [2018-12-03 19:22:41,169 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 19:22:41,171 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 19:22:41,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 19:22:41,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 19:22:41,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 19:22:41,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 19:22:41,172 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2018-12-03 19:22:41,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:41,173 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 19:22:41,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:22:41,173 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 19:22:41,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 19:22:41,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 19:22:41,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:41,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 19:22:42,799 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-03 19:22:43,005 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-03 19:22:43,520 WARN L180 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-12-03 19:22:43,887 WARN L180 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-12-03 19:22:44,020 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-12-03 19:22:44,324 WARN L180 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-12-03 19:22:44,672 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-12-03 19:22:44,913 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-12-03 19:22:45,220 WARN L180 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-12-03 19:22:45,408 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-12-03 19:22:45,661 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-12-03 19:22:45,764 INFO L444 ceAbstractionStarter]: At program point L440(lines 440 450) the Hoare annotation is: (let ((.cse0 (<= (div ~mode4 256) 0)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse4 (not (= ~p3_new ~nomsg))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_9 Int)) (let ((.cse3 (mod v_~r1_9 256))) (and (= (+ .cse3 1) ~r1) (<= .cse3 0)))) .cse4 .cse5 .cse6 (not (= ~p3_old ~nomsg))) (and .cse0 .cse1 .cse2 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6))) [2018-12-03 19:22:45,764 INFO L444 ceAbstractionStarter]: At program point L374(lines 374 384) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 .cse2)) .cse3) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 19:22:45,764 INFO L444 ceAbstractionStarter]: At program point L457(lines 449 458) the Hoare annotation is: (let ((.cse0 (<= (div ~mode4 256) 0)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse4 (not (= ~p3_new ~nomsg))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_9 Int)) (let ((.cse3 (mod v_~r1_9 256))) (and (= (+ .cse3 1) ~r1) (<= .cse3 0)))) .cse4 .cse5 .cse6 (not (= ~p3_old ~nomsg))) (and .cse0 .cse1 .cse2 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6))) [2018-12-03 19:22:45,765 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 516) no Hoare annotation was computed. [2018-12-03 19:22:45,765 INFO L444 ceAbstractionStarter]: At program point L391(lines 383 392) the Hoare annotation is: (let ((.cse8 (div ~mode4 256))) (let ((.cse7 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse6 (<= ~r1 (* 256 (div ~r1 256)))) (.cse9 (<= .cse8 0)) (.cse0 (<= ~send3 127)) (.cse10 (<= 1 ~mode4)) (.cse2 (not (= ~p3_new ~nomsg))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse5 (not (= ~p3_old ~nomsg)))) (or (and .cse0 (exists ((v_~r1_9 Int)) (let ((.cse1 (mod v_~r1_9 256))) (and (= (+ .cse1 1) ~r1) (<= .cse1 0)))) .cse2 .cse3 .cse4 .cse5) (and .cse0 (= ULTIMATE.start_assert_~arg 1) .cse2 (<= 1 ULTIMATE.start_check_~tmp~132) .cse3 .cse6 .cse4 .cse5) (and .cse7 .cse0 .cse2 .cse3 .cse6 (= ~mode4 (* 256 .cse8)) .cse4) (and .cse7 .cse0 .cse2 .cse3 .cse6 .cse4 .cse5) (and .cse9 .cse0 .cse10 (= ~mode3 (* 256 (div ~mode3 256))) .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse4 .cse5)))) [2018-12-03 19:22:45,765 INFO L444 ceAbstractionStarter]: At program point L511(lines 511 515) the Hoare annotation is: false [2018-12-03 19:22:45,765 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 96 517) no Hoare annotation was computed. [2018-12-03 19:22:45,765 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 96 517) no Hoare annotation was computed. [2018-12-03 19:22:45,765 INFO L444 ceAbstractionStarter]: At program point L495(lines 490 496) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (<= ~send3 127) (<= 1 ~mode4) (<= 1 ULTIMATE.start_check_~tmp~132) (= 0 (+ ~nomsg 1)) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-12-03 19:22:45,765 INFO L444 ceAbstractionStarter]: At program point L396(lines 396 406) the Hoare annotation is: (let ((.cse8 (div ~mode4 256))) (let ((.cse7 (= ~mode5 (* 256 (div ~mode5 256)))) (.cse6 (<= ~r1 (* 256 (div ~r1 256)))) (.cse9 (<= .cse8 0)) (.cse0 (<= ~send3 127)) (.cse10 (<= 1 ~mode4)) (.cse2 (not (= ~p3_new ~nomsg))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (<= 0 ~send3)) (.cse5 (not (= ~p3_old ~nomsg)))) (or (and .cse0 (exists ((v_~r1_9 Int)) (let ((.cse1 (mod v_~r1_9 256))) (and (= (+ .cse1 1) ~r1) (<= .cse1 0)))) .cse2 .cse3 .cse4 .cse5) (and .cse0 (= ULTIMATE.start_assert_~arg 1) .cse2 (<= 1 ULTIMATE.start_check_~tmp~132) .cse3 .cse6 .cse4 .cse5) (and .cse7 .cse0 .cse2 .cse3 .cse6 (= ~mode4 (* 256 .cse8)) .cse4) (and .cse7 .cse0 .cse2 .cse3 .cse6 .cse4 .cse5) (and .cse9 .cse0 .cse10 (= ~mode3 (* 256 (div ~mode3 256))) .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse4 .cse5)))) [2018-12-03 19:22:45,766 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 96 517) no Hoare annotation was computed. [2018-12-03 19:22:45,766 INFO L444 ceAbstractionStarter]: At program point L413(lines 405 414) the Hoare annotation is: (let ((.cse7 (not (= ~p3_old ~nomsg))) (.cse0 (<= (div ~mode4 256) 0)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse3 (not (= ~p3_new ~nomsg))) (.cse4 (= 0 (+ ~nomsg 1))) (.cse5 (<= ~r1 (* 256 (div ~r1 256)))) (.cse6 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_assert_~arg 1) .cse3 (<= 1 ULTIMATE.start_check_~tmp~132) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 (exists ((v_~r1_9 Int)) (let ((.cse8 (mod v_~r1_9 256))) (and (= (+ .cse8 1) ~r1) (<= .cse8 0)))) .cse3 .cse4 .cse6 .cse7) (and .cse0 (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-12-03 19:22:45,766 INFO L444 ceAbstractionStarter]: At program point L347(lines 339 348) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 .cse2)) .cse3) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 19:22:45,766 INFO L444 ceAbstractionStarter]: At program point L475(lines 475 481) the Hoare annotation is: (let ((.cse0 (<= (div ~mode4 256) 0)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse4 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse6 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_9 Int)) (let ((.cse3 (mod v_~r1_9 256))) (and (= (+ .cse3 1) ~r1) (<= .cse3 0)))) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse4 (<= ~r1 (* 256 (div ~r1 256))) .cse5 .cse6))) [2018-12-03 19:22:45,766 INFO L444 ceAbstractionStarter]: At program point L484(lines 480 491) the Hoare annotation is: (let ((.cse0 (<= (div ~mode4 256) 0)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse4 (= 0 (+ ~nomsg 1))) (.cse5 (<= 0 ~send3)) (.cse6 (not (= ~p3_old ~nomsg)))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_9 Int)) (let ((.cse3 (mod v_~r1_9 256))) (and (= (+ .cse3 1) ~r1) (<= .cse3 0)))) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse4 (<= ~r1 (* 256 (div ~r1 256))) .cse5 .cse6))) [2018-12-03 19:22:45,766 INFO L444 ceAbstractionStarter]: At program point L418(lines 418 428) the Hoare annotation is: (let ((.cse7 (not (= ~p3_old ~nomsg))) (.cse0 (<= (div ~mode4 256) 0)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse3 (not (= ~p3_new ~nomsg))) (.cse4 (= 0 (+ ~nomsg 1))) (.cse5 (<= ~r1 (* 256 (div ~r1 256)))) (.cse6 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_assert_~arg 1) .cse3 (<= 1 ULTIMATE.start_check_~tmp~132) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 (exists ((v_~r1_9 Int)) (let ((.cse8 (mod v_~r1_9 256))) (and (= (+ .cse8 1) ~r1) (<= .cse8 0)))) .cse3 .cse4 .cse6 .cse7) (and .cse0 (= ~mode5 (* 256 (div ~mode5 256))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2018-12-03 19:22:45,766 INFO L444 ceAbstractionStarter]: At program point L352(lines 352 362) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 .cse2)) .cse3) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 19:22:45,767 INFO L444 ceAbstractionStarter]: At program point L505(lines 505 512) the Hoare annotation is: (and (<= (div ~mode4 256) 0) (<= ~send3 127) (<= 1 ~mode4) (= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_check_~tmp~132) (= 0 (+ ~nomsg 1)) (<= 0 ~send3) (not (= ~p3_old ~nomsg))) [2018-12-03 19:22:45,767 INFO L444 ceAbstractionStarter]: At program point L435(lines 427 436) the Hoare annotation is: (let ((.cse0 (<= (div ~mode4 256) 0)) (.cse1 (<= ~send3 127)) (.cse2 (<= 1 ~mode4)) (.cse4 (not (= ~p3_new ~nomsg))) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 0 ~send3))) (or (and .cse0 .cse1 .cse2 (exists ((v_~r1_9 Int)) (let ((.cse3 (mod v_~r1_9 256))) (and (= (+ .cse3 1) ~r1) (<= .cse3 0)))) .cse4 .cse5 .cse6 (not (= ~p3_old ~nomsg))) (and .cse0 .cse1 .cse2 .cse4 .cse5 (<= ~r1 (* 256 (div ~r1 256))) .cse6))) [2018-12-03 19:22:45,767 INFO L444 ceAbstractionStarter]: At program point L369(lines 361 370) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 .cse2)) .cse3) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 19:22:45,767 INFO L444 ceAbstractionStarter]: At program point L328(lines 328 340) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 .cse2)) .cse3) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 19:22:45,767 INFO L444 ceAbstractionStarter]: At program point L514(lines 321 514) the Hoare annotation is: (let ((.cse2 (div ~mode4 256)) (.cse0 (<= ~send3 127)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse3 (<= 0 ~send3))) (or (and (= ~mode5 (* 256 (div ~mode5 256))) .cse0 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse1 (<= ~r1 (* 256 (div ~r1 256))) (= ~mode4 (* 256 .cse2)) .cse3) (and (<= .cse2 0) .cse0 (<= 1 ~mode4) .cse1 .cse3 (not (= ~p3_old ~nomsg))))) [2018-12-03 19:22:45,792 INFO L202 PluginConnector]: Adding new model pals_lcr.6.ufo.UNBOUNDED.pals.c_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 07:22:45 BoogieIcfgContainer [2018-12-03 19:22:45,792 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 19:22:45,793 INFO L168 Benchmark]: Toolchain (without parser) took 258430.76 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -605.8 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-12-03 19:22:45,795 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 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 19:22:45,795 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.42 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 19:22:45,796 INFO L168 Benchmark]: Boogie Preprocessor took 71.97 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 19:22:45,796 INFO L168 Benchmark]: RCFGBuilder took 856.90 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 19:22:45,797 INFO L168 Benchmark]: TraceAbstraction took 257449.57 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -648.1 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-12-03 19:22:45,801 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.18 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 47.42 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 71.97 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 856.90 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 257449.57 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -648.1 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 516]: 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: 480]: Loop Invariant Derived loop invariant: ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 505]: Loop Invariant Derived loop invariant: ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && assert_~arg == 1) && 1 <= check_~tmp~132) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg) - InvariantResult [Line: 440]: Loop Invariant Derived loop invariant: (((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: ((((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && assert_~arg == 1) && !(~p3_new == ~nomsg)) && 1 <= check_~tmp~132) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) - InvariantResult [Line: 396]: Loop Invariant Derived loop invariant: (((((((((~send3 <= 127 && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((((~send3 <= 127 && assert_~arg == 1) && !(~p3_new == ~nomsg)) && 1 <= check_~tmp~132) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: ((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 449]: Loop Invariant Derived loop invariant: (((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) - InvariantResult [Line: 427]: Loop Invariant Derived loop invariant: (((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) - InvariantResult [Line: 328]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: ((((((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && assert_~arg == 1) && !(~p3_new == ~nomsg)) && 1 <= check_~tmp~132) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || (((((((~mode4 / 256 <= 0 && ~mode5 == 256 * (~mode5 / 256)) && ~send3 <= 127) && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) - InvariantResult [Line: 383]: Loop Invariant Derived loop invariant: (((((((((~send3 <= 127 && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || (((((((~send3 <= 127 && assert_~arg == 1) && !(~p3_new == ~nomsg)) && 1 <= check_~tmp~132) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3)) || ((((((~mode5 == 256 * (~mode5 / 256) && ~send3 <= 127) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && ~mode3 == 256 * (~mode3 / 256)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg))) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && !(~p3_new == ~nomsg)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: ((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: ((((((~mode5 == 256 * (~mode5 / 256) && ~mode3 == 256 * (~mode3 / 256)) && ~send3 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && ~mode4 == 256 * (~mode4 / 256)) && 0 <= ~send3) || (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 475]: Loop Invariant Derived loop invariant: ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && (exists v_~r1_9 : int :: v_~r1_9 % 256 + 1 == ~r1 && v_~r1_9 % 256 <= 0)) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg)) || ((((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) && 0 <= ~send3) && !(~p3_old == ~nomsg)) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: (((((~mode4 / 256 <= 0 && ~send3 <= 127) && 1 <= ~mode4) && 1 <= check_~tmp~132) && 0 == ~nomsg + 1) && 0 <= ~send3) && !(~p3_old == ~nomsg) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 1 error locations. SAFE Result, 257.3s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 4.7s AutomataDifference, 0.0s DeadEndRemovalTime, 4.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 356 SDtfs, 297 SDslu, 258 SDs, 0 SdLazy, 296 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1765occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 243.9s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 327 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 18 PreInvPairs, 738 NumberOfFragments, 1464 HoareAnnotationTreeSize, 18 FomulaSimplifications, 44307 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 18 FomulaSimplificationsInter, 105 FormulaSimplificationTreeSizeReductionInter, 4.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 369 ConstructedInterpolants, 12 QuantifiedInterpolants, 54276 SizeOfPredicates, 1 NumberOfNonLiveVariables, 354 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 172/204 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...