java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.3.1.ufo.UNBOUNDED.pals.c_14.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:42:54,891 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:42:54,893 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:42:54,905 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:42:54,905 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:42:54,906 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:42:54,908 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:42:54,910 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:42:54,912 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:42:54,913 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:42:54,914 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:42:54,915 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:42:54,916 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:42:54,917 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:42:54,918 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:42:54,919 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:42:54,920 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:42:54,922 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:42:54,924 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:42:54,926 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:42:54,928 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:42:54,929 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:42:54,932 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:42:54,933 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:42:54,933 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:42:54,934 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:42:54,935 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:42:54,936 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:42:54,937 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:42:54,939 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:42:54,939 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:42:54,940 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:42:54,940 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:42:54,941 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:42:54,942 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:42:54,943 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:42:54,943 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:42:54,956 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:42:54,957 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:42:54,958 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:42:54,958 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:42:54,958 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:42:54,959 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:42:54,959 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:42:54,959 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:42:54,959 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:42:54,960 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:42:54,960 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:42:54,960 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:42:54,960 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:42:54,961 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:42:54,961 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:42:54,962 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:42:54,962 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:42:54,962 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:42:54,963 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:42:54,963 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:42:54,963 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:42:54,963 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:42:54,963 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:42:54,964 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:42:54,964 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:42:54,964 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:42:54,964 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:42:54,964 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:42:54,965 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:42:54,965 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:42:54,965 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:42:54,965 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:42:54,966 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:42:54,966 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:42:54,966 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:42:54,966 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:42:54,966 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:42:54,967 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:42:54,967 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:42:54,967 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:42:54,967 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:42:54,999 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:42:55,014 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:42:55,021 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:42:55,023 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:42:55,024 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:42:55,024 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.3.1.ufo.UNBOUNDED.pals.c_14.bpl [2018-12-03 16:42:55,025 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.3.1.ufo.UNBOUNDED.pals.c_14.bpl' [2018-12-03 16:42:55,117 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:42:55,119 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:42:55,120 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:42:55,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:42:55,120 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:42:55,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.3.1.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:55" (1/1) ... [2018-12-03 16:42:55,151 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.3.1.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:55" (1/1) ... [2018-12-03 16:42:55,160 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:42:55,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:42:55,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:42:55,162 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:42:55,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.3.1.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:55" (1/1) ... [2018-12-03 16:42:55,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.3.1.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:55" (1/1) ... [2018-12-03 16:42:55,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.3.1.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:55" (1/1) ... [2018-12-03 16:42:55,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.3.1.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:55" (1/1) ... [2018-12-03 16:42:55,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.3.1.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:55" (1/1) ... [2018-12-03 16:42:55,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.3.1.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:55" (1/1) ... [2018-12-03 16:42:55,189 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.3.1.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:55" (1/1) ... [2018-12-03 16:42:55,192 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:42:55,193 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:42:55,193 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:42:55,193 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:42:55,194 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.3.1.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:42:55,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:42:55,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:42:55,987 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:42:55,988 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:42:55,989 INFO L202 PluginConnector]: Adding new model pals_lcr.3.1.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:42:55 BoogieIcfgContainer [2018-12-03 16:42:55,989 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:42:55,990 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:42:55,991 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:42:55,995 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:42:55,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.3.1.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:42:55" (1/2) ... [2018-12-03 16:42:55,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bafe383 and model type pals_lcr.3.1.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:42:55, skipping insertion in model container [2018-12-03 16:42:55,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.3.1.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:42:55" (2/2) ... [2018-12-03 16:42:55,999 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c_14.bpl [2018-12-03 16:42:56,009 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:42:56,018 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:42:56,039 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:42:56,076 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:42:56,077 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:42:56,077 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:42:56,077 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:42:56,077 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:42:56,078 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:42:56,078 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:42:56,078 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:42:56,097 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-12-03 16:42:56,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 16:42:56,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:56,113 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:56,116 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:56,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:56,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1167247609, now seen corresponding path program 1 times [2018-12-03 16:42:56,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:56,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:56,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:56,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:56,206 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:56,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:56,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:56,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:56,444 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:56,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:56,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:56,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:56,468 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. [2018-12-03 16:42:56,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:56,523 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2018-12-03 16:42:56,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:56,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-03 16:42:56,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:56,536 INFO L225 Difference]: With dead ends: 42 [2018-12-03 16:42:56,537 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:42:56,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:56,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:42:56,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-12-03 16:42:56,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 16:42:56,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2018-12-03 16:42:56,580 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 13 [2018-12-03 16:42:56,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:56,581 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2018-12-03 16:42:56,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:56,581 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2018-12-03 16:42:56,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 16:42:56,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:56,582 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:56,582 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:56,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:56,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1352712325, now seen corresponding path program 1 times [2018-12-03 16:42:56,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:56,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:56,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:56,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:56,586 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:56,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:56,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:56,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:42:56,790 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:56,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:42:56,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:42:56,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:42:56,793 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 4 states. [2018-12-03 16:42:56,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:56,957 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2018-12-03 16:42:56,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:42:56,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-12-03 16:42:56,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:56,959 INFO L225 Difference]: With dead ends: 53 [2018-12-03 16:42:56,959 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 16:42:56,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:42:56,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 16:42:56,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 29. [2018-12-03 16:42:56,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 16:42:56,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2018-12-03 16:42:56,972 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 13 [2018-12-03 16:42:56,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:56,973 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2018-12-03 16:42:56,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:42:56,973 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2018-12-03 16:42:56,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 16:42:56,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:56,974 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:56,974 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:56,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:56,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1352652743, now seen corresponding path program 1 times [2018-12-03 16:42:56,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:56,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:56,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:56,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:56,978 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:57,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:42:57,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:57,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:57,158 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:57,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:42:57,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:42:57,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:42:57,161 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand 4 states. [2018-12-03 16:42:57,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:57,281 INFO L93 Difference]: Finished difference Result 97 states and 135 transitions. [2018-12-03 16:42:57,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:42:57,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-12-03 16:42:57,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:57,284 INFO L225 Difference]: With dead ends: 97 [2018-12-03 16:42:57,284 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 16:42:57,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:42:57,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 16:42:57,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 16:42:57,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 16:42:57,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 89 transitions. [2018-12-03 16:42:57,307 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 89 transitions. Word has length 13 [2018-12-03 16:42:57,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:57,307 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 89 transitions. [2018-12-03 16:42:57,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:42:57,308 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 89 transitions. [2018-12-03 16:42:57,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:42:57,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:57,309 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:42:57,310 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:57,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:57,310 INFO L82 PathProgramCache]: Analyzing trace with hash 90659497, now seen corresponding path program 1 times [2018-12-03 16:42:57,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:57,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:57,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:57,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:57,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:57,368 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 16:42:57,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:57,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:42:57,369 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:57,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:57,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:57,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:57,371 INFO L87 Difference]: Start difference. First operand 69 states and 89 transitions. Second operand 3 states. [2018-12-03 16:42:57,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:57,423 INFO L93 Difference]: Finished difference Result 163 states and 214 transitions. [2018-12-03 16:42:57,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:57,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-03 16:42:57,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:57,425 INFO L225 Difference]: With dead ends: 163 [2018-12-03 16:42:57,425 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 16:42:57,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:57,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 16:42:57,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-12-03 16:42:57,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 16:42:57,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 147 transitions. [2018-12-03 16:42:57,473 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 147 transitions. Word has length 24 [2018-12-03 16:42:57,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:57,473 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 147 transitions. [2018-12-03 16:42:57,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:57,475 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 147 transitions. [2018-12-03 16:42:57,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 16:42:57,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:57,478 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 16:42:57,480 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:57,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:57,480 INFO L82 PathProgramCache]: Analyzing trace with hash -726110997, now seen corresponding path program 1 times [2018-12-03 16:42:57,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:57,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:57,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:57,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:57,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:57,663 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 16:42:57,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:42:57,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:42:57,664 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:42:57,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:42:57,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:42:57,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:57,665 INFO L87 Difference]: Start difference. First operand 115 states and 147 transitions. Second operand 3 states. [2018-12-03 16:42:57,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:42:57,763 INFO L93 Difference]: Finished difference Result 339 states and 435 transitions. [2018-12-03 16:42:57,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:42:57,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-03 16:42:57,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:42:57,768 INFO L225 Difference]: With dead ends: 339 [2018-12-03 16:42:57,768 INFO L226 Difference]: Without dead ends: 227 [2018-12-03 16:42:57,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:42:57,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-12-03 16:42:57,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2018-12-03 16:42:57,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-12-03 16:42:57,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 280 transitions. [2018-12-03 16:42:57,853 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 280 transitions. Word has length 46 [2018-12-03 16:42:57,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:42:57,854 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 280 transitions. [2018-12-03 16:42:57,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:42:57,854 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 280 transitions. [2018-12-03 16:42:57,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 16:42:57,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:42:57,857 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 16:42:57,857 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:42:57,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:57,858 INFO L82 PathProgramCache]: Analyzing trace with hash -2107769241, now seen corresponding path program 1 times [2018-12-03 16:42:57,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:42:57,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:57,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:57,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:42:57,862 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:42:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:58,172 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-12-03 16:42:58,414 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-12-03 16:42:58,570 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 4 [2018-12-03 16:42:58,581 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 37 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 16:42:58,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:58,581 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:42:58,583 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-12-03 16:42:58,584 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [36], [38], [40], [44], [46], [48] [2018-12-03 16:42:58,640 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:42:58,640 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:42:59,686 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:42:59,687 INFO L272 AbstractInterpreter]: Visited 19 different actions 102 times. Merged at 17 different actions 55 times. Widened at 5 different actions 5 times. Found 24 fixpoints after 9 different actions. Largest state had 0 variables. [2018-12-03 16:42:59,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:42:59,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:42:59,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:42:59,738 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:42:59,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:42:59,752 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:42:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:42:59,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:43:00,502 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 11 proven. 44 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 16:43:00,503 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:43:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 9 proven. 46 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 16:43:01,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:43:01,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2018-12-03 16:43:01,155 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:43:01,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:43:01,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:43:01,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-12-03 16:43:01,159 INFO L87 Difference]: Start difference. First operand 225 states and 280 transitions. Second operand 10 states. [2018-12-03 16:43:02,452 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-03 16:43:03,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:03,528 INFO L93 Difference]: Finished difference Result 541 states and 660 transitions. [2018-12-03 16:43:03,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:43:03,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2018-12-03 16:43:03,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:03,530 INFO L225 Difference]: With dead ends: 541 [2018-12-03 16:43:03,530 INFO L226 Difference]: Without dead ends: 196 [2018-12-03 16:43:03,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=202, Invalid=728, Unknown=0, NotChecked=0, Total=930 [2018-12-03 16:43:03,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-03 16:43:03,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 157. [2018-12-03 16:43:03,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-03 16:43:03,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 177 transitions. [2018-12-03 16:43:03,577 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 177 transitions. Word has length 46 [2018-12-03 16:43:03,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:03,578 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 177 transitions. [2018-12-03 16:43:03,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:43:03,578 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 177 transitions. [2018-12-03 16:43:03,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 16:43:03,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:43:03,581 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:43:03,581 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:43:03,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:43:03,581 INFO L82 PathProgramCache]: Analyzing trace with hash 702690737, now seen corresponding path program 2 times [2018-12-03 16:43:03,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:43:03,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:03,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:43:03,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:43:03,585 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:43:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:43:03,698 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-12-03 16:43:03,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:43:03,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:43:03,699 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:43:03,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:43:03,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:43:03,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:03,704 INFO L87 Difference]: Start difference. First operand 157 states and 177 transitions. Second operand 3 states. [2018-12-03 16:43:03,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:43:03,711 INFO L93 Difference]: Finished difference Result 157 states and 177 transitions. [2018-12-03 16:43:03,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:43:03,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-03 16:43:03,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:43:03,712 INFO L225 Difference]: With dead ends: 157 [2018-12-03 16:43:03,712 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 16:43:03,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:43:03,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 16:43:03,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 16:43:03,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 16:43:03,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 16:43:03,719 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2018-12-03 16:43:03,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:43:03,720 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 16:43:03,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:43:03,720 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 16:43:03,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 16:43:03,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 16:43:05,057 WARN L180 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-12-03 16:43:05,318 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-12-03 16:43:05,441 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2018-12-03 16:43:05,640 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2018-12-03 16:43:06,076 INFO L444 ceAbstractionStarter]: At program point L225(lines 217 226) the Hoare annotation is: (let ((.cse6 (* 256 (div ~r1 256))) (.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (= (+ ~st3 ~st2 ~st1) 0) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 .cse6)) (and (not (= ~p1_old ~nomsg)) (<= ~r1 (+ .cse6 2)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-12-03 16:43:06,076 INFO L444 ceAbstractionStarter]: At program point L289(lines 289 295) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (= ULTIMATE.start_assert_~arg 1) (<= ~r1 (+ (* 256 (div ~r1 256)) 2)) (<= 1 ~mode2) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= 1 ULTIMATE.start_check_~tmp~64) (<= (div ~mode2 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 16:43:06,076 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 51 301) no Hoare annotation was computed. [2018-12-03 16:43:06,077 INFO L444 ceAbstractionStarter]: At program point L184(lines 184 195) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div ~send1 256) 1))) (.cse2 (div ~mode2 256)) (.cse1 (<= ~send1 127)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) .cse3) (and (= (+ ~st3 ~st2 ~st1) 0) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 .cse2)) .cse1 .cse3 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-12-03 16:43:06,077 INFO L444 ceAbstractionStarter]: At program point L279(lines 274 280) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= ~r1 (+ (* 256 (div ~r1 256)) 2)) (<= 1 ~mode2) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= 1 ULTIMATE.start_check_~tmp~64) (<= (div ~mode2 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 16:43:06,077 INFO L444 ceAbstractionStarter]: At program point L203(lines 194 204) the Hoare annotation is: (let ((.cse7 (div ~mode2 256))) (let ((.cse1 (<= 1 ~mode2)) (.cse5 (<= .cse7 0)) (.cse0 (not (= ~p1_old ~nomsg))) (.cse8 (* 256 (div ~r1 256))) (.cse2 (not (= ~p1_new ~nomsg))) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse3 .cse4 .cse5 .cse6) (and (= (+ ~st3 ~st2 ~st1) 0) (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 (= ~mode2 (* 256 .cse7)) .cse4 .cse6 (<= ~r1 .cse8)) (and .cse0 (<= ~r1 (+ .cse8 2)) .cse2 .cse3 .cse4 .cse6)))) [2018-12-03 16:43:06,077 INFO L444 ceAbstractionStarter]: At program point L298(lines 298 299) the Hoare annotation is: false [2018-12-03 16:43:06,077 INFO L444 ceAbstractionStarter]: At program point L230(lines 230 240) the Hoare annotation is: (let ((.cse6 (* 256 (div ~r1 256))) (.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (= (+ ~st3 ~st2 ~st1) 0) (= ~mode3 (* 256 (div ~mode3 256))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 .cse6)) (and (not (= ~p1_old ~nomsg)) (<= ~r1 (+ .cse6 2)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-12-03 16:43:06,078 INFO L444 ceAbstractionStarter]: At program point L294(lines 177 294) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div ~send1 256) 1))) (.cse2 (div ~mode2 256)) (.cse1 (<= ~send1 127)) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p1_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) .cse3) (and (= (+ ~st3 ~st2 ~st1) 0) (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 .cse2)) .cse1 .cse3 (<= ~r1 (* 256 (div ~r1 256)))))) [2018-12-03 16:43:06,078 INFO L444 ceAbstractionStarter]: At program point L259(lines 259 265) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= ~r1 (+ (* 256 (div ~r1 256)) 2)) (<= 1 ~mode2) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= (div ~mode2 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 16:43:06,078 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 51 301) no Hoare annotation was computed. [2018-12-03 16:43:06,078 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 51 301) no Hoare annotation was computed. [2018-12-03 16:43:06,078 INFO L444 ceAbstractionStarter]: At program point L247(lines 239 248) the Hoare annotation is: (let ((.cse6 (* 256 (div ~r1 256))) (.cse0 (<= 1 ~mode2)) (.cse1 (not (= ~p1_new ~nomsg))) (.cse2 (< 0 (+ (div ~send1 256) 1))) (.cse3 (<= ~send1 127)) (.cse4 (<= (div ~mode2 256) 0)) (.cse5 (= 0 (+ ~nomsg 1)))) (or (and (= (+ ~st3 ~st2 ~st1) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~r1 .cse6)) (and (not (= ~p1_old ~nomsg)) (<= ~r1 (+ .cse6 2)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2018-12-03 16:43:06,078 INFO L444 ceAbstractionStarter]: At program point L208(lines 208 218) the Hoare annotation is: (let ((.cse7 (div ~mode2 256))) (let ((.cse1 (<= 1 ~mode2)) (.cse5 (<= .cse7 0)) (.cse0 (not (= ~p1_old ~nomsg))) (.cse8 (* 256 (div ~r1 256))) (.cse2 (not (= ~p1_new ~nomsg))) (.cse3 (< 0 (+ (div ~send1 256) 1))) (.cse4 (<= ~send1 127)) (.cse6 (= 0 (+ ~nomsg 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (= ~mode1 (* 256 (div ~mode1 256))) .cse1 .cse3 .cse4 .cse5 .cse6) (and (= (+ ~st3 ~st2 ~st1) 0) (= ~mode3 (* 256 (div ~mode3 256))) .cse2 .cse3 (= ~mode2 (* 256 .cse7)) .cse4 .cse6 (<= ~r1 .cse8)) (and .cse0 (<= ~r1 (+ .cse8 2)) .cse2 .cse3 .cse4 .cse6)))) [2018-12-03 16:43:06,079 INFO L444 ceAbstractionStarter]: At program point L268(lines 264 275) the Hoare annotation is: (and (not (= ~p1_old ~nomsg)) (<= ~r1 (+ (* 256 (div ~r1 256)) 2)) (<= 1 ~mode2) (< 0 (+ (div ~send1 256) 1)) (<= ~send1 127) (<= (div ~mode2 256) 0) (= 0 (+ ~nomsg 1))) [2018-12-03 16:43:06,079 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 300) no Hoare annotation was computed. [2018-12-03 16:43:06,096 INFO L202 PluginConnector]: Adding new model pals_lcr.3.1.ufo.UNBOUNDED.pals.c_14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:43:06 BoogieIcfgContainer [2018-12-03 16:43:06,096 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:43:06,097 INFO L168 Benchmark]: Toolchain (without parser) took 10979.25 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 674.2 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -200.9 MB). Peak memory consumption was 473.3 MB. Max. memory is 7.1 GB. [2018-12-03 16:43:06,099 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:43:06,099 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:43:06,100 INFO L168 Benchmark]: Boogie Preprocessor took 31.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:43:06,101 INFO L168 Benchmark]: RCFGBuilder took 796.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 16:43:06,102 INFO L168 Benchmark]: TraceAbstraction took 10105.74 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 674.2 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -232.7 MB). Peak memory consumption was 441.6 MB. Max. memory is 7.1 GB. [2018-12-03 16:43:06,107 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 796.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10105.74 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 674.2 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -232.7 MB). Peak memory consumption was 441.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 300]: 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: 298]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) || ((((((!(~p1_old == ~nomsg) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1)) || (((((((~st3 + ~st2 + ~st1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((!(~p1_old == ~nomsg) && ~r1 <= 256 * (~r1 / 256) + 2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: ((((((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) || ((((((!(~p1_old == ~nomsg) && ~mode1 == 256 * (~mode1 / 256)) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1)) || (((((((~st3 + ~st2 + ~st1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256))) || (((((!(~p1_old == ~nomsg) && ~r1 <= 256 * (~r1 / 256) + 2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 0 == ~nomsg + 1) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) || (((((((~st3 + ~st2 + ~st1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((((((((~st3 + ~st2 + ~st1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p1_old == ~nomsg) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: ((((((((~st3 + ~st2 + ~st1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p1_old == ~nomsg) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: (((((((!(~p1_old == ~nomsg) && assert_~arg == 1) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 1 <= check_~tmp~64) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: (((((((~st3 + ~st2 + ~st1 == 0 && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) || (((((((!(~p1_old == ~nomsg) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && !(~p1_new == ~nomsg)) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 274]: Loop Invariant Derived loop invariant: ((((((!(~p1_old == ~nomsg) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && 1 <= check_~tmp~64) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1 - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) || (((((((~st3 + ~st2 + ~st1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && 0 < ~send1 / 256 + 1) && ~mode2 == 256 * (~mode2 / 256)) && ~send1 <= 127) && 0 == ~nomsg + 1) && ~r1 <= 256 * (~r1 / 256)) - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: (((((!(~p1_old == ~nomsg) && ~r1 <= 256 * (~r1 / 256) + 2) && 1 <= ~mode2) && 0 < ~send1 / 256 + 1) && ~send1 <= 127) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. SAFE Result, 10.0s OverallTime, 7 OverallIterations, 6 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 2.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 151 SDtfs, 204 SDslu, 174 SDs, 0 SdLazy, 406 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=225occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 67 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 139 NumberOfFragments, 875 HoareAnnotationTreeSize, 12 FomulaSimplifications, 6523 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 434 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 306 ConstructedInterpolants, 28 QuantifiedInterpolants, 80621 SizeOfPredicates, 10 NumberOfNonLiveVariables, 330 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 346/440 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...