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_camel.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:23:57,866 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:23:57,867 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:23:57,879 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:23:57,880 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:23:57,883 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:23:57,885 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:23:57,887 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:23:57,891 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:23:57,892 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:23:57,893 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:23:57,893 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:23:57,894 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:23:57,896 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:23:57,897 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:23:57,899 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:23:57,900 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:23:57,904 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:23:57,912 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:23:57,913 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:23:57,920 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:23:57,921 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:23:57,923 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:23:57,923 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:23:57,923 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:23:57,924 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:23:57,925 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:23:57,926 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:23:57,926 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:23:57,928 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:23:57,928 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:23:57,928 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:23:57,929 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:23:57,929 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:23:57,930 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:23:57,931 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:23:57,932 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_camel.epf [2019-03-04 16:23:57,952 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:23:57,953 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:23:57,954 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:23:57,954 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:23:57,954 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:23:57,955 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:23:57,957 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:23:57,957 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:23:57,958 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:23:57,958 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:23:57,958 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2019-03-04 16:23:57,958 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:23:57,959 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:23:57,959 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:23:57,960 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:23:57,960 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:23:57,960 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:23:57,960 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:23:57,960 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:23:57,961 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:23:57,962 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:23:57,962 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:23:57,963 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:23:57,963 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:23:57,963 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:23:57,963 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:23:57,963 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:23:57,964 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:23:57,964 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:23:57,964 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:23:57,964 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:23:57,964 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:23:57,965 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:23:57,965 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:23:57,965 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-03-04 16:23:57,965 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:23:57,965 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:23:57,965 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:23:57,966 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:23:58,017 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:23:58,031 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:23:58,037 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:23:58,039 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:23:58,039 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:23:58,040 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-limited.bpl [2019-03-04 16:23:58,040 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-limited.bpl' [2019-03-04 16:23:58,076 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:23:58,077 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:23:58,078 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:23:58,078 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:23:58,078 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:23:58,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:58" (1/1) ... [2019-03-04 16:23:58,106 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:58" (1/1) ... [2019-03-04 16:23:58,137 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:23:58,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:23:58,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:23:58,138 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:23:58,149 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:58" (1/1) ... [2019-03-04 16:23:58,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:58" (1/1) ... [2019-03-04 16:23:58,151 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:58" (1/1) ... [2019-03-04 16:23:58,151 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:58" (1/1) ... [2019-03-04 16:23:58,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:58" (1/1) ... [2019-03-04 16:23:58,159 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:58" (1/1) ... [2019-03-04 16:23:58,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:58" (1/1) ... [2019-03-04 16:23:58,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:23:58,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:23:58,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:23:58,162 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:23:58,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:58" (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 [2019-03-04 16:23:58,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:23:58,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:23:58,500 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:23:58,500 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-03-04 16:23:58,502 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:23:58 BoogieIcfgContainer [2019-03-04 16:23:58,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:23:58,503 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:23:58,504 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:23:58,508 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:23:58,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:58" (1/2) ... [2019-03-04 16:23:58,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eff2ae3 and model type speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:23:58, skipping insertion in model container [2019-03-04 16:23:58,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:23:58" (2/2) ... [2019-03-04 16:23:58,511 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-2-limited.bpl [2019-03-04 16:23:58,522 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:23:58,532 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-03-04 16:23:58,548 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-03-04 16:23:58,583 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-03-04 16:23:58,584 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:23:58,584 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:23:58,584 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:23:58,584 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:23:58,585 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:23:58,585 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:23:58,585 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:23:58,585 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:23:58,599 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-03-04 16:23:58,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-03-04 16:23:58,604 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:58,605 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-03-04 16:23:58,608 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:58,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:58,614 INFO L82 PathProgramCache]: Analyzing trace with hash 972, now seen corresponding path program 1 times [2019-03-04 16:23:58,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:58,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:58,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:58,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:58,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:58,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:58,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:23:58,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:23:58,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:23:58,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:23:58,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:23:58,795 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-03-04 16:23:58,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:58,969 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-03-04 16:23:58,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:23:58,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-03-04 16:23:58,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:58,987 INFO L225 Difference]: With dead ends: 13 [2019-03-04 16:23:58,987 INFO L226 Difference]: Without dead ends: 8 [2019-03-04 16:23:58,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:23:59,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-03-04 16:23:59,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 6. [2019-03-04 16:23:59,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-03-04 16:23:59,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-03-04 16:23:59,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 2 [2019-03-04 16:23:59,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:59,043 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-03-04 16:23:59,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:23:59,043 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2019-03-04 16:23:59,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:23:59,044 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:59,044 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:23:59,044 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:59,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:59,044 INFO L82 PathProgramCache]: Analyzing trace with hash 29988, now seen corresponding path program 1 times [2019-03-04 16:23:59,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:59,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:59,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:59,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:59,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:59,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:59,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:59,129 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -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 [2019-03-04 16:23:59,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:59,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-03-04 16:23:59,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:59,233 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-03-04 16:23:59,253 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:23:59,255 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-03-04 16:23:59,256 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:59,306 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:23:59,322 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:23:59,322 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2019-03-04 16:23:59,362 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:23:59,377 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-03-04 16:23:59,379 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:59,419 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:23:59,420 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-03-04 16:23:59,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:59,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:59,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:23:59,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:23:59,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:23:59,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:23:59,486 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 6 states. [2019-03-04 16:23:59,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:59,649 INFO L93 Difference]: Finished difference Result 13 states and 19 transitions. [2019-03-04 16:23:59,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:23:59,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:23:59,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:59,650 INFO L225 Difference]: With dead ends: 13 [2019-03-04 16:23:59,651 INFO L226 Difference]: Without dead ends: 12 [2019-03-04 16:23:59,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:23:59,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-03-04 16:23:59,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-03-04 16:23:59,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-03-04 16:23:59,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2019-03-04 16:23:59,655 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 15 transitions. Word has length 3 [2019-03-04 16:23:59,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:59,656 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 15 transitions. [2019-03-04 16:23:59,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:23:59,656 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 15 transitions. [2019-03-04 16:23:59,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:23:59,657 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:59,657 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:23:59,657 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:59,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:59,657 INFO L82 PathProgramCache]: Analyzing trace with hash 30050, now seen corresponding path program 1 times [2019-03-04 16:23:59,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:59,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:59,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:59,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:59,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:59,913 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-03-04 16:23:59,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:59,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:59,933 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:23:59,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:59,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-03-04 16:23:59,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:59,967 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-03-04 16:23:59,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:23:59,984 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-03-04 16:23:59,985 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:59,998 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:00,013 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:00,014 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:14 [2019-03-04 16:24:00,036 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:00,037 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-03-04 16:24:00,038 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:00,050 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:00,051 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:16 [2019-03-04 16:24:00,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:00,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:00,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:00,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:00,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:00,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:00,101 INFO L87 Difference]: Start difference. First operand 8 states and 15 transitions. Second operand 6 states. [2019-03-04 16:24:00,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:00,319 INFO L93 Difference]: Finished difference Result 17 states and 26 transitions. [2019-03-04 16:24:00,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:00,320 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:24:00,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:00,322 INFO L225 Difference]: With dead ends: 17 [2019-03-04 16:24:00,322 INFO L226 Difference]: Without dead ends: 14 [2019-03-04 16:24:00,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:24:00,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-03-04 16:24:00,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 9. [2019-03-04 16:24:00,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-03-04 16:24:00,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 17 transitions. [2019-03-04 16:24:00,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 17 transitions. Word has length 3 [2019-03-04 16:24:00,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:00,328 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 17 transitions. [2019-03-04 16:24:00,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:00,328 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 17 transitions. [2019-03-04 16:24:00,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:00,329 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:00,329 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:00,329 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:00,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:00,330 INFO L82 PathProgramCache]: Analyzing trace with hash 929672, now seen corresponding path program 1 times [2019-03-04 16:24:00,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:00,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:00,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:00,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:00,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:00,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:24:00,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:24:00,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-03-04 16:24:00,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:24:00,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:24:00,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:24:00,425 INFO L87 Difference]: Start difference. First operand 9 states and 17 transitions. Second operand 4 states. [2019-03-04 16:24:00,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:00,486 INFO L93 Difference]: Finished difference Result 12 states and 21 transitions. [2019-03-04 16:24:00,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:24:00,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:24:00,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:00,491 INFO L225 Difference]: With dead ends: 12 [2019-03-04 16:24:00,491 INFO L226 Difference]: Without dead ends: 10 [2019-03-04 16:24:00,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:24:00,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-03-04 16:24:00,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-03-04 16:24:00,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-03-04 16:24:00,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2019-03-04 16:24:00,497 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 18 transitions. Word has length 4 [2019-03-04 16:24:00,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:00,498 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 18 transitions. [2019-03-04 16:24:00,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:24:00,498 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 18 transitions. [2019-03-04 16:24:00,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:00,498 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:00,498 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:00,499 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:00,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:00,499 INFO L82 PathProgramCache]: Analyzing trace with hash 931406, now seen corresponding path program 1 times [2019-03-04 16:24:00,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:00,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:00,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:00,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:00,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:00,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:00,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:00,633 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:00,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:00,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:24:00,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:00,663 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-03-04 16:24:00,671 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:00,673 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-03-04 16:24:00,674 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:00,682 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:00,717 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:00,717 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:14 [2019-03-04 16:24:00,763 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:00,764 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-03-04 16:24:00,765 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:00,856 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:00,856 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:16 [2019-03-04 16:24:01,064 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:01,065 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-03-04 16:24:01,066 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:01,075 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:01,075 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-03-04 16:24:01,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:01,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:01,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:01,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:01,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:01,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:01,132 INFO L87 Difference]: Start difference. First operand 10 states and 18 transitions. Second operand 8 states. [2019-03-04 16:24:01,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:01,316 INFO L93 Difference]: Finished difference Result 20 states and 32 transitions. [2019-03-04 16:24:01,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:24:01,316 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:01,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:01,318 INFO L225 Difference]: With dead ends: 20 [2019-03-04 16:24:01,318 INFO L226 Difference]: Without dead ends: 19 [2019-03-04 16:24:01,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:24:01,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-03-04 16:24:01,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 12. [2019-03-04 16:24:01,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-03-04 16:24:01,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2019-03-04 16:24:01,325 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 24 transitions. Word has length 4 [2019-03-04 16:24:01,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:01,325 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 24 transitions. [2019-03-04 16:24:01,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:01,325 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 24 transitions. [2019-03-04 16:24:01,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:01,326 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:01,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:01,326 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:01,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:01,327 INFO L82 PathProgramCache]: Analyzing trace with hash 931594, now seen corresponding path program 1 times [2019-03-04 16:24:01,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:01,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:01,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:01,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:01,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:01,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:01,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:01,363 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:01,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:01,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 3 conjunts are in the unsatisfiable core [2019-03-04 16:24:01,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:01,389 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-03-04 16:24:01,403 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 14 [2019-03-04 16:24:01,404 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:01,410 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:01,419 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:01,419 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-03-04 16:24:01,427 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-03-04 16:24:01,427 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:01,430 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:01,430 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-03-04 16:24:01,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:01,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:01,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2019-03-04 16:24:01,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:24:01,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:24:01,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:24:01,464 INFO L87 Difference]: Start difference. First operand 12 states and 24 transitions. Second operand 5 states. [2019-03-04 16:24:01,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:01,514 INFO L93 Difference]: Finished difference Result 15 states and 26 transitions. [2019-03-04 16:24:01,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:01,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-03-04 16:24:01,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:01,516 INFO L225 Difference]: With dead ends: 15 [2019-03-04 16:24:01,516 INFO L226 Difference]: Without dead ends: 12 [2019-03-04 16:24:01,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:24:01,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-03-04 16:24:01,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-03-04 16:24:01,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-03-04 16:24:01,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 22 transitions. [2019-03-04 16:24:01,522 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 22 transitions. Word has length 4 [2019-03-04 16:24:01,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:01,522 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 22 transitions. [2019-03-04 16:24:01,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:24:01,522 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 22 transitions. [2019-03-04 16:24:01,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:01,522 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:01,523 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-03-04 16:24:01,523 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:01,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:01,523 INFO L82 PathProgramCache]: Analyzing trace with hash 28813922, now seen corresponding path program 2 times [2019-03-04 16:24:01,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:01,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:01,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:01,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:01,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:01,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:01,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:01,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:01,704 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:01,709 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:01,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:01,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:24:01,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:01,719 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-03-04 16:24:01,727 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:01,729 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-03-04 16:24:01,730 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:01,734 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:01,745 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:01,746 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:14 [2019-03-04 16:24:01,800 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:01,802 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-03-04 16:24:01,803 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:01,881 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:01,882 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-03-04 16:24:01,903 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:01,904 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-03-04 16:24:01,904 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:01,913 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:01,914 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-03-04 16:24:01,945 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:01,947 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-03-04 16:24:01,948 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:01,966 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:01,967 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:16 [2019-03-04 16:24:01,986 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:02,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:02,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:02,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:02,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:02,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:02,007 INFO L87 Difference]: Start difference. First operand 12 states and 22 transitions. Second operand 10 states. [2019-03-04 16:24:02,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:02,180 INFO L93 Difference]: Finished difference Result 20 states and 37 transitions. [2019-03-04 16:24:02,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:24:02,180 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:24:02,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:02,181 INFO L225 Difference]: With dead ends: 20 [2019-03-04 16:24:02,181 INFO L226 Difference]: Without dead ends: 19 [2019-03-04 16:24:02,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:24:02,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-03-04 16:24:02,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 7. [2019-03-04 16:24:02,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-03-04 16:24:02,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2019-03-04 16:24:02,186 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 11 transitions. Word has length 5 [2019-03-04 16:24:02,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:02,186 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 11 transitions. [2019-03-04 16:24:02,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:02,186 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 11 transitions. [2019-03-04 16:24:02,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:02,187 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:02,187 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:02,187 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:02,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:02,187 INFO L82 PathProgramCache]: Analyzing trace with hash 28815970, now seen corresponding path program 1 times [2019-03-04 16:24:02,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:02,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:02,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:02,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:02,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:02,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:24:02,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:02,311 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:02,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:02,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:24:02,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:02,361 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-03-04 16:24:02,365 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:02,367 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-03-04 16:24:02,368 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:02,381 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:02,408 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:02,408 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:14 [2019-03-04 16:24:02,435 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:02,437 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-03-04 16:24:02,438 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:02,447 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:02,448 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-03-04 16:24:02,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:02,491 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-03-04 16:24:02,492 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:02,501 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:02,502 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:16 [2019-03-04 16:24:02,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:02,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:02,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:02,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:02,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:02,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:02,549 INFO L87 Difference]: Start difference. First operand 7 states and 11 transitions. Second operand 8 states. [2019-03-04 16:24:02,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:02,715 INFO L93 Difference]: Finished difference Result 10 states and 17 transitions. [2019-03-04 16:24:02,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:24:02,716 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:24:02,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:02,716 INFO L225 Difference]: With dead ends: 10 [2019-03-04 16:24:02,716 INFO L226 Difference]: Without dead ends: 0 [2019-03-04 16:24:02,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:02,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-03-04 16:24:02,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-03-04 16:24:02,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-03-04 16:24:02,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-03-04 16:24:02,718 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-03-04 16:24:02,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:02,718 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-03-04 16:24:02,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:02,718 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-03-04 16:24:02,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-03-04 16:24:02,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-03-04 16:24:03,523 WARN L181 SmtUtils]: Spent 743.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 26 [2019-03-04 16:24:03,527 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-03-04 16:24:03,528 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-03-04 16:24:03,528 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 33) no Hoare annotation was computed. [2019-03-04 16:24:03,528 INFO L444 ceAbstractionStarter]: At program point L26-1(lines 25 31) the Hoare annotation is: (let ((.cse0 (select |#memory_int| ULTIMATE.start_main_p2)) (.cse1 (select |#memory_int| ULTIMATE.start_main_p1))) (or (and (<= (+ .cse0 1) 0) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) ULTIMATE.start_main_p1))) (and (<= 1 .cse1) (<= .cse0 0)) (and (= .cse1 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= (select (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse1 1)) ULTIMATE.start_main_p2) 0)))) [2019-03-04 16:24:03,528 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 34) no Hoare annotation was computed. [2019-03-04 16:24:03,529 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 36) no Hoare annotation was computed. [2019-03-04 16:24:03,529 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-03-04 16:24:03,541 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 04:24:03 BoogieIcfgContainer [2019-03-04 16:24:03,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-03-04 16:24:03,542 INFO L168 Benchmark]: Toolchain (without parser) took 5465.82 ms. Allocated memory was 134.7 MB in the beginning and 197.7 MB in the end (delta: 62.9 MB). Free memory was 106.8 MB in the beginning and 73.7 MB in the end (delta: 33.1 MB). Peak memory consumption was 96.0 MB. Max. memory is 7.1 GB. [2019-03-04 16:24:03,543 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 134.7 MB. Free memory is still 108.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:24:03,544 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.51 ms. Allocated memory is still 134.7 MB. Free memory was 106.8 MB in the beginning and 104.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-03-04 16:24:03,545 INFO L168 Benchmark]: Boogie Preprocessor took 23.85 ms. Allocated memory is still 134.7 MB. Free memory was 104.6 MB in the beginning and 103.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-03-04 16:24:03,546 INFO L168 Benchmark]: RCFGBuilder took 340.60 ms. Allocated memory is still 134.7 MB. Free memory was 103.3 MB in the beginning and 94.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-03-04 16:24:03,546 INFO L168 Benchmark]: TraceAbstraction took 5037.92 ms. Allocated memory was 134.7 MB in the beginning and 197.7 MB in the end (delta: 62.9 MB). Free memory was 93.9 MB in the beginning and 73.7 MB in the end (delta: 20.2 MB). Peak memory consumption was 83.2 MB. Max. memory is 7.1 GB. [2019-03-04 16:24:03,551 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 134.7 MB. Free memory is still 108.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.51 ms. Allocated memory is still 134.7 MB. Free memory was 106.8 MB in the beginning and 104.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.85 ms. Allocated memory is still 134.7 MB. Free memory was 104.6 MB in the beginning and 103.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 340.60 ms. Allocated memory is still 134.7 MB. Free memory was 103.3 MB in the beginning and 94.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5037.92 ms. Allocated memory was 134.7 MB in the beginning and 197.7 MB in the end (delta: 62.9 MB). Free memory was 93.9 MB in the beginning and 73.7 MB in the end (delta: 20.2 MB). Peak memory consumption was 83.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 33]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 34]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((#memory_int[p2] + 1 <= 0 && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) || (1 <= #memory_int[p1] && #memory_int[p2] <= 0)) || ((#memory_int[p1] == 0 && p1 < p2) && #memory_int[p1 := #memory_int[p1] + 1][p2] == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 2 error locations. SAFE Result, 4.9s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 18 SDtfs, 45 SDslu, 1 SDs, 0 SdLazy, 253 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 30 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 6 NumberOfFragments, 53 HoareAnnotationTreeSize, 1 FomulaSimplifications, 309 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 407 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 40 ConstructedInterpolants, 9 QuantifiedInterpolants, 1527 SizeOfPredicates, 6 NumberOfNonLiveVariables, 90 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 3/31 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...