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-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:23:58,932 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:23:58,934 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:23:58,948 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:23:58,949 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:23:58,950 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:23:58,951 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:23:58,953 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:23:58,955 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:23:58,956 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:23:58,956 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:23:58,957 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:23:58,958 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:23:58,960 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:23:58,962 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:23:58,963 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:23:58,964 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:23:58,966 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:23:58,968 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:23:58,969 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:23:58,972 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:23:58,973 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:23:58,977 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:23:58,977 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:23:58,978 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:23:58,978 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:23:58,979 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:23:58,980 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:23:58,983 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:23:58,985 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:23:58,985 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:23:58,987 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:23:58,987 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:23:58,988 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:23:58,989 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:23:58,989 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:23:58,990 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:59,015 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:23:59,015 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:23:59,016 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:23:59,016 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:23:59,016 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:23:59,017 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:23:59,017 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:23:59,017 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:23:59,017 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:23:59,017 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:23:59,018 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2019-03-04 16:23:59,018 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:23:59,019 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:23:59,019 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:23:59,020 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:23:59,020 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:23:59,020 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:23:59,020 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:23:59,020 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:23:59,021 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:23:59,022 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:23:59,022 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:23:59,023 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:23:59,023 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:23:59,023 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:23:59,023 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:23:59,023 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:23:59,024 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:23:59,024 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:23:59,024 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:23:59,024 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:23:59,024 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:23:59,025 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:23:59,025 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:23:59,025 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-03-04 16:23:59,025 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:23:59,025 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:23:59,026 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:23:59,026 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:23:59,084 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:23:59,099 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:23:59,103 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:23:59,105 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:23:59,106 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:23:59,107 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-unlimited.bpl [2019-03-04 16:23:59,107 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-unlimited.bpl' [2019-03-04 16:23:59,152 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:23:59,154 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:23:59,155 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:23:59,155 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:23:59,156 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:23:59,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:59" (1/1) ... [2019-03-04 16:23:59,189 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:59" (1/1) ... [2019-03-04 16:23:59,216 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:23:59,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:23:59,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:23:59,218 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:23:59,230 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:59" (1/1) ... [2019-03-04 16:23:59,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:59" (1/1) ... [2019-03-04 16:23:59,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:59" (1/1) ... [2019-03-04 16:23:59,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:59" (1/1) ... [2019-03-04 16:23:59,236 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:59" (1/1) ... [2019-03-04 16:23:59,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:59" (1/1) ... [2019-03-04 16:23:59,241 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:59" (1/1) ... [2019-03-04 16:23:59,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:23:59,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:23:59,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:23:59,244 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:23:59,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:59" (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:59,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:23:59,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:23:59,563 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:23:59,563 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-03-04 16:23:59,564 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:23:59 BoogieIcfgContainer [2019-03-04 16:23:59,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:23:59,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:23:59,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:23:59,569 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:23:59,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:59" (1/2) ... [2019-03-04 16:23:59,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb005fe and model type speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:23:59, skipping insertion in model container [2019-03-04 16:23:59,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:23:59" (2/2) ... [2019-03-04 16:23:59,573 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-2-unlimited.bpl [2019-03-04 16:23:59,583 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:23:59,591 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-03-04 16:23:59,607 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-03-04 16:23:59,640 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-03-04 16:23:59,641 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:23:59,641 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:23:59,641 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:23:59,641 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:23:59,641 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:23:59,642 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:23:59,642 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:23:59,642 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:23:59,659 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-03-04 16:23:59,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-03-04 16:23:59,673 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:59,674 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-03-04 16:23:59,676 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:59,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:59,686 INFO L82 PathProgramCache]: Analyzing trace with hash 972, now seen corresponding path program 1 times [2019-03-04 16:23:59,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:59,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:59,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:59,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:59,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:59,856 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:59,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:23:59,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:23:59,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:23:59,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:23:59,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:23:59,876 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-03-04 16:24:00,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:00,020 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-03-04 16:24:00,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:24:00,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-03-04 16:24:00,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:00,053 INFO L225 Difference]: With dead ends: 13 [2019-03-04 16:24:00,057 INFO L226 Difference]: Without dead ends: 8 [2019-03-04 16:24:00,060 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:24:00,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-03-04 16:24:00,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 6. [2019-03-04 16:24:00,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-03-04 16:24:00,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-03-04 16:24:00,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 2 [2019-03-04 16:24:00,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:00,096 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-03-04 16:24:00,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:24:00,097 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2019-03-04 16:24:00,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:24:00,097 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:00,097 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:24:00,098 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:00,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:00,098 INFO L82 PathProgramCache]: Analyzing trace with hash 29988, now seen corresponding path program 1 times [2019-03-04 16:24:00,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:00,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:00,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:00,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:00,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:00,209 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,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:00,209 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:24:00,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:00,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2019-03-04 16:24:00,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:00,309 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,376 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:00,377 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:00,388 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,422 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,422 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-03-04 16:24:00,435 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:00,436 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:00,439 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,439 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-03-04 16:24:00,452 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,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:00,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2019-03-04 16:24:00,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:24:00,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:24:00,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:24:00,485 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 5 states. [2019-03-04 16:24:00,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:00,609 INFO L93 Difference]: Finished difference Result 13 states and 19 transitions. [2019-03-04 16:24:00,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:00,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 3 [2019-03-04 16:24:00,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:00,611 INFO L225 Difference]: With dead ends: 13 [2019-03-04 16:24:00,611 INFO L226 Difference]: Without dead ends: 12 [2019-03-04 16:24:00,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:24:00,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-03-04 16:24:00,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-03-04 16:24:00,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-03-04 16:24:00,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2019-03-04 16:24:00,616 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 15 transitions. Word has length 3 [2019-03-04 16:24:00,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:00,616 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 15 transitions. [2019-03-04 16:24:00,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:24:00,616 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 15 transitions. [2019-03-04 16:24:00,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:24:00,616 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:00,617 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:24:00,617 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:00,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:00,617 INFO L82 PathProgramCache]: Analyzing trace with hash 30050, now seen corresponding path program 1 times [2019-03-04 16:24:00,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:00,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:00,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:00,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:00,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:00,739 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,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:00,740 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:24:00,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:00,759 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:24:00,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:00,795 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,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:00,846 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,847 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:00,919 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,988 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-03-04 16:24:00,988 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:00,998 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:01,036 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:01,037 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-03-04 16:24:01,082 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,084 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:01,098 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,099 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:13 [2019-03-04 16:24:01,163 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,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:01,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2019-03-04 16:24:01,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:24:01,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:24:01,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-03-04 16:24:01,185 INFO L87 Difference]: Start difference. First operand 8 states and 15 transitions. Second operand 6 states. [2019-03-04 16:24:01,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:01,413 INFO L93 Difference]: Finished difference Result 17 states and 26 transitions. [2019-03-04 16:24:01,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:01,413 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:24:01,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:01,415 INFO L225 Difference]: With dead ends: 17 [2019-03-04 16:24:01,415 INFO L226 Difference]: Without dead ends: 14 [2019-03-04 16:24:01,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:24:01,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-03-04 16:24:01,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 9. [2019-03-04 16:24:01,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-03-04 16:24:01,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 17 transitions. [2019-03-04 16:24:01,421 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 17 transitions. Word has length 3 [2019-03-04 16:24:01,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:01,422 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 17 transitions. [2019-03-04 16:24:01,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:24:01,422 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 17 transitions. [2019-03-04 16:24:01,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:01,422 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:01,423 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:01,423 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:01,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:01,423 INFO L82 PathProgramCache]: Analyzing trace with hash 929672, now seen corresponding path program 1 times [2019-03-04 16:24:01,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:01,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:01,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:01,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:01,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:01,491 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:01,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:24:01,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-03-04 16:24:01,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:24:01,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:24:01,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:24:01,493 INFO L87 Difference]: Start difference. First operand 9 states and 17 transitions. Second operand 4 states. [2019-03-04 16:24:01,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:01,576 INFO L93 Difference]: Finished difference Result 12 states and 21 transitions. [2019-03-04 16:24:01,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:24:01,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:24:01,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:01,577 INFO L225 Difference]: With dead ends: 12 [2019-03-04 16:24:01,577 INFO L226 Difference]: Without dead ends: 10 [2019-03-04 16:24:01,577 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:01,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-03-04 16:24:01,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-03-04 16:24:01,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-03-04 16:24:01,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2019-03-04 16:24:01,582 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 18 transitions. Word has length 4 [2019-03-04 16:24:01,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:01,582 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 18 transitions. [2019-03-04 16:24:01,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:24:01,582 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 18 transitions. [2019-03-04 16:24:01,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:01,583 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:01,583 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:01,583 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:01,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:01,583 INFO L82 PathProgramCache]: Analyzing trace with hash 931406, now seen corresponding path program 1 times [2019-03-04 16:24:01,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:01,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:01,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:01,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:01,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:01,676 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,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:01,676 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:01,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:01,692 WARN L254 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:24:01,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:01,708 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-03-04 16:24:01,709 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:01,711 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,728 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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,734 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,735 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:01,746 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:01,753 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:01,754 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-03-04 16:24:01,807 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,808 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:01,821 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,822 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:13 [2019-03-04 16:24:02,028 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 25 [2019-03-04 16:24:02,030 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:02,137 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,137 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-03-04 16:24:02,225 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,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:02,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:02,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:02,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:02,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:02,247 INFO L87 Difference]: Start difference. First operand 10 states and 18 transitions. Second operand 8 states. [2019-03-04 16:24:02,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:02,495 INFO L93 Difference]: Finished difference Result 22 states and 33 transitions. [2019-03-04 16:24:02,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:24:02,496 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:24:02,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:02,497 INFO L225 Difference]: With dead ends: 22 [2019-03-04 16:24:02,498 INFO L226 Difference]: Without dead ends: 21 [2019-03-04 16:24:02,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:24:02,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-03-04 16:24:02,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 10. [2019-03-04 16:24:02,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-03-04 16:24:02,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2019-03-04 16:24:02,504 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 18 transitions. Word has length 4 [2019-03-04 16:24:02,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:02,504 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 18 transitions. [2019-03-04 16:24:02,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:02,505 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 18 transitions. [2019-03-04 16:24:02,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:24:02,505 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:02,505 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:24:02,506 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:02,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:02,506 INFO L82 PathProgramCache]: Analyzing trace with hash 931594, now seen corresponding path program 1 times [2019-03-04 16:24:02,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:02,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:02,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:02,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:02,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:02,539 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:02,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:02,540 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:02,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:02,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 3 conjunts are in the unsatisfiable core [2019-03-04 16:24:02,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:02,567 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,583 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:02,584 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:02,593 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,619 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,619 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-03-04 16:24:02,633 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:02,634 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:02,639 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,639 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-03-04 16:24:02,648 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:02,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:02,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2019-03-04 16:24:02,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-03-04 16:24:02,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-03-04 16:24:02,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:24:02,668 INFO L87 Difference]: Start difference. First operand 10 states and 18 transitions. Second operand 5 states. [2019-03-04 16:24:02,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:02,723 INFO L93 Difference]: Finished difference Result 14 states and 23 transitions. [2019-03-04 16:24:02,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:24:02,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-03-04 16:24:02,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:02,725 INFO L225 Difference]: With dead ends: 14 [2019-03-04 16:24:02,725 INFO L226 Difference]: Without dead ends: 11 [2019-03-04 16:24:02,726 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:02,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-03-04 16:24:02,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-03-04 16:24:02,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-03-04 16:24:02,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-03-04 16:24:02,730 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 4 [2019-03-04 16:24:02,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:02,730 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-03-04 16:24:02,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-03-04 16:24:02,730 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-03-04 16:24:02,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:02,730 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:02,731 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-03-04 16:24:02,731 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:02,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:02,731 INFO L82 PathProgramCache]: Analyzing trace with hash 28813922, now seen corresponding path program 2 times [2019-03-04 16:24:02,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:02,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:02,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:02,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:02,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:02,841 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:02,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:02,842 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:02,855 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:24:02,861 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:24:02,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:24:02,861 WARN L254 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:24:02,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:02,883 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-03-04 16:24:02,883 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:02,888 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,902 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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,905 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,906 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:02,913 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:02,921 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:02,922 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-03-04 16:24:02,967 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,968 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:02,979 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,980 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-03-04 16:24:03,034 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:24:03,035 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:03,046 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:03,046 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:11 [2019-03-04 16:24:03,085 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 19 [2019-03-04 16:24:03,086 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:03,097 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:03,097 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:13 [2019-03-04 16:24:03,123 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:03,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:03,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:24:03,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:24:03,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:24:03,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:03,143 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 10 states. [2019-03-04 16:24:03,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:03,354 INFO L93 Difference]: Finished difference Result 18 states and 32 transitions. [2019-03-04 16:24:03,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:24:03,354 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:24:03,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:03,355 INFO L225 Difference]: With dead ends: 18 [2019-03-04 16:24:03,355 INFO L226 Difference]: Without dead ends: 17 [2019-03-04 16:24:03,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:24:03,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-03-04 16:24:03,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 7. [2019-03-04 16:24:03,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-03-04 16:24:03,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2019-03-04 16:24:03,360 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 11 transitions. Word has length 5 [2019-03-04 16:24:03,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:03,360 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 11 transitions. [2019-03-04 16:24:03,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:24:03,360 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 11 transitions. [2019-03-04 16:24:03,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:24:03,360 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:03,361 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:24:03,361 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:03,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:03,361 INFO L82 PathProgramCache]: Analyzing trace with hash 28815970, now seen corresponding path program 1 times [2019-03-04 16:24:03,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:03,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:03,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:03,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:03,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:03,429 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:03,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:03,430 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:03,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:03,445 WARN L254 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:24:03,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:03,453 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:03,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:24:03,466 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:03,466 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:03,479 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:03,498 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-03-04 16:24:03,499 INFO L309 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:03,502 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:03,513 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:24:03,514 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-03-04 16:24:03,530 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:03,531 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:03,537 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:03,537 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-03-04 16:24:03,582 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:24:03,583 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:03,590 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:03,590 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:13 [2019-03-04 16:24:03,603 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:03,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:03,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-03-04 16:24:03,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:24:03,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:24:03,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:24:03,623 INFO L87 Difference]: Start difference. First operand 7 states and 11 transitions. Second operand 8 states. [2019-03-04 16:24:03,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:03,739 INFO L93 Difference]: Finished difference Result 10 states and 17 transitions. [2019-03-04 16:24:03,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:24:03,739 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:24:03,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:03,739 INFO L225 Difference]: With dead ends: 10 [2019-03-04 16:24:03,740 INFO L226 Difference]: Without dead ends: 0 [2019-03-04 16:24:03,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:24:03,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-03-04 16:24:03,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-03-04 16:24:03,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-03-04 16:24:03,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-03-04 16:24:03,741 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-03-04 16:24:03,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:03,742 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-03-04 16:24:03,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:24:03,742 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-03-04 16:24:03,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-03-04 16:24:03,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-03-04 16:24:03,940 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 17 [2019-03-04 16:24:03,943 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-03-04 16:24:03,943 INFO L448 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2019-03-04 16:24:03,943 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-03-04 16:24:03,944 INFO L444 ceAbstractionStarter]: At program point L24-1(lines 23 29) the Hoare annotation is: (let ((.cse0 (select |#memory_int| ULTIMATE.start_main_p2))) (let ((.cse1 (<= .cse0 0))) (or (and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) ULTIMATE.start_main_p1)) .cse1) (and (<= 1 (select |#memory_int| ULTIMATE.start_main_p1)) .cse1)))) [2019-03-04 16:24:03,944 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 31) no Hoare annotation was computed. [2019-03-04 16:24:03,944 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 34) no Hoare annotation was computed. [2019-03-04 16:24:03,944 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 32) no Hoare annotation was computed. [2019-03-04 16:24:03,959 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 04:24:03 BoogieIcfgContainer [2019-03-04 16:24:03,960 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-03-04 16:24:03,961 INFO L168 Benchmark]: Toolchain (without parser) took 4807.78 ms. Allocated memory was 133.2 MB in the beginning and 196.1 MB in the end (delta: 62.9 MB). Free memory was 108.3 MB in the beginning and 83.2 MB in the end (delta: 25.1 MB). Peak memory consumption was 88.0 MB. Max. memory is 7.1 GB. [2019-03-04 16:24:03,962 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 133.2 MB. Free memory is still 109.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:24:03,963 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.90 ms. Allocated memory is still 133.2 MB. Free memory was 108.3 MB in the beginning and 106.2 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,964 INFO L168 Benchmark]: Boogie Preprocessor took 26.12 ms. Allocated memory is still 133.2 MB. Free memory was 106.2 MB in the beginning and 104.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:24:03,965 INFO L168 Benchmark]: RCFGBuilder took 320.86 ms. Allocated memory is still 133.2 MB. Free memory was 104.9 MB in the beginning and 95.7 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,965 INFO L168 Benchmark]: TraceAbstraction took 4394.06 ms. Allocated memory was 133.2 MB in the beginning and 196.1 MB in the end (delta: 62.9 MB). Free memory was 95.4 MB in the beginning and 83.2 MB in the end (delta: 12.2 MB). Peak memory consumption was 75.1 MB. Max. memory is 7.1 GB. [2019-03-04 16:24:03,970 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.23 ms. Allocated memory is still 133.2 MB. Free memory is still 109.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.90 ms. Allocated memory is still 133.2 MB. Free memory was 108.3 MB in the beginning and 106.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.12 ms. Allocated memory is still 133.2 MB. Free memory was 106.2 MB in the beginning and 104.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 320.86 ms. Allocated memory is still 133.2 MB. Free memory was 104.9 MB in the beginning and 95.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4394.06 ms. Allocated memory was 133.2 MB in the beginning and 196.1 MB in the end (delta: 62.9 MB). Free memory was 95.4 MB in the beginning and 83.2 MB in the end (delta: 12.2 MB). Peak memory consumption was 75.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 32]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 31]: 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: 23]: Loop Invariant Derived loop invariant: (0 == #memory_int[p2 := #memory_int[p2] + -1][p1] && #memory_int[p2] <= 0) || (1 <= #memory_int[p1] && #memory_int[p2] <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 2 error locations. SAFE Result, 4.3s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 18 SDtfs, 39 SDslu, 1 SDs, 0 SdLazy, 300 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=4, 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, 33 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 6 NumberOfFragments, 30 HoareAnnotationTreeSize, 1 FomulaSimplifications, 491 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 328 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 40 ConstructedInterpolants, 7 QuantifiedInterpolants, 1376 SizeOfPredicates, 14 NumberOfNonLiveVariables, 84 ConjunctsInSsa, 42 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...