java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_camel.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:23:48,908 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:23:48,910 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:23:48,922 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:23:48,922 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:23:48,924 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:23:48,925 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:23:48,927 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:23:48,928 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:23:48,929 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:23:48,930 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:23:48,931 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:23:48,932 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:23:48,933 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:23:48,934 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:23:48,935 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:23:48,936 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:23:48,938 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:23:48,940 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:23:48,942 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:23:48,943 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:23:48,945 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:23:48,948 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:23:48,948 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:23:48,948 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:23:48,949 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:23:48,950 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:23:48,951 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:23:48,952 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:23:48,953 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:23:48,954 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:23:48,954 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:23:48,955 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:23:48,955 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:23:48,956 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:23:48,957 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:23:48,957 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_camel.epf [2019-03-04 16:23:48,971 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:23:48,971 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:23:48,972 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:23:48,972 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:23:48,972 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:23:48,972 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:23:48,973 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:23:48,973 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:23:48,973 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:23:48,973 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:23:48,973 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2019-03-04 16:23:48,974 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:23:48,974 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:23:48,975 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:23:48,975 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:23:48,975 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:23:48,975 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:23:48,976 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:23:48,976 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:23:48,976 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:23:48,976 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:23:48,976 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:23:48,977 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:23:48,977 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:23:48,977 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:23:48,977 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:23:48,978 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:23:48,978 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:23:48,978 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:23:48,978 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:23:48,978 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:23:48,979 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:23:48,979 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:23:48,979 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:23:48,979 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-03-04 16:23:48,979 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:23:48,980 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:23:48,980 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:23:48,980 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:23:49,011 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:23:49,023 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:23:49,027 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:23:49,029 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:23:49,029 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:23:49,030 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl [2019-03-04 16:23:49,030 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl' [2019-03-04 16:23:49,067 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:23:49,069 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:23:49,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:23:49,070 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:23:49,070 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:23:49,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:49" (1/1) ... [2019-03-04 16:23:49,096 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:49" (1/1) ... [2019-03-04 16:23:49,103 WARN L165 Inliner]: Program contained no entry procedure! [2019-03-04 16:23:49,103 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-03-04 16:23:49,103 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-03-04 16:23:49,105 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:23:49,106 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:23:49,107 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:23:49,107 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:23:49,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:49" (1/1) ... [2019-03-04 16:23:49,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:49" (1/1) ... [2019-03-04 16:23:49,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:49" (1/1) ... [2019-03-04 16:23:49,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:49" (1/1) ... [2019-03-04 16:23:49,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:49" (1/1) ... [2019-03-04 16:23:49,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:49" (1/1) ... [2019-03-04 16:23:49,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:49" (1/1) ... [2019-03-04 16:23:49,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:23:49,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:23:49,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:23:49,129 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:23:49,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:23:49,193 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-03-04 16:23:49,193 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-03-04 16:23:49,194 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-03-04 16:23:49,410 INFO L278 CfgBuilder]: Using library mode [2019-03-04 16:23:49,410 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-03-04 16:23:49,412 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:23:49 BoogieIcfgContainer [2019-03-04 16:23:49,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:23:49,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:23:49,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:23:49,416 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:23:49,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:23:49" (1/2) ... [2019-03-04 16:23:49,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@225455db and model type ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:23:49, skipping insertion in model container [2019-03-04 16:23:49,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:23:49" (2/2) ... [2019-03-04 16:23:49,420 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit01.bpl [2019-03-04 16:23:49,430 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:23:49,443 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-03-04 16:23:49,462 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-03-04 16:23:49,500 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-03-04 16:23:49,500 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:23:49,502 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:23:49,502 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:23:49,502 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:23:49,502 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:23:49,502 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:23:49,503 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:23:49,503 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:23:49,520 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-03-04 16:23:49,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:23:49,536 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:49,537 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:23:49,547 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:49,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:49,555 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-03-04 16:23:49,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:49,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:49,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:49,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:49,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:49,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:49,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:23:49,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-03-04 16:23:49,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:23:49,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:23:49,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:23:49,735 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-03-04 16:23:49,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:49,781 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-03-04 16:23:49,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:23:49,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-03-04 16:23:49,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:49,795 INFO L225 Difference]: With dead ends: 11 [2019-03-04 16:23:49,795 INFO L226 Difference]: Without dead ends: 5 [2019-03-04 16:23:49,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:23:49,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-03-04 16:23:49,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-03-04 16:23:49,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-03-04 16:23:49,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-03-04 16:23:49,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-03-04 16:23:49,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:49,834 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-03-04 16:23:49,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:23:49,835 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-03-04 16:23:49,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:23:49,835 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:49,835 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:23:49,836 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:49,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:49,836 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-03-04 16:23:49,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:49,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:49,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:49,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:49,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:50,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:50,137 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:23:50,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:50,176 WARN L254 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:23:50,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:50,285 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:23:50,286 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:50,333 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:23:50,334 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-03-04 16:23:50,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:50,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:50,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2019-03-04 16:23:50,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:23:50,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:23:50,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:23:50,474 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 7 states. [2019-03-04 16:23:50,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:50,671 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-03-04 16:23:50,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:23:50,671 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2019-03-04 16:23:50,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:50,672 INFO L225 Difference]: With dead ends: 8 [2019-03-04 16:23:50,672 INFO L226 Difference]: Without dead ends: 6 [2019-03-04 16:23:50,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:23:50,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-03-04 16:23:50,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-03-04 16:23:50,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-03-04 16:23:50,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-03-04 16:23:50,676 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-03-04 16:23:50,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:50,676 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-03-04 16:23:50,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:23:50,677 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-03-04 16:23:50,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:23:50,677 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:50,677 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-03-04 16:23:50,678 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:50,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:50,678 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2019-03-04 16:23:50,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:50,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:50,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:50,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:23:50,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:50,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:50,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:50,889 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:23:50,905 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:23:50,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:23:50,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:50,934 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:23:50,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:51,122 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:23:51,122 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:51,202 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:23:51,202 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-03-04 16:23:51,347 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 14 [2019-03-04 16:23:51,348 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:51,400 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:23:51,400 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-03-04 16:23:51,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:51,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:51,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2019-03-04 16:23:51,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:23:51,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:23:51,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:23:51,515 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 10 states. [2019-03-04 16:23:51,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:51,704 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-03-04 16:23:51,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:23:51,705 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:23:51,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:51,706 INFO L225 Difference]: With dead ends: 9 [2019-03-04 16:23:51,706 INFO L226 Difference]: Without dead ends: 7 [2019-03-04 16:23:51,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:23:51,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-03-04 16:23:51,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-03-04 16:23:51,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-03-04 16:23:51,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-03-04 16:23:51,710 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-03-04 16:23:51,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:51,710 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-03-04 16:23:51,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:23:51,711 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-03-04 16:23:51,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:23:51,712 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:51,712 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-03-04 16:23:51,713 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:51,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:51,713 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2019-03-04 16:23:51,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:51,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:51,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:51,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:23:51,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:52,321 WARN L181 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2019-03-04 16:23:52,373 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:52,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:52,373 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:23:52,383 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:23:52,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:23:52,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:52,408 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:23:52,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:52,425 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:23:52,426 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:52,442 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:23:52,443 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-03-04 16:23:52,479 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 14 [2019-03-04 16:23:52,480 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:52,493 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:23:52,494 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-03-04 16:23:52,564 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 17 treesize of output 22 [2019-03-04 16:23:52,566 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:52,599 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:23:52,599 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-03-04 16:23:52,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:52,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:52,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-03-04 16:23:52,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:23:52,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:23:52,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:23:52,673 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 12 states. [2019-03-04 16:23:52,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:52,877 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-03-04 16:23:52,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:23:52,877 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:23:52,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:52,878 INFO L225 Difference]: With dead ends: 10 [2019-03-04 16:23:52,878 INFO L226 Difference]: Without dead ends: 8 [2019-03-04 16:23:52,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:23:52,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-03-04 16:23:52,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-03-04 16:23:52,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-03-04 16:23:52,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-03-04 16:23:52,883 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-03-04 16:23:52,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:52,884 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-03-04 16:23:52,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:23:52,884 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-03-04 16:23:52,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:23:52,885 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:52,885 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-03-04 16:23:52,885 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:52,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:52,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2019-03-04 16:23:52,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:52,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:52,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:52,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:23:52,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:53,166 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 19 [2019-03-04 16:23:53,314 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-03-04 16:23:53,467 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:53,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:53,467 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:23:53,476 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:23:53,482 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:23:53,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:53,483 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:23:53,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:53,505 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:23:53,505 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:53,514 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:23:53,514 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-03-04 16:23:53,543 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 14 [2019-03-04 16:23:53,544 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:53,555 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:23:53,556 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-03-04 16:23:53,636 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 17 treesize of output 22 [2019-03-04 16:23:53,637 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:53,653 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:23:53,654 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-03-04 16:23:53,783 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 22 treesize of output 30 [2019-03-04 16:23:53,784 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:53,803 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:23:53,804 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-03-04 16:23:53,901 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:53,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:53,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2019-03-04 16:23:53,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:23:53,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:23:53,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:23:53,922 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 14 states. [2019-03-04 16:23:54,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:54,274 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-03-04 16:23:54,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:23:54,275 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-03-04 16:23:54,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:54,276 INFO L225 Difference]: With dead ends: 11 [2019-03-04 16:23:54,276 INFO L226 Difference]: Without dead ends: 9 [2019-03-04 16:23:54,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:23:54,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-03-04 16:23:54,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-03-04 16:23:54,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-03-04 16:23:54,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-03-04 16:23:54,281 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-03-04 16:23:54,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:54,281 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-03-04 16:23:54,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:23:54,281 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-03-04 16:23:54,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:23:54,282 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:54,282 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-03-04 16:23:54,282 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:54,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:54,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2019-03-04 16:23:54,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:54,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:54,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:54,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:23:54,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:54,832 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 32 [2019-03-04 16:23:54,859 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:54,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:54,859 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:23:54,868 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-03-04 16:23:54,877 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-03-04 16:23:54,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:54,878 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:23:54,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:54,910 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:23:54,910 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:54,917 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:23:54,917 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-03-04 16:23:54,960 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 14 [2019-03-04 16:23:54,961 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:54,972 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:23:54,972 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-03-04 16:23:55,054 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 17 treesize of output 22 [2019-03-04 16:23:55,055 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:55,070 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:23:55,071 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-03-04 16:23:55,133 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 22 treesize of output 30 [2019-03-04 16:23:55,134 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:55,155 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:23:55,155 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-03-04 16:23:55,267 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:23:55,269 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:55,367 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:23:55,368 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-03-04 16:23:55,596 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:55,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:23:55,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-03-04 16:23:55,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-03-04 16:23:55,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-03-04 16:23:55,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:23:55,618 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 16 states. [2019-03-04 16:23:56,226 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-03-04 16:23:56,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:23:56,246 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-03-04 16:23:56,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:23:56,247 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 8 [2019-03-04 16:23:56,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:23:56,248 INFO L225 Difference]: With dead ends: 12 [2019-03-04 16:23:56,248 INFO L226 Difference]: Without dead ends: 10 [2019-03-04 16:23:56,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:23:56,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-03-04 16:23:56,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-03-04 16:23:56,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-03-04 16:23:56,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-03-04 16:23:56,252 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-03-04 16:23:56,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:23:56,253 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-03-04 16:23:56,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-03-04 16:23:56,253 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-03-04 16:23:56,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:23:56,253 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:23:56,253 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-03-04 16:23:56,254 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:23:56,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:23:56,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2019-03-04 16:23:56,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:23:56,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:23:56,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:56,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:23:56,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:23:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:23:56,777 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 27 [2019-03-04 16:23:57,368 WARN L181 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2019-03-04 16:23:57,404 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:23:57,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:23:57,405 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:23:57,420 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-03-04 16:23:57,429 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-03-04 16:23:57,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:23:57,429 WARN L254 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:23:57,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:23:57,458 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:23:57,458 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:57,469 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:23:57,469 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-03-04 16:23:57,521 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 14 [2019-03-04 16:23:57,522 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:57,536 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:23:57,536 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-03-04 16:23:57,645 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 17 treesize of output 22 [2019-03-04 16:23:57,646 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:57,659 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:23:57,660 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-03-04 16:23:57,724 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 22 treesize of output 30 [2019-03-04 16:23:57,725 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:57,745 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:23:57,746 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-03-04 16:23:57,889 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:23:57,890 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:57,919 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:23:57,920 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-03-04 16:23:58,144 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 20 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:23:58,146 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:23:58,174 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:23:58,174 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2019-03-04 16:24:00,169 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:00,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:00,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-03-04 16:24:00,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-03-04 16:24:00,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-03-04 16:24:00,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:24:00,190 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 18 states. [2019-03-04 16:24:05,379 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-03-04 16:24:05,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:24:05,406 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-03-04 16:24:05,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:24:05,406 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 9 [2019-03-04 16:24:05,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:24:05,407 INFO L225 Difference]: With dead ends: 13 [2019-03-04 16:24:05,408 INFO L226 Difference]: Without dead ends: 11 [2019-03-04 16:24:05,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=94, Invalid=285, Unknown=1, NotChecked=0, Total=380 [2019-03-04 16:24:05,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-03-04 16:24:05,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-03-04 16:24:05,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-03-04 16:24:05,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-03-04 16:24:05,412 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-03-04 16:24:05,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:24:05,413 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-03-04 16:24:05,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-03-04 16:24:05,413 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-03-04 16:24:05,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-03-04 16:24:05,413 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:24:05,414 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-03-04 16:24:05,414 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:24:05,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:24:05,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2019-03-04 16:24:05,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:24:05,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:24:05,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:05,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:24:05,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:24:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:06,080 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 34 [2019-03-04 16:24:06,421 WARN L181 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 40 [2019-03-04 16:24:06,440 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:06,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:24:06,441 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:24:06,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:24:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:24:06,459 WARN L254 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:24:06,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:24:06,493 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:24:06,493 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:06,499 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:06,499 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-03-04 16:24:06,546 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 14 [2019-03-04 16:24:06,547 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:06,557 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:06,557 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-03-04 16:24:06,609 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 17 treesize of output 22 [2019-03-04 16:24:06,610 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:06,623 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:06,624 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-03-04 16:24:06,700 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 22 treesize of output 30 [2019-03-04 16:24:06,701 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:06,719 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:06,719 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-03-04 16:24:06,939 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:24:06,941 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:06,973 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:06,973 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-03-04 16:24:07,370 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 20 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:24:07,371 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:07,409 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:24:07,410 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2019-03-04 16:24:09,720 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 27 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:24:09,721 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:24:09,783 INFO L309 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-03-04 16:24:09,783 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2019-03-04 16:24:23,405 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:24:23,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:24:23,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-03-04 16:24:23,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-03-04 16:24:23,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-03-04 16:24:23,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=287, Unknown=3, NotChecked=0, Total=380 [2019-03-04 16:24:23,426 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 20 states. [2019-03-04 16:24:38,165 WARN L181 SmtUtils]: Spent 9.01 s on a formula simplification. DAG size of input: 97 DAG size of output: 48 [2019-03-04 16:24:48,509 WARN L181 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2019-03-04 16:25:11,061 WARN L181 SmtUtils]: Spent 10.37 s on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2019-03-04 16:25:11,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:25:11,081 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-03-04 16:25:11,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:25:11,081 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 10 [2019-03-04 16:25:11,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:25:11,082 INFO L225 Difference]: With dead ends: 14 [2019-03-04 16:25:11,082 INFO L226 Difference]: Without dead ends: 12 [2019-03-04 16:25:11,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 57.7s TimeCoverageRelationStatistics Valid=158, Invalid=483, Unknown=9, NotChecked=0, Total=650 [2019-03-04 16:25:11,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-03-04 16:25:11,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-03-04 16:25:11,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-03-04 16:25:11,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-03-04 16:25:11,087 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-03-04 16:25:11,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:25:11,088 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-03-04 16:25:11,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-03-04 16:25:11,088 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-03-04 16:25:11,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-03-04 16:25:11,088 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:25:11,088 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-03-04 16:25:11,089 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:25:11,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:25:11,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166496, now seen corresponding path program 8 times [2019-03-04 16:25:11,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-03-04 16:25:11,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-03-04 16:25:11,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:11,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:25:11,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:25:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:25:11,875 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 29 [2019-03-04 16:25:12,206 WARN L181 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 38 [2019-03-04 16:25:12,777 WARN L181 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 44 [2019-03-04 16:25:12,799 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:25:12,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:25:12,800 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:12,810 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-03-04 16:25:12,831 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-03-04 16:25:12,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:25:12,832 WARN L254 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 21 conjunts are in the unsatisfiable core [2019-03-04 16:25:12,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:25:12,869 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:25:12,870 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,875 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:12,875 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-03-04 16:25:12,905 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 14 [2019-03-04 16:25:12,906 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,915 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:12,915 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-03-04 16:25:12,967 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 17 treesize of output 22 [2019-03-04 16:25:12,968 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:12,980 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:12,981 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-03-04 16:25:13,104 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 22 treesize of output 30 [2019-03-04 16:25:13,105 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:13,124 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:13,125 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-03-04 16:25:13,242 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:25:13,243 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:13,266 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:13,267 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-03-04 16:25:13,530 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 20 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:25:13,531 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:13,562 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:25:13,563 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2019-03-04 16:25:17,195 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 27 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:25:17,196 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:25:17,229 INFO L309 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-03-04 16:25:17,230 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2019-03-04 16:25:22,641 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-03-04 16:25:22,842 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:25:22,844 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:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:934) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:581) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) 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: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2019-03-04 16:25:22,849 INFO L168 Benchmark]: Toolchain (without parser) took 93781.41 ms. Allocated memory was 133.2 MB in the beginning and 348.1 MB in the end (delta: 215.0 MB). Free memory was 105.2 MB in the beginning and 206.3 MB in the end (delta: -101.1 MB). Peak memory consumption was 113.9 MB. Max. memory is 7.1 GB. [2019-03-04 16:25:22,850 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 133.2 MB. Free memory is still 106.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:25:22,850 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.50 ms. Allocated memory is still 133.2 MB. Free memory was 105.2 MB in the beginning and 103.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-03-04 16:25:22,851 INFO L168 Benchmark]: Boogie Preprocessor took 21.49 ms. Allocated memory is still 133.2 MB. Free memory was 103.4 MB in the beginning and 102.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:25:22,851 INFO L168 Benchmark]: RCFGBuilder took 283.72 ms. Allocated memory is still 133.2 MB. Free memory was 102.2 MB in the beginning and 93.2 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. [2019-03-04 16:25:22,852 INFO L168 Benchmark]: TraceAbstraction took 93435.34 ms. Allocated memory was 133.2 MB in the beginning and 348.1 MB in the end (delta: 215.0 MB). Free memory was 93.2 MB in the beginning and 206.3 MB in the end (delta: -113.1 MB). Peak memory consumption was 101.9 MB. Max. memory is 7.1 GB. [2019-03-04 16:25:22,855 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.22 ms. Allocated memory is still 133.2 MB. Free memory is still 106.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.50 ms. Allocated memory is still 133.2 MB. Free memory was 105.2 MB in the beginning and 103.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.49 ms. Allocated memory is still 133.2 MB. Free memory was 103.4 MB in the beginning and 102.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 283.72 ms. Allocated memory is still 133.2 MB. Free memory was 102.2 MB in the beginning and 93.2 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 93435.34 ms. Allocated memory was 133.2 MB in the beginning and 348.1 MB in the end (delta: 215.0 MB). Free memory was 93.2 MB in the beginning and 206.3 MB in the end (delta: -113.1 MB). Peak memory consumption was 101.9 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:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...