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_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-8-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-08 14:04:56,817 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-08 14:04:56,822 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-08 14:04:56,837 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-08 14:04:56,838 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-08 14:04:56,839 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-08 14:04:56,840 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-08 14:04:56,842 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-08 14:04:56,844 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-08 14:04:56,845 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-08 14:04:56,846 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-08 14:04:56,846 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-08 14:04:56,847 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-08 14:04:56,848 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-08 14:04:56,849 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-08 14:04:56,850 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-08 14:04:56,851 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-08 14:04:56,853 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-08 14:04:56,855 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-08 14:04:56,857 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-08 14:04:56,858 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-08 14:04:56,859 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-08 14:04:56,862 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-08 14:04:56,862 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-08 14:04:56,862 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-08 14:04:56,863 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-08 14:04:56,864 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-08 14:04:56,865 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-08 14:04:56,866 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-08 14:04:56,867 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-08 14:04:56,867 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-08 14:04:56,868 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-08 14:04:56,868 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-08 14:04:56,870 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-08 14:04:56,871 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-08 14:04:56,872 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-08 14:04:56,872 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-08 14:04:56,890 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-08 14:04:56,890 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-08 14:04:56,893 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-08 14:04:56,894 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-08 14:04:56,894 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-08 14:04:56,894 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-08 14:04:56,894 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-08 14:04:56,894 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-08 14:04:56,895 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-08 14:04:56,895 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-08 14:04:56,895 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-08 14:04:56,895 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-08 14:04:56,895 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-08 14:04:56,895 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-08 14:04:56,897 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-08 14:04:56,897 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-08 14:04:56,897 INFO L133 SettingsManager]: * Use SBE=true [2019-01-08 14:04:56,897 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-08 14:04:56,897 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-08 14:04:56,898 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-08 14:04:56,898 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-08 14:04:56,898 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-08 14:04:56,898 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-08 14:04:56,898 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-08 14:04:56,899 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-08 14:04:56,901 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-08 14:04:56,901 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-08 14:04:56,901 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-08 14:04:56,901 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-08 14:04:56,902 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-08 14:04:56,902 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-08 14:04:56,902 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 14:04:56,902 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-08 14:04:56,903 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-08 14:04:56,903 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-08 14:04:56,903 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-08 14:04:56,903 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-08 14:04:56,903 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-08 14:04:56,904 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-08 14:04:56,904 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-08 14:04:56,941 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-08 14:04:56,956 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-08 14:04:56,962 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-08 14:04:56,964 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-08 14:04:56,964 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-08 14:04:56,965 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-8-limited.bpl [2019-01-08 14:04:56,965 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-8-limited.bpl' [2019-01-08 14:04:57,004 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-08 14:04:57,006 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-08 14:04:57,007 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-08 14:04:57,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-08 14:04:57,008 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-08 14:04:57,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:56" (1/1) ... [2019-01-08 14:04:57,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:56" (1/1) ... [2019-01-08 14:04:57,068 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-08 14:04:57,069 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-08 14:04:57,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-08 14:04:57,069 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-08 14:04:57,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:56" (1/1) ... [2019-01-08 14:04:57,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:56" (1/1) ... [2019-01-08 14:04:57,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:56" (1/1) ... [2019-01-08 14:04:57,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:56" (1/1) ... [2019-01-08 14:04:57,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:56" (1/1) ... [2019-01-08 14:04:57,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:56" (1/1) ... [2019-01-08 14:04:57,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:56" (1/1) ... [2019-01-08 14:04:57,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-08 14:04:57,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-08 14:04:57,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-08 14:04:57,098 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-08 14:04:57,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:56" (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:8192 -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:8192 -smt2 -in -t:2000 [2019-01-08 14:04:57,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-08 14:04:57,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-08 14:04:57,569 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-08 14:04:57,569 INFO L286 CfgBuilder]: Removed 19 assue(true) statements. [2019-01-08 14:04:57,571 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 02:04:57 BoogieIcfgContainer [2019-01-08 14:04:57,571 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-08 14:04:57,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-08 14:04:57,573 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-08 14:04:57,587 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-08 14:04:57,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:56" (1/2) ... [2019-01-08 14:04:57,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f5fd07 and model type speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 02:04:57, skipping insertion in model container [2019-01-08 14:04:57,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 02:04:57" (2/2) ... [2019-01-08 14:04:57,596 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-8-limited.bpl [2019-01-08 14:04:57,622 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-08 14:04:57,640 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-01-08 14:04:57,685 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-01-08 14:04:57,729 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-08 14:04:57,729 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-08 14:04:57,729 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-08 14:04:57,729 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-08 14:04:57,729 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-08 14:04:57,730 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-08 14:04:57,730 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-08 14:04:57,730 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-08 14:04:57,750 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-01-08 14:04:57,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-08 14:04:57,756 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:57,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-08 14:04:57,760 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:57,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:57,767 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2019-01-08 14:04:57,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:57,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:57,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:57,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:57,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:57,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:57,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:04:57,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-08 14:04:57,990 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:04:57,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 14:04:58,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 14:04:58,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 14:04:58,014 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-01-08 14:04:58,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:58,273 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2019-01-08 14:04:58,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:04:58,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-08 14:04:58,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:58,291 INFO L225 Difference]: With dead ends: 37 [2019-01-08 14:04:58,291 INFO L226 Difference]: Without dead ends: 32 [2019-01-08 14:04:58,294 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-01-08 14:04:58,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-08 14:04:58,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2019-01-08 14:04:58,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-08 14:04:58,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2019-01-08 14:04:58,337 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 2 [2019-01-08 14:04:58,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:58,338 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2019-01-08 14:04:58,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 14:04:58,339 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2019-01-08 14:04:58,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:04:58,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:58,340 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:04:58,340 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:58,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:58,341 INFO L82 PathProgramCache]: Analyzing trace with hash 30818, now seen corresponding path program 1 times [2019-01-08 14:04:58,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:58,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:58,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:58,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:58,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:58,685 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-08 14:04:58,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:58,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:58,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:58,724 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-08 14:04:58,726 INFO L207 CegarAbsIntRunner]: [0], [32], [35] [2019-01-08 14:04:58,765 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:58,766 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:58,849 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:58,851 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 98 root evaluator evaluations with a maximum evaluation depth of 3. Performed 98 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-08 14:04:58,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:58,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:58,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:58,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:58,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:58,871 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:58,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:59,440 WARN L181 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-01-08 14:04:59,464 INFO L478 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 27 treesize of output 30 [2019-01-08 14:04:59,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,506 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2019-01-08 14:04:59,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-01-08 14:04:59,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-01-08 14:04:59,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-08 14:04:59,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,735 INFO L303 Elim1Store]: Index analysis took 105 ms [2019-01-08 14:04:59,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-01-08 14:04:59,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-01-08 14:04:59,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:59,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 153 [2019-01-08 14:04:59,814 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,093 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,401 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,476 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,519 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,579 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 52 [2019-01-08 14:05:00,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2019-01-08 14:05:00,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-08 14:05:00,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 62 [2019-01-08 14:05:00,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-08 14:05:01,023 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-01-08 14:05:01,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,150 INFO L303 Elim1Store]: Index analysis took 123 ms [2019-01-08 14:05:01,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-08 14:05:01,153 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:01,156 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:01,160 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:01,164 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:01,166 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:01,169 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:01,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:01,211 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:94, output treesize:62 [2019-01-08 14:05:01,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 159 [2019-01-08 14:05:01,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:01,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:01,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:72, output treesize:62 [2019-01-08 14:05:04,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-01-08 14:05:04,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:04,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:04,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:04,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:05:04,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:04,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:05:04,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:05:04,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=31, Unknown=1, NotChecked=0, Total=56 [2019-01-08 14:05:04,208 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 6 states. [2019-01-08 14:05:47,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:47,089 INFO L93 Difference]: Finished difference Result 63 states and 92 transitions. [2019-01-08 14:05:47,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:05:47,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-08 14:05:47,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:47,093 INFO L225 Difference]: With dead ends: 63 [2019-01-08 14:05:47,093 INFO L226 Difference]: Without dead ends: 60 [2019-01-08 14:05:47,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=31, Invalid=40, Unknown=1, NotChecked=0, Total=72 [2019-01-08 14:05:47,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-08 14:05:47,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 25. [2019-01-08 14:05:47,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-08 14:05:47,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 53 transitions. [2019-01-08 14:05:47,102 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 53 transitions. Word has length 3 [2019-01-08 14:05:47,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:47,102 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 53 transitions. [2019-01-08 14:05:47,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:05:47,102 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 53 transitions. [2019-01-08 14:05:47,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:05:47,103 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:47,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:05:47,103 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:47,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:47,104 INFO L82 PathProgramCache]: Analyzing trace with hash 30384, now seen corresponding path program 1 times [2019-01-08 14:05:47,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:47,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:47,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:47,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:47,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:47,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:47,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:47,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:47,209 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-08 14:05:47,209 INFO L207 CegarAbsIntRunner]: [0], [18], [35] [2019-01-08 14:05:47,213 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:47,213 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:47,227 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:47,227 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 98 root evaluator evaluations with a maximum evaluation depth of 3. Performed 98 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-08 14:05:47,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:47,227 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:47,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:47,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-01-08 14:05:47,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:47,237 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:47,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:47,341 INFO L478 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 27 treesize of output 30 [2019-01-08 14:05:47,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,349 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2019-01-08 14:05:47,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-01-08 14:05:47,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-01-08 14:05:47,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-08 14:05:47,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-01-08 14:05:47,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,644 INFO L303 Elim1Store]: Index analysis took 147 ms [2019-01-08 14:05:47,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-01-08 14:05:47,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:47,803 INFO L303 Elim1Store]: Index analysis took 150 ms [2019-01-08 14:05:47,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 153 [2019-01-08 14:05:47,806 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:47,950 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:48,000 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:48,038 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:48,074 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:48,106 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:48,130 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:48,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:48,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 52 [2019-01-08 14:05:48,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2019-01-08 14:05:48,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-08 14:05:48,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 62 [2019-01-08 14:05:48,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-08 14:05:48,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-08 14:05:48,684 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:48,687 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:48,703 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:48,705 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:48,707 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:48,711 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:48,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:48,747 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:94, output treesize:62 [2019-01-08 14:05:48,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:48,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 153 [2019-01-08 14:05:48,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:48,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:48,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:72, output treesize:62 [2019-01-08 14:05:51,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:51,443 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:51,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:51,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:51,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:05:51,472 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:51,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:05:51,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:05:51,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=31, Unknown=1, NotChecked=0, Total=56 [2019-01-08 14:05:51,473 INFO L87 Difference]: Start difference. First operand 25 states and 53 transitions. Second operand 6 states. [2019-01-08 14:06:32,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:32,070 INFO L93 Difference]: Finished difference Result 62 states and 99 transitions. [2019-01-08 14:06:32,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:06:32,071 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-08 14:06:32,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:32,072 INFO L225 Difference]: With dead ends: 62 [2019-01-08 14:06:32,072 INFO L226 Difference]: Without dead ends: 60 [2019-01-08 14:06:32,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=31, Invalid=40, Unknown=1, NotChecked=0, Total=72 [2019-01-08 14:06:32,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-08 14:06:32,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 26. [2019-01-08 14:06:32,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-08 14:06:32,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 61 transitions. [2019-01-08 14:06:32,079 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 61 transitions. Word has length 3 [2019-01-08 14:06:32,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:32,079 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 61 transitions. [2019-01-08 14:06:32,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:06:32,080 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 61 transitions. [2019-01-08 14:06:32,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:06:32,080 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:32,080 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:06:32,081 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:32,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:32,081 INFO L82 PathProgramCache]: Analyzing trace with hash 30944, now seen corresponding path program 1 times [2019-01-08 14:06:32,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:32,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:32,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:32,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:32,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:32,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:32,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:06:32,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-08 14:06:32,162 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:06:32,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 14:06:32,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 14:06:32,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 14:06:32,163 INFO L87 Difference]: Start difference. First operand 26 states and 61 transitions. Second operand 3 states. [2019-01-08 14:06:32,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:32,264 INFO L93 Difference]: Finished difference Result 31 states and 61 transitions. [2019-01-08 14:06:32,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:06:32,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-08 14:06:32,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:32,265 INFO L225 Difference]: With dead ends: 31 [2019-01-08 14:06:32,266 INFO L226 Difference]: Without dead ends: 30 [2019-01-08 14:06:32,266 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-01-08 14:06:32,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-08 14:06:32,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2019-01-08 14:06:32,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-08 14:06:32,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 60 transitions. [2019-01-08 14:06:32,272 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 60 transitions. Word has length 3 [2019-01-08 14:06:32,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:32,272 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 60 transitions. [2019-01-08 14:06:32,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 14:06:32,272 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 60 transitions. [2019-01-08 14:06:32,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:06:32,273 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:32,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:06:32,273 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:32,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:32,274 INFO L82 PathProgramCache]: Analyzing trace with hash 30012, now seen corresponding path program 1 times [2019-01-08 14:06:32,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:32,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:32,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:32,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:32,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:32,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:32,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:32,381 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:32,381 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-08 14:06:32,382 INFO L207 CegarAbsIntRunner]: [0], [6], [35] [2019-01-08 14:06:32,383 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:32,383 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:32,394 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:32,394 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 98 root evaluator evaluations with a maximum evaluation depth of 3. Performed 98 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-08 14:06:32,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:32,394 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:32,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:32,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-01-08 14:06:32,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:32,416 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:32,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:32,706 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-01-08 14:06:32,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 41 [2019-01-08 14:06:32,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2019-01-08 14:06:32,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2019-01-08 14:06:32,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 56 [2019-01-08 14:06:32,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 74 [2019-01-08 14:06:32,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-08 14:06:32,921 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:32,924 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:32,926 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:32,935 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:32,938 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:32,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:32,961 INFO L478 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 27 treesize of output 30 [2019-01-08 14:06:32,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,967 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2019-01-08 14:06:32,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-01-08 14:06:32,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-01-08 14:06:32,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:32,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-08 14:06:33,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-01-08 14:06:33,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-01-08 14:06:33,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 153 [2019-01-08 14:06:33,061 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:33,159 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:33,219 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:33,263 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:33,296 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:33,323 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:33,344 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:33,364 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:33,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:33,405 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 9 variables, input treesize:80, output treesize:62 [2019-01-08 14:06:33,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:33,540 INFO L303 Elim1Store]: Index analysis took 113 ms [2019-01-08 14:06:33,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 159 [2019-01-08 14:06:33,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:33,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:33,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:72, output treesize:62 [2019-01-08 14:06:33,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:33,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:33,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:33,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-08 14:06:33,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-08 14:06:33,733 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:06:33,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:06:33,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:06:33,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-08 14:06:33,734 INFO L87 Difference]: Start difference. First operand 26 states and 60 transitions. Second operand 4 states. [2019-01-08 14:06:33,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:33,837 INFO L93 Difference]: Finished difference Result 32 states and 98 transitions. [2019-01-08 14:06:33,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-08 14:06:33,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-08 14:06:33,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:33,839 INFO L225 Difference]: With dead ends: 32 [2019-01-08 14:06:33,840 INFO L226 Difference]: Without dead ends: 31 [2019-01-08 14:06:33,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-08 14:06:33,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-08 14:06:33,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-01-08 14:06:33,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-08 14:06:33,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2019-01-08 14:06:33,849 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 3 [2019-01-08 14:06:33,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:33,849 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2019-01-08 14:06:33,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:06:33,849 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2019-01-08 14:06:33,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:06:33,850 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:33,850 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:06:33,850 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:33,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:33,851 INFO L82 PathProgramCache]: Analyzing trace with hash 30136, now seen corresponding path program 1 times [2019-01-08 14:06:33,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:33,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:33,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:33,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:33,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:33,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:33,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:33,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:33,913 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-08 14:06:33,913 INFO L207 CegarAbsIntRunner]: [0], [10], [35] [2019-01-08 14:06:33,917 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:33,917 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:33,928 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:33,928 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 98 root evaluator evaluations with a maximum evaluation depth of 3. Performed 98 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-08 14:06:33,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:33,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:33,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:33,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-01-08 14:06:33,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:33,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:33,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:34,119 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-01-08 14:06:34,123 INFO L478 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 27 treesize of output 30 [2019-01-08 14:06:34,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,129 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2019-01-08 14:06:34,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-01-08 14:06:34,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-01-08 14:06:34,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-08 14:06:34,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-01-08 14:06:34,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-01-08 14:06:34,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,308 INFO L303 Elim1Store]: Index analysis took 107 ms [2019-01-08 14:06:34,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 153 [2019-01-08 14:06:34,310 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:34,407 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:34,466 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:34,510 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:34,543 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:34,569 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:34,592 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:34,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:34,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 52 [2019-01-08 14:06:34,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2019-01-08 14:06:34,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-08 14:06:34,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 62 [2019-01-08 14:06:34,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-08 14:06:34,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-08 14:06:34,863 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:34,866 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:34,868 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:34,870 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:34,873 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:34,876 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:34,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:34,916 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:94, output treesize:62 [2019-01-08 14:06:34,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:34,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:35,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:35,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:35,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:35,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:35,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:35,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:35,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:35,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:35,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:35,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:35,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:35,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:35,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:35,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:35,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:35,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:35,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:35,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:35,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:35,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:35,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:35,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:35,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 159 [2019-01-08 14:06:35,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:35,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:35,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:72, output treesize:62 [2019-01-08 14:06:37,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:37,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:37,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:37,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:37,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:06:37,758 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:37,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:06:37,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:06:37,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=31, Unknown=1, NotChecked=0, Total=56 [2019-01-08 14:06:37,759 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 6 states. [2019-01-08 14:07:15,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:15,304 INFO L93 Difference]: Finished difference Result 65 states and 143 transitions. [2019-01-08 14:07:15,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:07:15,304 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-08 14:07:15,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:15,305 INFO L225 Difference]: With dead ends: 65 [2019-01-08 14:07:15,305 INFO L226 Difference]: Without dead ends: 64 [2019-01-08 14:07:15,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=31, Invalid=40, Unknown=1, NotChecked=0, Total=72 [2019-01-08 14:07:15,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-08 14:07:15,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 32. [2019-01-08 14:07:15,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-08 14:07:15,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 115 transitions. [2019-01-08 14:07:15,314 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 115 transitions. Word has length 3 [2019-01-08 14:07:15,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:07:15,315 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 115 transitions. [2019-01-08 14:07:15,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:07:15,315 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 115 transitions. [2019-01-08 14:07:15,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:07:15,316 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:07:15,316 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:07:15,316 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:07:15,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:15,317 INFO L82 PathProgramCache]: Analyzing trace with hash 30632, now seen corresponding path program 1 times [2019-01-08 14:07:15,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:07:15,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:15,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:15,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:15,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:07:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:15,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:15,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:15,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:07:15,472 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-08 14:07:15,472 INFO L207 CegarAbsIntRunner]: [0], [26], [35] [2019-01-08 14:07:15,473 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:07:15,473 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:07:15,482 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:07:15,482 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 98 root evaluator evaluations with a maximum evaluation depth of 3. Performed 98 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-08 14:07:15,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:15,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:07:15,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:15,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-01-08 14:07:15,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:15,498 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:07:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:15,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:07:15,564 INFO L478 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 27 treesize of output 30 [2019-01-08 14:07:15,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,573 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2019-01-08 14:07:15,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-01-08 14:07:15,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 60 [2019-01-08 14:07:15,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-08 14:07:15,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 100 [2019-01-08 14:07:15,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-01-08 14:07:15,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 153 [2019-01-08 14:07:15,656 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:15,747 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:15,789 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:15,822 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:15,850 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:15,872 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:15,890 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:15,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:15,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-08 14:07:15,942 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:15,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:15,976 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:57, output treesize:62 [2019-01-08 14:07:16,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 159 [2019-01-08 14:07:16,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:16,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:16,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:72, output treesize:62 [2019-01-08 14:07:18,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:18,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:07:18,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:18,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:07:18,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:07:18,814 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:07:18,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:07:18,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:07:18,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=31, Unknown=1, NotChecked=0, Total=56 [2019-01-08 14:07:18,815 INFO L87 Difference]: Start difference. First operand 32 states and 115 transitions. Second operand 6 states. [2019-01-08 14:07:28,435 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:652) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:256) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:715) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.io.IOException: Stream closed at java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:433) at java.io.OutputStream.write(OutputStream.java:116) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:120) ... 28 more [2019-01-08 14:07:28,439 INFO L168 Benchmark]: Toolchain (without parser) took 151434.07 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 784.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -632.8 MB). Peak memory consumption was 151.6 MB. Max. memory is 7.1 GB. [2019-01-08 14:07:28,440 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 14:07:28,440 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 14:07:28,440 INFO L168 Benchmark]: Boogie Preprocessor took 28.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 14:07:28,441 INFO L168 Benchmark]: RCFGBuilder took 473.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-01-08 14:07:28,441 INFO L168 Benchmark]: TraceAbstraction took 150865.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 784.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -653.9 MB). Peak memory consumption was 130.4 MB. Max. memory is 7.1 GB. [2019-01-08 14:07:28,444 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.31 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 473.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 150865.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 784.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -653.9 MB). Peak memory consumption was 130.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...