java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:33:36,768 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:33:36,770 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:33:36,782 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:33:36,782 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:33:36,783 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:33:36,784 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:33:36,786 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:33:36,788 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:33:36,789 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:33:36,789 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:33:36,790 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:33:36,791 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:33:36,792 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:33:36,793 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:33:36,793 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:33:36,794 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:33:36,798 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:33:36,800 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:33:36,802 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:33:36,807 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:33:36,808 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:33:36,814 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:33:36,814 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:33:36,814 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:33:36,818 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:33:36,819 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:33:36,821 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:33:36,822 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:33:36,823 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:33:36,823 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:33:36,824 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:33:36,824 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:33:36,824 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:33:36,827 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:33:36,828 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:33:36,828 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 12:33:36,858 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:33:36,858 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:33:36,861 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:33:36,862 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:33:36,862 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:33:36,862 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:33:36,863 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:33:36,863 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:33:36,863 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:33:36,863 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:33:36,864 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:33:36,865 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:33:36,865 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:33:36,865 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:33:36,866 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:33:36,866 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:33:36,866 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:33:36,866 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:33:36,866 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:33:36,867 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:33:36,868 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:33:36,868 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:33:36,869 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:33:36,869 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:33:36,869 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:33:36,869 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:33:36,869 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:33:36,870 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:33:36,870 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:33:36,870 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:33:36,942 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:33:36,958 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:33:36,965 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:33:36,967 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:33:36,968 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:33:36,968 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl [2018-10-04 12:33:36,969 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl' [2018-10-04 12:33:37,044 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:33:37,046 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:33:37,047 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:33:37,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:33:37,047 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:33:37,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:37" (1/1) ... [2018-10-04 12:33:37,087 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:37" (1/1) ... [2018-10-04 12:33:37,095 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 12:33:37,095 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 12:33:37,096 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 12:33:37,114 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:33:37,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:33:37,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:33:37,115 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:33:37,126 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:37" (1/1) ... [2018-10-04 12:33:37,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:37" (1/1) ... [2018-10-04 12:33:37,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:37" (1/1) ... [2018-10-04 12:33:37,128 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:37" (1/1) ... [2018-10-04 12:33:37,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:37" (1/1) ... [2018-10-04 12:33:37,140 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:37" (1/1) ... [2018-10-04 12:33:37,141 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:37" (1/1) ... [2018-10-04 12:33:37,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:33:37,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:33:37,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:33:37,144 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:33:37,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:33:37,219 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-04 12:33:37,219 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-04 12:33:37,220 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-10-04 12:33:37,507 INFO L338 CfgBuilder]: Using library mode [2018-10-04 12:33:37,508 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:33:37 BoogieIcfgContainer [2018-10-04 12:33:37,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:33:37,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:33:37,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:33:37,513 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:33:37,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:37" (1/2) ... [2018-10-04 12:33:37,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0a7818 and model type PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:33:37, skipping insertion in model container [2018-10-04 12:33:37,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:33:37" (2/2) ... [2018-10-04 12:33:37,521 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified02.bpl [2018-10-04 12:33:37,543 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:33:37,563 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:33:37,686 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:33:37,687 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:33:37,687 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:33:37,687 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:33:37,687 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:33:37,687 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:33:37,687 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:33:37,690 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:33:37,690 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:33:37,716 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-10-04 12:33:37,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 12:33:37,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:37,723 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-04 12:33:37,725 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:37,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:37,731 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2018-10-04 12:33:37,734 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:37,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:37,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:37,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:37,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:37,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:37,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:33:37,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-04 12:33:37,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:33:37,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:33:37,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:33:38,002 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2018-10-04 12:33:38,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:38,122 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-10-04 12:33:38,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:33:38,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-10-04 12:33:38,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:38,137 INFO L225 Difference]: With dead ends: 17 [2018-10-04 12:33:38,137 INFO L226 Difference]: Without dead ends: 10 [2018-10-04 12:33:38,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:33:38,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-04 12:33:38,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-10-04 12:33:38,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 12:33:38,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 12:33:38,180 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 4 [2018-10-04 12:33:38,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:38,181 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-04 12:33:38,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:33:38,181 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 12:33:38,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:33:38,182 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:38,182 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-10-04 12:33:38,182 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:38,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:38,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1951667359, now seen corresponding path program 1 times [2018-10-04 12:33:38,183 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:38,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:38,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:38,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:38,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:38,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:38,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:38,355 INFO L227 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 [2018-10-04 12:33:38,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:38,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:38,485 INFO L477 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 [2018-10-04 12:33:38,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:38,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:33:38,553 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:38,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:38,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:38,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2018-10-04 12:33:38,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:33:38,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:33:38,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:33:38,667 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-10-04 12:33:38,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:38,781 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-04 12:33:38,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:33:38,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-10-04 12:33:38,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:38,783 INFO L225 Difference]: With dead ends: 15 [2018-10-04 12:33:38,783 INFO L226 Difference]: Without dead ends: 14 [2018-10-04 12:33:38,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:33:38,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-04 12:33:38,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-10-04 12:33:38,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-04 12:33:38,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-04 12:33:38,792 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2018-10-04 12:33:38,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:38,792 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-04 12:33:38,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:33:38,793 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-04 12:33:38,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:33:38,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:38,794 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2018-10-04 12:33:38,794 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:38,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:38,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1291763032, now seen corresponding path program 2 times [2018-10-04 12:33:38,795 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:38,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:38,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:38,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:38,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:38,966 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:38,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:38,967 INFO L227 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 [2018-10-04 12:33:38,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:33:39,017 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:33:39,017 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:39,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:39,035 INFO L477 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 [2018-10-04 12:33:39,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:39,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:33:39,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:39,146 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:39,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:39,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2018-10-04 12:33:39,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:33:39,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:33:39,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:33:39,168 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2018-10-04 12:33:39,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:39,252 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-04 12:33:39,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:33:39,253 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 12:33:39,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:39,253 INFO L225 Difference]: With dead ends: 19 [2018-10-04 12:33:39,254 INFO L226 Difference]: Without dead ends: 18 [2018-10-04 12:33:39,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:33:39,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-04 12:33:39,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-10-04 12:33:39,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-04 12:33:39,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-04 12:33:39,259 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2018-10-04 12:33:39,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:39,260 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-04 12:33:39,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:33:39,260 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-04 12:33:39,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:33:39,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:39,261 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1] [2018-10-04 12:33:39,261 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:39,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:39,262 INFO L82 PathProgramCache]: Analyzing trace with hash 172253585, now seen corresponding path program 3 times [2018-10-04 12:33:39,262 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:39,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:39,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:39,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:39,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:39,415 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:39,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:39,415 INFO L227 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 [2018-10-04 12:33:39,427 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:33:39,454 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 12:33:39,454 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:39,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:39,468 INFO L477 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 [2018-10-04 12:33:39,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:39,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:33:39,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:39,567 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:39,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:39,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-10-04 12:33:39,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:39,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:39,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:39,595 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-10-04 12:33:39,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:39,821 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-04 12:33:39,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:33:39,821 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-10-04 12:33:39,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:39,822 INFO L225 Difference]: With dead ends: 23 [2018-10-04 12:33:39,822 INFO L226 Difference]: Without dead ends: 22 [2018-10-04 12:33:39,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:39,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-04 12:33:39,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-10-04 12:33:39,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-04 12:33:39,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-04 12:33:39,829 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2018-10-04 12:33:39,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:39,829 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-04 12:33:39,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:39,830 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-04 12:33:39,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 12:33:39,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:39,831 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1] [2018-10-04 12:33:39,831 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:39,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:39,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1489288886, now seen corresponding path program 4 times [2018-10-04 12:33:39,831 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:39,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:39,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:39,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:39,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:39,958 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:39,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:39,958 INFO L227 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 [2018-10-04 12:33:39,969 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:33:40,000 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:33:40,000 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:40,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:40,014 INFO L477 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 [2018-10-04 12:33:40,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:40,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:33:40,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:40,173 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:40,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:40,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2018-10-04 12:33:40,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 12:33:40,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 12:33:40,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-04 12:33:40,196 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-10-04 12:33:40,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:40,382 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-04 12:33:40,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:33:40,382 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-10-04 12:33:40,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:40,384 INFO L225 Difference]: With dead ends: 27 [2018-10-04 12:33:40,384 INFO L226 Difference]: Without dead ends: 26 [2018-10-04 12:33:40,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-04 12:33:40,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-04 12:33:40,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-10-04 12:33:40,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-04 12:33:40,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-04 12:33:40,390 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2018-10-04 12:33:40,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:40,390 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-04 12:33:40,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 12:33:40,391 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-04 12:33:40,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 12:33:40,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:40,392 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1] [2018-10-04 12:33:40,392 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:40,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:40,393 INFO L82 PathProgramCache]: Analyzing trace with hash 702127235, now seen corresponding path program 5 times [2018-10-04 12:33:40,393 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:40,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:40,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:40,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:40,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:40,682 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:40,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:40,683 INFO L227 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 [2018-10-04 12:33:40,693 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:33:40,789 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 12:33:40,789 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:40,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:40,812 INFO L477 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 [2018-10-04 12:33:40,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:40,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:33:40,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:41,039 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:41,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:41,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-10-04 12:33:41,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:33:41,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:33:41,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:33:41,061 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2018-10-04 12:33:41,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:41,128 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-04 12:33:41,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:33:41,129 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-10-04 12:33:41,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:41,131 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:33:41,131 INFO L226 Difference]: Without dead ends: 30 [2018-10-04 12:33:41,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:33:41,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-04 12:33:41,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-10-04 12:33:41,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 12:33:41,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-04 12:33:41,137 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2018-10-04 12:33:41,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:41,137 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-04 12:33:41,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:33:41,138 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-04 12:33:41,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 12:33:41,138 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:41,139 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1] [2018-10-04 12:33:41,139 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:41,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:41,139 INFO L82 PathProgramCache]: Analyzing trace with hash 854963004, now seen corresponding path program 6 times [2018-10-04 12:33:41,139 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:41,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:41,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:41,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:41,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:41,293 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:41,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:41,294 INFO L227 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 [2018-10-04 12:33:41,306 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:33:41,328 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:33:41,329 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:41,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:41,338 INFO L477 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 [2018-10-04 12:33:41,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:41,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:33:41,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:41,503 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:41,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:41,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-10-04 12:33:41,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:33:41,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:33:41,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:33:41,525 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2018-10-04 12:33:41,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:41,634 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-04 12:33:41,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:33:41,635 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-10-04 12:33:41,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:41,637 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:33:41,638 INFO L226 Difference]: Without dead ends: 34 [2018-10-04 12:33:41,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:33:41,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-04 12:33:41,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-10-04 12:33:41,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 12:33:41,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-04 12:33:41,644 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2018-10-04 12:33:41,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:41,644 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-04 12:33:41,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:33:41,645 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-04 12:33:41,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-04 12:33:41,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:41,646 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1] [2018-10-04 12:33:41,646 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:41,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:41,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1908030091, now seen corresponding path program 7 times [2018-10-04 12:33:41,647 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:41,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:41,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:41,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:41,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:41,843 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:41,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:41,844 INFO L227 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 [2018-10-04 12:33:41,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:41,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:41,888 INFO L477 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 [2018-10-04 12:33:41,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:41,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:33:41,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:42,081 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:42,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:42,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-10-04 12:33:42,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 12:33:42,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 12:33:42,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:33:42,112 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2018-10-04 12:33:42,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:42,246 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-04 12:33:42,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:42,248 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-10-04 12:33:42,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:42,249 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:33:42,249 INFO L226 Difference]: Without dead ends: 38 [2018-10-04 12:33:42,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:33:42,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-04 12:33:42,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-10-04 12:33:42,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 12:33:42,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-04 12:33:42,255 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2018-10-04 12:33:42,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:42,256 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-04 12:33:42,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 12:33:42,256 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-04 12:33:42,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 12:33:42,257 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:42,257 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1] [2018-10-04 12:33:42,258 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:42,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:42,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1033891026, now seen corresponding path program 8 times [2018-10-04 12:33:42,258 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:42,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:42,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:42,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:42,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:42,475 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:42,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:42,476 INFO L227 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 [2018-10-04 12:33:42,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:33:42,506 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:33:42,507 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:42,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:42,521 INFO L477 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 [2018-10-04 12:33:42,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:42,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:33:42,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:42,865 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:42,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:42,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2018-10-04 12:33:42,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 12:33:42,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 12:33:42,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-04 12:33:42,887 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2018-10-04 12:33:43,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:43,124 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-04 12:33:43,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:33:43,124 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-10-04 12:33:43,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:43,126 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:33:43,126 INFO L226 Difference]: Without dead ends: 42 [2018-10-04 12:33:43,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-04 12:33:43,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-04 12:33:43,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-10-04 12:33:43,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-04 12:33:43,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-04 12:33:43,132 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2018-10-04 12:33:43,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:43,133 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-04 12:33:43,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 12:33:43,133 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-04 12:33:43,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-04 12:33:43,134 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:43,134 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1] [2018-10-04 12:33:43,135 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:43,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:43,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1598366617, now seen corresponding path program 9 times [2018-10-04 12:33:43,135 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:43,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:43,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:43,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:43,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:43,364 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:43,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:43,365 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:43,374 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:33:43,398 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-04 12:33:43,399 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:43,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:43,410 INFO L477 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 [2018-10-04 12:33:43,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:43,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:33:43,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:43,739 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:43,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:43,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2018-10-04 12:33:43,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 12:33:43,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 12:33:43,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-04 12:33:43,762 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2018-10-04 12:33:43,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:43,872 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-04 12:33:43,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:33:43,873 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-10-04 12:33:43,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:43,874 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:33:43,874 INFO L226 Difference]: Without dead ends: 46 [2018-10-04 12:33:43,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-04 12:33:43,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-04 12:33:43,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-10-04 12:33:43,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-04 12:33:43,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-04 12:33:43,881 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2018-10-04 12:33:43,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:43,882 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-04 12:33:43,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 12:33:43,882 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-04 12:33:43,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 12:33:43,883 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:43,883 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1] [2018-10-04 12:33:43,883 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:43,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:43,884 INFO L82 PathProgramCache]: Analyzing trace with hash -710123232, now seen corresponding path program 10 times [2018-10-04 12:33:43,884 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:43,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:43,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:43,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:43,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:44,117 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:44,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:44,117 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:44,125 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:33:44,144 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:33:44,144 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:44,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:44,156 INFO L477 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 [2018-10-04 12:33:44,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:44,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:33:44,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:44,455 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:44,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:44,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2018-10-04 12:33:44,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 12:33:44,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 12:33:44,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-10-04 12:33:44,481 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2018-10-04 12:33:44,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:44,583 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-04 12:33:44,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:33:44,584 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-10-04 12:33:44,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:44,585 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:33:44,586 INFO L226 Difference]: Without dead ends: 50 [2018-10-04 12:33:44,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-10-04 12:33:44,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-04 12:33:44,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-10-04 12:33:44,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-04 12:33:44,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-04 12:33:44,592 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2018-10-04 12:33:44,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:44,592 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-04 12:33:44,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-04 12:33:44,593 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-04 12:33:44,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-04 12:33:44,593 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:44,593 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1] [2018-10-04 12:33:44,594 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:44,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:44,594 INFO L82 PathProgramCache]: Analyzing trace with hash 2020270425, now seen corresponding path program 11 times [2018-10-04 12:33:44,594 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:44,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:44,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:44,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:44,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:45,175 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:45,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:45,176 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:45,185 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:33:45,254 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-04 12:33:45,254 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:45,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:45,277 INFO L477 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 [2018-10-04 12:33:45,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:45,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:33:45,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:45,667 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:45,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:45,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2018-10-04 12:33:45,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-04 12:33:45,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-04 12:33:45,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-10-04 12:33:45,690 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2018-10-04 12:33:45,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:45,797 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-04 12:33:45,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:33:45,797 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-10-04 12:33:45,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:45,798 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:33:45,798 INFO L226 Difference]: Without dead ends: 54 [2018-10-04 12:33:45,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-10-04 12:33:45,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-04 12:33:45,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-10-04 12:33:45,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-04 12:33:45,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-04 12:33:45,804 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2018-10-04 12:33:45,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:45,805 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-04 12:33:45,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-04 12:33:45,805 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-04 12:33:45,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-04 12:33:45,806 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:45,806 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1] [2018-10-04 12:33:45,806 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:45,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:45,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1693672174, now seen corresponding path program 12 times [2018-10-04 12:33:45,806 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:45,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:45,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:45,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:45,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:46,230 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:46,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:46,231 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:46,239 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:33:46,300 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-04 12:33:46,300 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:46,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:46,321 INFO L477 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 [2018-10-04 12:33:46,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:46,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:33:46,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:46,721 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:46,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:46,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2018-10-04 12:33:46,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-04 12:33:46,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-04 12:33:46,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-10-04 12:33:46,744 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2018-10-04 12:33:46,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:46,871 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-04 12:33:46,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:33:46,871 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2018-10-04 12:33:46,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:46,873 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:33:46,873 INFO L226 Difference]: Without dead ends: 58 [2018-10-04 12:33:46,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-10-04 12:33:46,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-04 12:33:46,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-10-04 12:33:46,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-04 12:33:46,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-04 12:33:46,880 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2018-10-04 12:33:46,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:46,880 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-04 12:33:46,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-04 12:33:46,881 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-04 12:33:46,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-04 12:33:46,882 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:46,882 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1] [2018-10-04 12:33:46,882 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:46,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:46,883 INFO L82 PathProgramCache]: Analyzing trace with hash -628632501, now seen corresponding path program 13 times [2018-10-04 12:33:46,883 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:46,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:46,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:46,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:46,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:47,192 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:47,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:47,192 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:47,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:47,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:47,232 INFO L477 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 [2018-10-04 12:33:47,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:47,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:33:47,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:47,610 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:47,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:47,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 28 [2018-10-04 12:33:47,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-04 12:33:47,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-04 12:33:47,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-10-04 12:33:47,632 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2018-10-04 12:33:47,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:47,831 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-04 12:33:47,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:33:47,831 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-10-04 12:33:47,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:47,832 INFO L225 Difference]: With dead ends: 63 [2018-10-04 12:33:47,832 INFO L226 Difference]: Without dead ends: 62 [2018-10-04 12:33:47,833 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-10-04 12:33:47,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-04 12:33:47,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-10-04 12:33:47,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-04 12:33:47,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-04 12:33:47,838 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2018-10-04 12:33:47,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:47,839 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-04 12:33:47,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-04 12:33:47,839 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-04 12:33:47,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-04 12:33:47,840 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:47,840 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1] [2018-10-04 12:33:47,841 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:47,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:47,841 INFO L82 PathProgramCache]: Analyzing trace with hash -290273532, now seen corresponding path program 14 times [2018-10-04 12:33:47,841 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:47,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:47,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:47,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:47,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:48,649 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:48,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:48,650 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:48,665 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:33:48,684 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:33:48,684 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:48,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:48,691 INFO L477 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 [2018-10-04 12:33:48,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:48,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:33:48,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:48,997 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:49,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:49,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 30 [2018-10-04 12:33:49,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-04 12:33:49,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-04 12:33:49,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-10-04 12:33:49,019 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2018-10-04 12:33:49,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:49,142 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-10-04 12:33:49,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:33:49,143 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2018-10-04 12:33:49,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:49,144 INFO L225 Difference]: With dead ends: 67 [2018-10-04 12:33:49,144 INFO L226 Difference]: Without dead ends: 66 [2018-10-04 12:33:49,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-10-04 12:33:49,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-04 12:33:49,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-10-04 12:33:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-04 12:33:49,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-04 12:33:49,151 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2018-10-04 12:33:49,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:49,151 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-04 12:33:49,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-04 12:33:49,152 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-04 12:33:49,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-04 12:33:49,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:49,153 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1] [2018-10-04 12:33:49,153 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:49,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:49,153 INFO L82 PathProgramCache]: Analyzing trace with hash 977515837, now seen corresponding path program 15 times [2018-10-04 12:33:49,153 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:49,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:49,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:49,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:49,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:49,534 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:49,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:49,535 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:49,542 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:33:49,580 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-04 12:33:49,581 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:49,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:49,599 INFO L477 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 [2018-10-04 12:33:49,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:49,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:33:49,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:49,880 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:49,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:49,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 32 [2018-10-04 12:33:49,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-04 12:33:49,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-04 12:33:49,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-10-04 12:33:49,905 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2018-10-04 12:33:50,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:50,140 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-04 12:33:50,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:33:50,140 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2018-10-04 12:33:50,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:50,141 INFO L225 Difference]: With dead ends: 71 [2018-10-04 12:33:50,141 INFO L226 Difference]: Without dead ends: 70 [2018-10-04 12:33:50,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-10-04 12:33:50,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-04 12:33:50,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-10-04 12:33:50,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-04 12:33:50,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-10-04 12:33:50,147 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2018-10-04 12:33:50,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:50,147 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-10-04 12:33:50,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-04 12:33:50,147 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-10-04 12:33:50,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-04 12:33:50,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:50,148 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1] [2018-10-04 12:33:50,149 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:50,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:50,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1523638006, now seen corresponding path program 16 times [2018-10-04 12:33:50,149 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:50,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:50,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:50,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:50,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:50,460 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:50,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:50,461 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:50,472 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:33:50,494 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:33:50,495 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:50,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:50,518 INFO L477 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 [2018-10-04 12:33:50,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:50,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:33:50,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:50,871 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:50,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:50,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 34 [2018-10-04 12:33:50,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-04 12:33:50,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-04 12:33:50,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-10-04 12:33:50,893 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2018-10-04 12:33:51,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:51,077 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-10-04 12:33:51,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 12:33:51,078 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2018-10-04 12:33:51,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:51,079 INFO L225 Difference]: With dead ends: 75 [2018-10-04 12:33:51,079 INFO L226 Difference]: Without dead ends: 74 [2018-10-04 12:33:51,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-10-04 12:33:51,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-04 12:33:51,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-10-04 12:33:51,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-04 12:33:51,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-04 12:33:51,087 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2018-10-04 12:33:51,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:51,087 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-04 12:33:51,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-04 12:33:51,087 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-04 12:33:51,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-04 12:33:51,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:51,088 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1] [2018-10-04 12:33:51,089 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:51,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:51,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1194294225, now seen corresponding path program 17 times [2018-10-04 12:33:51,089 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:51,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:51,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:51,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:51,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:51,454 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:51,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:51,455 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:51,462 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:33:51,502 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-10-04 12:33:51,502 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:51,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:51,521 INFO L477 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 [2018-10-04 12:33:51,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:51,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:33:51,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:51,850 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:51,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:51,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 36 [2018-10-04 12:33:51,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-04 12:33:51,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-04 12:33:51,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-10-04 12:33:51,872 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2018-10-04 12:33:51,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:51,979 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-04 12:33:51,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 12:33:51,979 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2018-10-04 12:33:51,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:51,980 INFO L225 Difference]: With dead ends: 79 [2018-10-04 12:33:51,981 INFO L226 Difference]: Without dead ends: 78 [2018-10-04 12:33:51,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-10-04 12:33:51,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-04 12:33:51,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-10-04 12:33:51,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-04 12:33:51,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-10-04 12:33:51,986 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2018-10-04 12:33:51,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:51,986 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-10-04 12:33:51,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-04 12:33:51,987 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-10-04 12:33:51,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-04 12:33:51,991 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:51,991 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1] [2018-10-04 12:33:51,992 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:51,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:51,992 INFO L82 PathProgramCache]: Analyzing trace with hash 395896040, now seen corresponding path program 18 times [2018-10-04 12:33:51,992 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:51,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:51,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:51,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:51,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:52,631 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:52,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:52,632 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:52,639 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:33:52,693 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-04 12:33:52,694 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:52,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:52,704 INFO L477 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 [2018-10-04 12:33:52,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:52,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:33:52,712 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:53,312 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:53,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:53,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 38 [2018-10-04 12:33:53,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-04 12:33:53,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-04 12:33:53,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-10-04 12:33:53,334 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2018-10-04 12:33:53,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:53,457 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-10-04 12:33:53,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:33:53,458 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2018-10-04 12:33:53,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:53,459 INFO L225 Difference]: With dead ends: 83 [2018-10-04 12:33:53,459 INFO L226 Difference]: Without dead ends: 82 [2018-10-04 12:33:53,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-10-04 12:33:53,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-04 12:33:53,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-10-04 12:33:53,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-04 12:33:53,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-04 12:33:53,464 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2018-10-04 12:33:53,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:53,464 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-04 12:33:53,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-04 12:33:53,464 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-04 12:33:53,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-04 12:33:53,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:53,465 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1] [2018-10-04 12:33:53,465 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:53,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:53,465 INFO L82 PathProgramCache]: Analyzing trace with hash 627065121, now seen corresponding path program 19 times [2018-10-04 12:33:53,466 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:53,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:53,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:53,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:53,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:53,862 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:53,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:53,863 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:53,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:53,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:53,905 INFO L477 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 [2018-10-04 12:33:53,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:53,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:33:53,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:54,503 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:54,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:54,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 40 [2018-10-04 12:33:54,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-04 12:33:54,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-04 12:33:54,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-10-04 12:33:54,525 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2018-10-04 12:33:54,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:54,691 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-10-04 12:33:54,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 12:33:54,691 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2018-10-04 12:33:54,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:54,693 INFO L225 Difference]: With dead ends: 87 [2018-10-04 12:33:54,693 INFO L226 Difference]: Without dead ends: 86 [2018-10-04 12:33:54,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-10-04 12:33:54,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-10-04 12:33:54,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-10-04 12:33:54,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-04 12:33:54,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-10-04 12:33:54,699 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2018-10-04 12:33:54,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:54,699 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-10-04 12:33:54,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-04 12:33:54,699 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-10-04 12:33:54,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-04 12:33:54,700 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:54,701 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1] [2018-10-04 12:33:54,701 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:54,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:54,701 INFO L82 PathProgramCache]: Analyzing trace with hash 188537050, now seen corresponding path program 20 times [2018-10-04 12:33:54,701 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:54,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:54,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:54,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:54,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:55,333 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:55,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:55,334 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:55,342 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:33:55,367 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:33:55,367 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:55,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:55,390 INFO L477 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 [2018-10-04 12:33:55,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:55,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:33:55,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:55,786 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:55,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:55,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 42 [2018-10-04 12:33:55,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-04 12:33:55,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-04 12:33:55,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-10-04 12:33:55,808 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2018-10-04 12:33:55,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:55,967 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-10-04 12:33:55,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 12:33:55,968 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2018-10-04 12:33:55,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:55,969 INFO L225 Difference]: With dead ends: 91 [2018-10-04 12:33:55,969 INFO L226 Difference]: Without dead ends: 90 [2018-10-04 12:33:55,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-10-04 12:33:55,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-04 12:33:55,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-10-04 12:33:55,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-04 12:33:55,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-10-04 12:33:55,974 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2018-10-04 12:33:55,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:55,974 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-10-04 12:33:55,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-04 12:33:55,975 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-10-04 12:33:55,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-04 12:33:55,975 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:55,976 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1] [2018-10-04 12:33:55,976 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:55,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:55,976 INFO L82 PathProgramCache]: Analyzing trace with hash -47911917, now seen corresponding path program 21 times [2018-10-04 12:33:55,976 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:55,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:55,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:55,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:55,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:56,412 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:56,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:56,413 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:56,421 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:33:56,474 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-04 12:33:56,474 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:56,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:56,481 INFO L477 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 [2018-10-04 12:33:56,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:56,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:33:56,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:58,293 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:58,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:58,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 44 [2018-10-04 12:33:58,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-04 12:33:58,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-04 12:33:58,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-10-04 12:33:58,315 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2018-10-04 12:33:58,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:58,461 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-10-04 12:33:58,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:33:58,462 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2018-10-04 12:33:58,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:58,464 INFO L225 Difference]: With dead ends: 95 [2018-10-04 12:33:58,464 INFO L226 Difference]: Without dead ends: 94 [2018-10-04 12:33:58,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-10-04 12:33:58,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-04 12:33:58,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-10-04 12:33:58,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-04 12:33:58,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-10-04 12:33:58,468 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2018-10-04 12:33:58,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:58,468 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-10-04 12:33:58,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-04 12:33:58,469 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-10-04 12:33:58,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-04 12:33:58,469 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:58,469 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1] [2018-10-04 12:33:58,470 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:58,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:58,470 INFO L82 PathProgramCache]: Analyzing trace with hash -907101492, now seen corresponding path program 22 times [2018-10-04 12:33:58,470 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:58,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:58,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:58,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:58,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:58,864 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:58,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:58,864 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:58,872 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:33:58,912 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:33:58,912 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:58,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:58,918 INFO L477 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 [2018-10-04 12:33:58,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:58,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:33:58,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:59,330 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:59,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:59,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 46 [2018-10-04 12:33:59,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-04 12:33:59,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-04 12:33:59,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-10-04 12:33:59,352 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2018-10-04 12:33:59,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:59,507 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-10-04 12:33:59,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 12:33:59,507 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2018-10-04 12:33:59,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:59,509 INFO L225 Difference]: With dead ends: 99 [2018-10-04 12:33:59,509 INFO L226 Difference]: Without dead ends: 98 [2018-10-04 12:33:59,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-10-04 12:33:59,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-04 12:33:59,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-10-04 12:33:59,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-04 12:33:59,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-04 12:33:59,514 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2018-10-04 12:33:59,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:59,514 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-10-04 12:33:59,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-04 12:33:59,514 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-04 12:33:59,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-04 12:33:59,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:59,515 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1] [2018-10-04 12:33:59,515 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:59,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:59,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1800439045, now seen corresponding path program 23 times [2018-10-04 12:33:59,516 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:59,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:59,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:59,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:59,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:59,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:59,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:59,978 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:59,986 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:34:00,039 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-10-04 12:34:00,039 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:00,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:00,062 INFO L477 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 [2018-10-04 12:34:00,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:00,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:00,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:00,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:00,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:00,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 48 [2018-10-04 12:34:00,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-04 12:34:00,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-04 12:34:00,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-10-04 12:34:00,753 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2018-10-04 12:34:01,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:01,035 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-10-04 12:34:01,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 12:34:01,035 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2018-10-04 12:34:01,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:01,037 INFO L225 Difference]: With dead ends: 103 [2018-10-04 12:34:01,037 INFO L226 Difference]: Without dead ends: 102 [2018-10-04 12:34:01,038 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-10-04 12:34:01,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-04 12:34:01,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-10-04 12:34:01,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-04 12:34:01,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-04 12:34:01,042 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2018-10-04 12:34:01,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:01,043 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-04 12:34:01,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-04 12:34:01,043 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-04 12:34:01,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-04 12:34:01,044 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:01,044 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1] [2018-10-04 12:34:01,044 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:01,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:01,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1780446530, now seen corresponding path program 24 times [2018-10-04 12:34:01,045 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:01,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:01,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:01,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:01,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:01,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:01,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:01,486 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:01,495 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:34:01,556 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-04 12:34:01,556 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:01,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:01,566 INFO L477 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 [2018-10-04 12:34:01,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:01,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:01,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:02,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:02,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:02,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 50 [2018-10-04 12:34:02,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-04 12:34:02,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-04 12:34:02,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-10-04 12:34:02,076 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2018-10-04 12:34:02,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:02,274 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-10-04 12:34:02,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 12:34:02,274 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2018-10-04 12:34:02,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:02,275 INFO L225 Difference]: With dead ends: 107 [2018-10-04 12:34:02,275 INFO L226 Difference]: Without dead ends: 106 [2018-10-04 12:34:02,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-10-04 12:34:02,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-04 12:34:02,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-10-04 12:34:02,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-04 12:34:02,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-10-04 12:34:02,280 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2018-10-04 12:34:02,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:02,280 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-10-04 12:34:02,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-04 12:34:02,280 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-10-04 12:34:02,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-04 12:34:02,281 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:02,281 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1] [2018-10-04 12:34:02,281 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:02,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:02,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1226116087, now seen corresponding path program 25 times [2018-10-04 12:34:02,282 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:02,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:02,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:02,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:02,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:02,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:02,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:02,763 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:02,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:02,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:02,808 INFO L477 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 [2018-10-04 12:34:02,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:02,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:02,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:03,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:03,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:03,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 52 [2018-10-04 12:34:03,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-04 12:34:03,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-04 12:34:03,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-10-04 12:34:03,658 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2018-10-04 12:34:03,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:03,856 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-10-04 12:34:03,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 12:34:03,857 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2018-10-04 12:34:03,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:03,858 INFO L225 Difference]: With dead ends: 111 [2018-10-04 12:34:03,858 INFO L226 Difference]: Without dead ends: 110 [2018-10-04 12:34:03,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-10-04 12:34:03,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-04 12:34:03,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-10-04 12:34:03,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-04 12:34:03,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-10-04 12:34:03,864 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2018-10-04 12:34:03,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:03,865 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-10-04 12:34:03,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-04 12:34:03,865 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-10-04 12:34:03,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-04 12:34:03,865 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:03,866 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1] [2018-10-04 12:34:03,866 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:03,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:03,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1598310576, now seen corresponding path program 26 times [2018-10-04 12:34:03,866 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:03,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:03,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:03,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:03,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:04,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:04,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:04,387 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:04,394 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:34:04,426 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:34:04,427 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:04,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:04,433 INFO L477 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 [2018-10-04 12:34:04,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:04,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:04,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:04,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:05,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:05,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 54 [2018-10-04 12:34:05,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-04 12:34:05,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-04 12:34:05,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-10-04 12:34:05,004 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2018-10-04 12:34:05,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:05,217 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-10-04 12:34:05,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 12:34:05,218 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2018-10-04 12:34:05,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:05,219 INFO L225 Difference]: With dead ends: 115 [2018-10-04 12:34:05,219 INFO L226 Difference]: Without dead ends: 114 [2018-10-04 12:34:05,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-10-04 12:34:05,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-04 12:34:05,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-10-04 12:34:05,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-04 12:34:05,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-10-04 12:34:05,225 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2018-10-04 12:34:05,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:05,226 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-10-04 12:34:05,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-04 12:34:05,226 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-10-04 12:34:05,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-04 12:34:05,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:05,227 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1] [2018-10-04 12:34:05,227 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:05,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:05,228 INFO L82 PathProgramCache]: Analyzing trace with hash 497320169, now seen corresponding path program 27 times [2018-10-04 12:34:05,228 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:05,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:05,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:05,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:05,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:05,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:05,782 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:05,789 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:34:05,866 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-10-04 12:34:05,867 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:05,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:05,910 INFO L477 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 [2018-10-04 12:34:05,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:06,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:06,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:06,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:06,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:06,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 56 [2018-10-04 12:34:06,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-04 12:34:06,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-04 12:34:06,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-10-04 12:34:06,553 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2018-10-04 12:34:06,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:06,755 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-10-04 12:34:06,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 12:34:06,755 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2018-10-04 12:34:06,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:06,757 INFO L225 Difference]: With dead ends: 119 [2018-10-04 12:34:06,757 INFO L226 Difference]: Without dead ends: 118 [2018-10-04 12:34:06,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-10-04 12:34:06,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-04 12:34:06,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-10-04 12:34:06,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-04 12:34:06,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-10-04 12:34:06,762 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2018-10-04 12:34:06,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:06,762 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-10-04 12:34:06,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-04 12:34:06,762 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-10-04 12:34:06,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-04 12:34:06,763 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:06,763 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1] [2018-10-04 12:34:06,763 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:06,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:06,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1001655134, now seen corresponding path program 28 times [2018-10-04 12:34:06,763 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:06,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:06,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:06,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:06,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:07,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:07,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:07,395 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:07,404 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:34:07,442 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:34:07,443 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:07,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:07,461 INFO L477 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 [2018-10-04 12:34:07,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:07,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:07,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:08,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:08,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:08,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 58 [2018-10-04 12:34:08,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-04 12:34:08,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-04 12:34:08,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-10-04 12:34:08,246 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2018-10-04 12:34:08,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:08,477 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-10-04 12:34:08,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 12:34:08,477 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2018-10-04 12:34:08,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:08,479 INFO L225 Difference]: With dead ends: 123 [2018-10-04 12:34:08,479 INFO L226 Difference]: Without dead ends: 122 [2018-10-04 12:34:08,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1624 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-10-04 12:34:08,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-04 12:34:08,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-10-04 12:34:08,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-04 12:34:08,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-10-04 12:34:08,484 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2018-10-04 12:34:08,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:08,485 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-10-04 12:34:08,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-04 12:34:08,485 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-10-04 12:34:08,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-04 12:34:08,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:08,486 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1] [2018-10-04 12:34:08,486 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:08,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:08,486 INFO L82 PathProgramCache]: Analyzing trace with hash 506520539, now seen corresponding path program 29 times [2018-10-04 12:34:08,486 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:08,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:08,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:08,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:08,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:09,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:09,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:09,110 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:09,118 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:34:09,195 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-10-04 12:34:09,195 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:09,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:09,202 INFO L477 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 [2018-10-04 12:34:09,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:09,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:09,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:09,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:09,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:09,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 60 [2018-10-04 12:34:09,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-04 12:34:09,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-04 12:34:09,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-10-04 12:34:09,897 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2018-10-04 12:34:10,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:10,154 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-10-04 12:34:10,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 12:34:10,155 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2018-10-04 12:34:10,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:10,156 INFO L225 Difference]: With dead ends: 127 [2018-10-04 12:34:10,156 INFO L226 Difference]: Without dead ends: 126 [2018-10-04 12:34:10,158 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-10-04 12:34:10,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-04 12:34:10,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-10-04 12:34:10,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-04 12:34:10,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-10-04 12:34:10,177 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2018-10-04 12:34:10,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:10,177 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-10-04 12:34:10,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-04 12:34:10,177 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-10-04 12:34:10,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-04 12:34:10,178 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:10,178 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1] [2018-10-04 12:34:10,178 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:10,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:10,179 INFO L82 PathProgramCache]: Analyzing trace with hash 287936148, now seen corresponding path program 30 times [2018-10-04 12:34:10,179 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:10,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:10,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:10,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:10,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:10,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:10,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:10,825 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:10,834 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:34:10,931 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-04 12:34:10,931 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:10,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:10,937 INFO L477 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 [2018-10-04 12:34:10,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:10,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:10,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:11,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:11,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:11,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 62 [2018-10-04 12:34:11,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-04 12:34:11,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-04 12:34:11,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-10-04 12:34:11,645 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2018-10-04 12:34:11,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:11,856 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-10-04 12:34:11,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 12:34:11,856 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2018-10-04 12:34:11,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:11,857 INFO L225 Difference]: With dead ends: 131 [2018-10-04 12:34:11,857 INFO L226 Difference]: Without dead ends: 130 [2018-10-04 12:34:11,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1860 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-10-04 12:34:11,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-04 12:34:11,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-10-04 12:34:11,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-04 12:34:11,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-10-04 12:34:11,863 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2018-10-04 12:34:11,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:11,863 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-10-04 12:34:11,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-04 12:34:11,863 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-10-04 12:34:11,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-04 12:34:11,864 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:11,864 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1] [2018-10-04 12:34:11,864 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:11,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:11,865 INFO L82 PathProgramCache]: Analyzing trace with hash 770454733, now seen corresponding path program 31 times [2018-10-04 12:34:11,865 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:11,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:11,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:11,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:11,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:12,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:12,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:12,545 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:12,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:12,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:12,628 INFO L477 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 [2018-10-04 12:34:12,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:12,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:12,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:13,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:13,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:13,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 64 [2018-10-04 12:34:13,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-04 12:34:13,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-04 12:34:13,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-10-04 12:34:13,654 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2018-10-04 12:34:13,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:13,853 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-10-04 12:34:13,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 12:34:13,853 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2018-10-04 12:34:13,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:13,855 INFO L225 Difference]: With dead ends: 135 [2018-10-04 12:34:13,855 INFO L226 Difference]: Without dead ends: 134 [2018-10-04 12:34:13,856 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-10-04 12:34:13,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-04 12:34:13,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-10-04 12:34:13,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-04 12:34:13,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-10-04 12:34:13,861 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2018-10-04 12:34:13,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:13,861 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-10-04 12:34:13,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-04 12:34:13,861 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-10-04 12:34:13,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-04 12:34:13,862 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:13,862 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1] [2018-10-04 12:34:13,862 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:13,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:13,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1074730630, now seen corresponding path program 32 times [2018-10-04 12:34:13,863 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:13,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:13,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:13,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:13,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:14,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:14,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:14,589 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:14,598 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:34:14,652 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:34:14,653 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:14,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:14,660 INFO L477 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 [2018-10-04 12:34:14,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:14,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:14,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:15,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:15,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:15,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 66 [2018-10-04 12:34:15,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-04 12:34:15,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-04 12:34:15,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-10-04 12:34:15,765 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2018-10-04 12:34:15,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:15,987 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-10-04 12:34:15,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-04 12:34:15,988 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2018-10-04 12:34:15,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:15,989 INFO L225 Difference]: With dead ends: 139 [2018-10-04 12:34:15,989 INFO L226 Difference]: Without dead ends: 138 [2018-10-04 12:34:15,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-10-04 12:34:15,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-04 12:34:15,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-10-04 12:34:15,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-04 12:34:15,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-10-04 12:34:15,995 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2018-10-04 12:34:15,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:15,996 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-10-04 12:34:15,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-04 12:34:15,996 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-10-04 12:34:15,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-04 12:34:15,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:15,997 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1] [2018-10-04 12:34:15,997 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:15,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:15,997 INFO L82 PathProgramCache]: Analyzing trace with hash -569871425, now seen corresponding path program 33 times [2018-10-04 12:34:15,997 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:15,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:15,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:15,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:15,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:16,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:16,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:16,927 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:16,935 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:34:17,033 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-10-04 12:34:17,033 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:17,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:17,053 INFO L477 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 [2018-10-04 12:34:17,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:17,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:17,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:19,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:19,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:19,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 68 [2018-10-04 12:34:19,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-04 12:34:19,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-04 12:34:19,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-10-04 12:34:19,469 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2018-10-04 12:34:19,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:19,811 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-10-04 12:34:19,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 12:34:19,815 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2018-10-04 12:34:19,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:19,816 INFO L225 Difference]: With dead ends: 143 [2018-10-04 12:34:19,816 INFO L226 Difference]: Without dead ends: 142 [2018-10-04 12:34:19,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-10-04 12:34:19,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-04 12:34:19,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-10-04 12:34:19,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-04 12:34:19,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-10-04 12:34:19,821 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2018-10-04 12:34:19,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:19,821 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-10-04 12:34:19,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-04 12:34:19,821 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-10-04 12:34:19,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-04 12:34:19,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:19,822 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1] [2018-10-04 12:34:19,822 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:19,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:19,823 INFO L82 PathProgramCache]: Analyzing trace with hash -114389896, now seen corresponding path program 34 times [2018-10-04 12:34:19,823 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:19,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:19,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:19,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:19,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:21,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:21,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:21,232 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:21,242 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:34:21,287 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:34:21,287 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:21,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:21,294 INFO L477 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 [2018-10-04 12:34:21,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:21,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:21,392 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:22,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:22,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:22,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 70 [2018-10-04 12:34:22,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-04 12:34:22,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-04 12:34:22,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-10-04 12:34:22,312 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2018-10-04 12:34:22,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:22,721 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-10-04 12:34:22,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 12:34:22,722 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2018-10-04 12:34:22,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:22,723 INFO L225 Difference]: With dead ends: 147 [2018-10-04 12:34:22,723 INFO L226 Difference]: Without dead ends: 146 [2018-10-04 12:34:22,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2380 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-10-04 12:34:22,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-04 12:34:22,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-10-04 12:34:22,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-04 12:34:22,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-10-04 12:34:22,731 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2018-10-04 12:34:22,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:22,731 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-10-04 12:34:22,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-04 12:34:22,731 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-10-04 12:34:22,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-04 12:34:22,732 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:22,732 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1] [2018-10-04 12:34:22,733 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:22,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:22,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1840750769, now seen corresponding path program 35 times [2018-10-04 12:34:22,733 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:22,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:22,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:22,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:22,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:23,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:23,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:23,899 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:23,906 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:34:23,995 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-10-04 12:34:23,996 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:23,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:24,005 INFO L477 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 [2018-10-04 12:34:24,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:24,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:24,016 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:24,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:24,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:24,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 72 [2018-10-04 12:34:24,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-04 12:34:24,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-04 12:34:24,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-10-04 12:34:24,899 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2018-10-04 12:34:25,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:25,308 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-10-04 12:34:25,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 12:34:25,308 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2018-10-04 12:34:25,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:25,313 INFO L225 Difference]: With dead ends: 151 [2018-10-04 12:34:25,313 INFO L226 Difference]: Without dead ends: 150 [2018-10-04 12:34:25,313 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-10-04 12:34:25,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-04 12:34:25,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-10-04 12:34:25,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-04 12:34:25,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-10-04 12:34:25,318 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2018-10-04 12:34:25,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:25,318 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-10-04 12:34:25,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-04 12:34:25,319 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-10-04 12:34:25,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-04 12:34:25,319 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:25,319 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1] [2018-10-04 12:34:25,320 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:25,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:25,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1833308054, now seen corresponding path program 36 times [2018-10-04 12:34:25,320 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:25,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:25,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:25,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:25,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:26,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:26,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:26,538 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:26,546 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:34:26,658 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-10-04 12:34:26,658 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:26,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:26,677 INFO L477 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 [2018-10-04 12:34:26,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:26,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:26,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:27,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:27,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:27,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 74 [2018-10-04 12:34:27,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-04 12:34:27,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-04 12:34:27,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-10-04 12:34:27,570 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2018-10-04 12:34:27,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:27,861 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-10-04 12:34:27,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 12:34:27,862 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2018-10-04 12:34:27,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:27,863 INFO L225 Difference]: With dead ends: 155 [2018-10-04 12:34:27,864 INFO L226 Difference]: Without dead ends: 154 [2018-10-04 12:34:27,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2664 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-10-04 12:34:27,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-04 12:34:27,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-10-04 12:34:27,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-04 12:34:27,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-10-04 12:34:27,869 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2018-10-04 12:34:27,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:27,870 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-10-04 12:34:27,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-04 12:34:27,870 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-10-04 12:34:27,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-04 12:34:27,871 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:27,871 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1] [2018-10-04 12:34:27,871 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:27,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:27,871 INFO L82 PathProgramCache]: Analyzing trace with hash -903103581, now seen corresponding path program 37 times [2018-10-04 12:34:27,872 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:27,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:27,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:27,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:27,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:29,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:29,535 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:29,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:29,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:29,616 INFO L477 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 [2018-10-04 12:34:29,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:29,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:29,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:30,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:30,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:30,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 76 [2018-10-04 12:34:30,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-04 12:34:30,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-04 12:34:30,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-10-04 12:34:30,732 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2018-10-04 12:34:31,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:31,008 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-10-04 12:34:31,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-04 12:34:31,009 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2018-10-04 12:34:31,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:31,010 INFO L225 Difference]: With dead ends: 159 [2018-10-04 12:34:31,010 INFO L226 Difference]: Without dead ends: 158 [2018-10-04 12:34:31,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-10-04 12:34:31,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-04 12:34:31,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-10-04 12:34:31,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-04 12:34:31,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-10-04 12:34:31,016 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2018-10-04 12:34:31,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:31,016 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-10-04 12:34:31,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-04 12:34:31,017 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-10-04 12:34:31,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-04 12:34:31,017 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:31,018 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1] [2018-10-04 12:34:31,018 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:31,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:31,018 INFO L82 PathProgramCache]: Analyzing trace with hash 283329116, now seen corresponding path program 38 times [2018-10-04 12:34:31,018 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:31,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:31,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:31,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:31,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:32,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:32,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:32,879 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:32,887 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:34:32,932 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:34:32,933 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:32,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:32,953 INFO L477 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 [2018-10-04 12:34:32,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:32,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:32,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:34,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:34,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:34,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 78 [2018-10-04 12:34:34,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-04 12:34:34,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-04 12:34:34,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-10-04 12:34:34,322 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2018-10-04 12:34:34,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:34,663 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-10-04 12:34:34,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-04 12:34:34,664 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2018-10-04 12:34:34,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:34,665 INFO L225 Difference]: With dead ends: 163 [2018-10-04 12:34:34,665 INFO L226 Difference]: Without dead ends: 162 [2018-10-04 12:34:34,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2964 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-10-04 12:34:34,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-04 12:34:34,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-10-04 12:34:34,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-04 12:34:34,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-10-04 12:34:34,672 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2018-10-04 12:34:34,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:34,672 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-10-04 12:34:34,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-04 12:34:34,672 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-10-04 12:34:34,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-04 12:34:34,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:34,673 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1] [2018-10-04 12:34:34,674 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:34,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:34,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1902721899, now seen corresponding path program 39 times [2018-10-04 12:34:34,674 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:34,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:34,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:34,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:34,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:36,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:36,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:36,136 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:36,143 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:34:36,312 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-10-04 12:34:36,313 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:36,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:36,320 INFO L477 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 [2018-10-04 12:34:36,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:36,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:36,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:37,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:37,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:37,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 80 [2018-10-04 12:34:37,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-04 12:34:37,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-04 12:34:37,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-10-04 12:34:37,365 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2018-10-04 12:34:37,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:37,808 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-10-04 12:34:37,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-04 12:34:37,808 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2018-10-04 12:34:37,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:37,809 INFO L225 Difference]: With dead ends: 167 [2018-10-04 12:34:37,809 INFO L226 Difference]: Without dead ends: 166 [2018-10-04 12:34:37,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-10-04 12:34:37,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-04 12:34:37,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-10-04 12:34:37,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-04 12:34:37,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-10-04 12:34:37,815 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2018-10-04 12:34:37,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:37,815 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-10-04 12:34:37,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-04 12:34:37,815 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-10-04 12:34:37,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-04 12:34:37,815 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:37,816 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1] [2018-10-04 12:34:37,816 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:37,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:37,816 INFO L82 PathProgramCache]: Analyzing trace with hash 635208270, now seen corresponding path program 40 times [2018-10-04 12:34:37,816 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:37,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:37,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:37,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:37,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:39,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:39,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:39,219 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:39,228 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:34:39,277 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:34:39,277 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:39,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:39,299 INFO L477 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 [2018-10-04 12:34:39,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:39,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:39,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:40,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:40,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:40,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 82 [2018-10-04 12:34:40,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-04 12:34:40,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-04 12:34:40,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-10-04 12:34:40,470 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2018-10-04 12:34:40,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:40,731 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-10-04 12:34:40,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 12:34:40,732 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2018-10-04 12:34:40,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:40,733 INFO L225 Difference]: With dead ends: 171 [2018-10-04 12:34:40,733 INFO L226 Difference]: Without dead ends: 170 [2018-10-04 12:34:40,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3280 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-10-04 12:34:40,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-04 12:34:40,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-10-04 12:34:40,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-10-04 12:34:40,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-10-04 12:34:40,739 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2018-10-04 12:34:40,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:40,740 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-10-04 12:34:40,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-04 12:34:40,740 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-10-04 12:34:40,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-04 12:34:40,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:40,741 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1] [2018-10-04 12:34:40,741 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:40,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:40,741 INFO L82 PathProgramCache]: Analyzing trace with hash 69909383, now seen corresponding path program 41 times [2018-10-04 12:34:40,741 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:40,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:40,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:40,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:40,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:42,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:42,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:42,227 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:42,242 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:34:42,437 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-10-04 12:34:42,437 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:42,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:42,466 INFO L477 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 [2018-10-04 12:34:42,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:42,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:42,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:43,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:43,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:43,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 84 [2018-10-04 12:34:43,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-04 12:34:43,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-04 12:34:43,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-10-04 12:34:43,696 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2018-10-04 12:34:44,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:44,079 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-10-04 12:34:44,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-04 12:34:44,079 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2018-10-04 12:34:44,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:44,080 INFO L225 Difference]: With dead ends: 175 [2018-10-04 12:34:44,080 INFO L226 Difference]: Without dead ends: 174 [2018-10-04 12:34:44,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3444 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-10-04 12:34:44,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-04 12:34:44,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-10-04 12:34:44,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-04 12:34:44,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-10-04 12:34:44,085 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2018-10-04 12:34:44,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:44,086 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-10-04 12:34:44,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-04 12:34:44,086 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-10-04 12:34:44,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-04 12:34:44,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:44,087 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1] [2018-10-04 12:34:44,087 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:44,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:44,088 INFO L82 PathProgramCache]: Analyzing trace with hash 836218944, now seen corresponding path program 42 times [2018-10-04 12:34:44,088 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:44,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:44,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:44,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:44,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:45,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:45,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:45,115 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:45,130 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:34:45,396 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-10-04 12:34:45,396 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:45,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:45,407 INFO L477 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 [2018-10-04 12:34:45,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:45,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:45,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:46,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:46,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:46,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 86 [2018-10-04 12:34:46,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-04 12:34:46,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-04 12:34:46,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-10-04 12:34:46,636 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2018-10-04 12:34:47,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:47,571 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-10-04 12:34:47,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 12:34:47,571 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2018-10-04 12:34:47,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:47,573 INFO L225 Difference]: With dead ends: 179 [2018-10-04 12:34:47,573 INFO L226 Difference]: Without dead ends: 178 [2018-10-04 12:34:47,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3612 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-10-04 12:34:47,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-04 12:34:47,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-10-04 12:34:47,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-04 12:34:47,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-10-04 12:34:47,578 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2018-10-04 12:34:47,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:47,578 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-10-04 12:34:47,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-04 12:34:47,579 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-10-04 12:34:47,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-04 12:34:47,579 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:47,580 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1] [2018-10-04 12:34:47,580 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:47,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:47,580 INFO L82 PathProgramCache]: Analyzing trace with hash 572104825, now seen corresponding path program 43 times [2018-10-04 12:34:47,580 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:47,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:47,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:47,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:47,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:48,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:48,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:48,616 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:48,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:48,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:48,684 INFO L477 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 [2018-10-04 12:34:48,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:48,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:48,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:50,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:50,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:50,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 88 [2018-10-04 12:34:50,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-04 12:34:50,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-04 12:34:50,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-10-04 12:34:50,257 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2018-10-04 12:34:50,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:50,543 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-10-04 12:34:50,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-04 12:34:50,543 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2018-10-04 12:34:50,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:50,544 INFO L225 Difference]: With dead ends: 183 [2018-10-04 12:34:50,544 INFO L226 Difference]: Without dead ends: 182 [2018-10-04 12:34:50,545 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3784 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-10-04 12:34:50,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-04 12:34:50,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-10-04 12:34:50,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-04 12:34:50,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-10-04 12:34:50,550 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176 [2018-10-04 12:34:50,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:50,550 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-10-04 12:34:50,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-04 12:34:50,551 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-10-04 12:34:50,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-04 12:34:50,551 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:50,551 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1] [2018-10-04 12:34:50,551 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:50,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:50,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1124518962, now seen corresponding path program 44 times [2018-10-04 12:34:50,552 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:50,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:50,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:50,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:50,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:51,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:51,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:51,658 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:51,667 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:34:51,720 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:34:51,720 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:51,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:51,726 INFO L477 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 [2018-10-04 12:34:51,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:51,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:51,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:53,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:53,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:53,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 90 [2018-10-04 12:34:53,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-04 12:34:53,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-04 12:34:53,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-10-04 12:34:53,132 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2018-10-04 12:34:53,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:53,421 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-10-04 12:34:53,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-04 12:34:53,421 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2018-10-04 12:34:53,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:53,423 INFO L225 Difference]: With dead ends: 187 [2018-10-04 12:34:53,423 INFO L226 Difference]: Without dead ends: 186 [2018-10-04 12:34:53,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3960 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-10-04 12:34:53,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-10-04 12:34:53,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-10-04 12:34:53,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-04 12:34:53,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-10-04 12:34:53,429 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2018-10-04 12:34:53,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:53,429 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-10-04 12:34:53,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-04 12:34:53,430 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-10-04 12:34:53,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-04 12:34:53,430 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:53,431 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1] [2018-10-04 12:34:53,431 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:53,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:53,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1919585429, now seen corresponding path program 45 times [2018-10-04 12:34:53,431 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:53,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:53,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:53,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:53,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:54,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:54,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:54,911 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:54,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:34:55,085 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-10-04 12:34:55,085 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:55,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:55,092 INFO L477 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 [2018-10-04 12:34:55,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:55,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:55,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:56,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:56,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:56,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 92 [2018-10-04 12:34:56,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-04 12:34:56,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-04 12:34:56,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-10-04 12:34:56,499 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2018-10-04 12:34:56,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:56,809 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-10-04 12:34:56,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-04 12:34:56,809 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2018-10-04 12:34:56,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:56,811 INFO L225 Difference]: With dead ends: 191 [2018-10-04 12:34:56,811 INFO L226 Difference]: Without dead ends: 190 [2018-10-04 12:34:56,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-10-04 12:34:56,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-04 12:34:56,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-10-04 12:34:56,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-04 12:34:56,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-10-04 12:34:56,817 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2018-10-04 12:34:56,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:56,817 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-10-04 12:34:56,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-04 12:34:56,818 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-10-04 12:34:56,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-04 12:34:56,818 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:56,818 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1] [2018-10-04 12:34:56,819 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:56,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:56,819 INFO L82 PathProgramCache]: Analyzing trace with hash 362534436, now seen corresponding path program 46 times [2018-10-04 12:34:56,819 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:56,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:56,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:56,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:56,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:58,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:58,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:58,184 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:58,193 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:34:58,250 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:34:58,250 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:58,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:58,257 INFO L477 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 [2018-10-04 12:34:58,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:58,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:58,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:00,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:00,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:00,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 94 [2018-10-04 12:35:00,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-04 12:35:00,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-04 12:35:00,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-10-04 12:35:00,815 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2018-10-04 12:35:01,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:01,157 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-10-04 12:35:01,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-04 12:35:01,158 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2018-10-04 12:35:01,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:01,159 INFO L225 Difference]: With dead ends: 195 [2018-10-04 12:35:01,159 INFO L226 Difference]: Without dead ends: 194 [2018-10-04 12:35:01,160 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4324 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-10-04 12:35:01,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-04 12:35:01,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-10-04 12:35:01,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-04 12:35:01,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-10-04 12:35:01,164 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2018-10-04 12:35:01,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:01,165 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-10-04 12:35:01,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-04 12:35:01,165 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-10-04 12:35:01,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-04 12:35:01,166 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:01,166 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1] [2018-10-04 12:35:01,166 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:01,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:01,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1714408355, now seen corresponding path program 47 times [2018-10-04 12:35:01,167 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:01,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:01,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:01,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:01,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:03,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:03,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:03,084 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:03,091 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:35:03,224 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-10-04 12:35:03,224 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:03,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:03,252 INFO L477 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 [2018-10-04 12:35:03,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:03,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:35:03,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:05,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:05,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:05,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 96 [2018-10-04 12:35:05,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-10-04 12:35:05,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-10-04 12:35:05,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-10-04 12:35:05,150 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2018-10-04 12:35:05,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:05,568 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-10-04 12:35:05,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-04 12:35:05,569 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2018-10-04 12:35:05,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:05,570 INFO L225 Difference]: With dead ends: 199 [2018-10-04 12:35:05,570 INFO L226 Difference]: Without dead ends: 198 [2018-10-04 12:35:05,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-10-04 12:35:05,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-04 12:35:05,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2018-10-04 12:35:05,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-04 12:35:05,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-10-04 12:35:05,578 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2018-10-04 12:35:05,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:05,578 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-10-04 12:35:05,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-10-04 12:35:05,578 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-10-04 12:35:05,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-04 12:35:05,579 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:05,579 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1] [2018-10-04 12:35:05,580 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:05,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:05,580 INFO L82 PathProgramCache]: Analyzing trace with hash 331927062, now seen corresponding path program 48 times [2018-10-04 12:35:05,580 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:05,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:05,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:05,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:05,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:07,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:07,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:07,074 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:07,081 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:35:07,274 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-10-04 12:35:07,274 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:07,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:07,282 INFO L477 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 [2018-10-04 12:35:07,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:07,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:35:07,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:08,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:08,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:08,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 98 [2018-10-04 12:35:08,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-10-04 12:35:08,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-10-04 12:35:08,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-10-04 12:35:08,784 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2018-10-04 12:35:09,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:09,145 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-10-04 12:35:09,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-04 12:35:09,145 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2018-10-04 12:35:09,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:09,147 INFO L225 Difference]: With dead ends: 203 [2018-10-04 12:35:09,147 INFO L226 Difference]: Without dead ends: 202 [2018-10-04 12:35:09,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4704 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-10-04 12:35:09,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-10-04 12:35:09,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-10-04 12:35:09,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-04 12:35:09,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-10-04 12:35:09,153 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2018-10-04 12:35:09,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:09,153 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-10-04 12:35:09,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-10-04 12:35:09,153 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-10-04 12:35:09,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-04 12:35:09,154 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:09,154 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1] [2018-10-04 12:35:09,154 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:09,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:09,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1207690063, now seen corresponding path program 49 times [2018-10-04 12:35:09,154 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:09,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:09,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:09,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:09,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:10,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:10,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:10,720 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:10,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:10,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:10,811 INFO L477 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 [2018-10-04 12:35:10,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:10,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:35:10,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:12,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:12,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:12,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 100 [2018-10-04 12:35:12,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-04 12:35:12,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-04 12:35:12,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-10-04 12:35:12,383 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2018-10-04 12:35:12,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:12,719 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-10-04 12:35:12,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-04 12:35:12,719 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2018-10-04 12:35:12,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:12,721 INFO L225 Difference]: With dead ends: 207 [2018-10-04 12:35:12,721 INFO L226 Difference]: Without dead ends: 206 [2018-10-04 12:35:12,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-10-04 12:35:12,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-04 12:35:12,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2018-10-04 12:35:12,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-04 12:35:12,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-10-04 12:35:12,727 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2018-10-04 12:35:12,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:12,727 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-10-04 12:35:12,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-04 12:35:12,727 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-10-04 12:35:12,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-04 12:35:12,728 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:12,728 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1] [2018-10-04 12:35:12,729 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:12,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:12,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1438626824, now seen corresponding path program 50 times [2018-10-04 12:35:12,729 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:12,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:12,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:12,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:12,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:14,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:14,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:14,118 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:14,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:35:14,186 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:35:14,187 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:14,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:14,193 INFO L477 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 [2018-10-04 12:35:14,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:14,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:35:14,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:16,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:16,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:16,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 102 [2018-10-04 12:35:16,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-10-04 12:35:16,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-10-04 12:35:16,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-10-04 12:35:16,318 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2018-10-04 12:35:16,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:16,657 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-10-04 12:35:16,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-04 12:35:16,658 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2018-10-04 12:35:16,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:16,660 INFO L225 Difference]: With dead ends: 211 [2018-10-04 12:35:16,660 INFO L226 Difference]: Without dead ends: 210 [2018-10-04 12:35:16,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5100 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-10-04 12:35:16,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-10-04 12:35:16,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2018-10-04 12:35:16,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-04 12:35:16,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-10-04 12:35:16,666 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2018-10-04 12:35:16,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:16,666 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-10-04 12:35:16,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-10-04 12:35:16,666 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-10-04 12:35:16,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-04 12:35:16,667 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:16,667 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1] [2018-10-04 12:35:16,668 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:16,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:16,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1196064833, now seen corresponding path program 51 times [2018-10-04 12:35:16,668 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:16,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:16,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:16,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:16,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:18,282 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:18,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:18,282 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:18,291 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:35:18,664 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-10-04 12:35:18,664 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:18,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:18,680 INFO L477 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 [2018-10-04 12:35:18,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:18,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:35:18,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:20,634 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:20,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:20,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 104 [2018-10-04 12:35:20,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-10-04 12:35:20,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-10-04 12:35:20,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-10-04 12:35:20,658 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2018-10-04 12:35:21,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:21,006 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-10-04 12:35:21,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-04 12:35:21,006 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2018-10-04 12:35:21,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:21,008 INFO L225 Difference]: With dead ends: 215 [2018-10-04 12:35:21,008 INFO L226 Difference]: Without dead ends: 214 [2018-10-04 12:35:21,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5304 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-10-04 12:35:21,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-04 12:35:21,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2018-10-04 12:35:21,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-04 12:35:21,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-10-04 12:35:21,015 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2018-10-04 12:35:21,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:21,015 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-10-04 12:35:21,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-10-04 12:35:21,015 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-10-04 12:35:21,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-04 12:35:21,016 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:21,017 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1] [2018-10-04 12:35:21,017 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:21,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:21,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1582135302, now seen corresponding path program 52 times [2018-10-04 12:35:21,017 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:21,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:21,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:21,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:21,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:22,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:22,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:22,701 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:22,710 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:35:22,770 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:35:22,771 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:22,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:22,797 INFO L477 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 [2018-10-04 12:35:22,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:22,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:35:22,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:24,518 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:24,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:24,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 106 [2018-10-04 12:35:24,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-04 12:35:24,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-04 12:35:24,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-10-04 12:35:24,542 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2018-10-04 12:35:24,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:24,929 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-10-04 12:35:24,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-04 12:35:24,930 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2018-10-04 12:35:24,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:24,930 INFO L225 Difference]: With dead ends: 219 [2018-10-04 12:35:24,931 INFO L226 Difference]: Without dead ends: 218 [2018-10-04 12:35:24,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5512 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-10-04 12:35:24,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-04 12:35:24,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2018-10-04 12:35:24,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-04 12:35:24,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-10-04 12:35:24,937 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2018-10-04 12:35:24,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:24,937 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-10-04 12:35:24,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-04 12:35:24,938 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-10-04 12:35:24,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-04 12:35:24,939 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:24,939 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1] [2018-10-04 12:35:24,939 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:24,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:24,939 INFO L82 PathProgramCache]: Analyzing trace with hash -185726157, now seen corresponding path program 53 times [2018-10-04 12:35:24,940 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:24,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:24,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:24,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:24,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:26,560 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:26,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:26,560 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:26,568 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:35:26,716 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-10-04 12:35:26,717 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:26,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:26,725 INFO L477 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 [2018-10-04 12:35:26,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:26,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:35:26,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:28,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:28,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:28,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 108 [2018-10-04 12:35:28,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-10-04 12:35:28,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-10-04 12:35:28,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-10-04 12:35:28,530 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2018-10-04 12:35:28,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:28,899 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-10-04 12:35:28,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-04 12:35:28,900 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2018-10-04 12:35:28,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:28,901 INFO L225 Difference]: With dead ends: 223 [2018-10-04 12:35:28,902 INFO L226 Difference]: Without dead ends: 222 [2018-10-04 12:35:28,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5724 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-10-04 12:35:28,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-10-04 12:35:28,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2018-10-04 12:35:28,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-04 12:35:28,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-10-04 12:35:28,906 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2018-10-04 12:35:28,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:28,907 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-10-04 12:35:28,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-10-04 12:35:28,907 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-10-04 12:35:28,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-04 12:35:28,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:28,908 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1] [2018-10-04 12:35:28,908 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:28,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:28,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1809009132, now seen corresponding path program 54 times [2018-10-04 12:35:28,908 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:28,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:28,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:28,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:28,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:30,703 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:30,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:30,703 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:30,711 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:35:30,932 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-10-04 12:35:30,933 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:30,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:30,941 INFO L477 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 [2018-10-04 12:35:30,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:30,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:35:30,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:32,791 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:32,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:32,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 110 [2018-10-04 12:35:32,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-10-04 12:35:32,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-10-04 12:35:32,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-10-04 12:35:32,813 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2018-10-04 12:35:33,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:33,149 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-10-04 12:35:33,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-04 12:35:33,149 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2018-10-04 12:35:33,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:33,151 INFO L225 Difference]: With dead ends: 227 [2018-10-04 12:35:33,151 INFO L226 Difference]: Without dead ends: 226 [2018-10-04 12:35:33,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5940 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-10-04 12:35:33,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-10-04 12:35:33,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-10-04 12:35:33,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-04 12:35:33,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-10-04 12:35:33,158 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2018-10-04 12:35:33,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:33,158 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-10-04 12:35:33,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-10-04 12:35:33,158 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-10-04 12:35:33,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-04 12:35:33,159 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:33,159 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1] [2018-10-04 12:35:33,160 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:33,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:33,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1545110565, now seen corresponding path program 55 times [2018-10-04 12:35:33,160 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:33,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:33,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:33,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:33,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:34,765 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:34,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:34,766 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:34,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:34,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:34,843 INFO L477 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 [2018-10-04 12:35:34,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:34,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:35:34,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:36,998 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:37,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:37,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 112 [2018-10-04 12:35:37,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-10-04 12:35:37,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-10-04 12:35:37,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-10-04 12:35:37,020 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2018-10-04 12:35:37,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:37,442 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-10-04 12:35:37,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-04 12:35:37,443 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2018-10-04 12:35:37,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:37,445 INFO L225 Difference]: With dead ends: 231 [2018-10-04 12:35:37,445 INFO L226 Difference]: Without dead ends: 230 [2018-10-04 12:35:37,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6160 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-10-04 12:35:37,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-04 12:35:37,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-10-04 12:35:37,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-04 12:35:37,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-10-04 12:35:37,451 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2018-10-04 12:35:37,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:37,452 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-10-04 12:35:37,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-10-04 12:35:37,452 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-10-04 12:35:37,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-04 12:35:37,453 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:37,453 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1] [2018-10-04 12:35:37,454 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:37,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:37,454 INFO L82 PathProgramCache]: Analyzing trace with hash -699139618, now seen corresponding path program 56 times [2018-10-04 12:35:37,454 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:37,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:37,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:37,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:37,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:39,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:39,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:39,084 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:39,093 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:35:39,171 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:35:39,171 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:39,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:39,179 INFO L477 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 [2018-10-04 12:35:39,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:39,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:35:39,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:41,852 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:41,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:41,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 114 [2018-10-04 12:35:41,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-10-04 12:35:41,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-10-04 12:35:41,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-10-04 12:35:41,874 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2018-10-04 12:35:42,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:42,350 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-10-04 12:35:42,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-04 12:35:42,351 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2018-10-04 12:35:42,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:42,352 INFO L225 Difference]: With dead ends: 235 [2018-10-04 12:35:42,352 INFO L226 Difference]: Without dead ends: 234 [2018-10-04 12:35:42,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6384 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-10-04 12:35:42,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-04 12:35:42,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-10-04 12:35:42,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-04 12:35:42,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-10-04 12:35:42,357 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2018-10-04 12:35:42,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:42,358 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-10-04 12:35:42,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-10-04 12:35:42,358 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-10-04 12:35:42,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-04 12:35:42,359 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:42,359 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1] [2018-10-04 12:35:42,359 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:42,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:42,360 INFO L82 PathProgramCache]: Analyzing trace with hash 905702167, now seen corresponding path program 57 times [2018-10-04 12:35:42,360 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:42,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:42,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:42,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:42,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:44,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:44,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:44,292 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:44,299 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:35:44,582 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-10-04 12:35:44,582 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:44,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:44,595 INFO L477 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 [2018-10-04 12:35:44,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:44,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:35:44,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:47,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:47,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:47,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 116 [2018-10-04 12:35:47,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-10-04 12:35:47,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-10-04 12:35:47,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-10-04 12:35:47,073 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2018-10-04 12:35:47,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:47,534 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-10-04 12:35:47,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-04 12:35:47,535 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2018-10-04 12:35:47,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:47,536 INFO L225 Difference]: With dead ends: 239 [2018-10-04 12:35:47,536 INFO L226 Difference]: Without dead ends: 238 [2018-10-04 12:35:47,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6612 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-10-04 12:35:47,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-04 12:35:47,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2018-10-04 12:35:47,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-04 12:35:47,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-10-04 12:35:47,542 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2018-10-04 12:35:47,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:47,542 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-10-04 12:35:47,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-10-04 12:35:47,542 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-10-04 12:35:47,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-04 12:35:47,543 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:47,543 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1] [2018-10-04 12:35:47,543 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:47,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:47,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1318676528, now seen corresponding path program 58 times [2018-10-04 12:35:47,544 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:47,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:47,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:47,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:47,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:49,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:49,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:49,357 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:49,376 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:35:49,454 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:35:49,454 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:49,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:49,474 INFO L477 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 [2018-10-04 12:35:49,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:49,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:35:49,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:51,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:51,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:51,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 118 [2018-10-04 12:35:51,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-10-04 12:35:51,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-10-04 12:35:51,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-10-04 12:35:51,884 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2018-10-04 12:35:52,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:52,335 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-10-04 12:35:52,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-04 12:35:52,335 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2018-10-04 12:35:52,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:52,337 INFO L225 Difference]: With dead ends: 243 [2018-10-04 12:35:52,337 INFO L226 Difference]: Without dead ends: 242 [2018-10-04 12:35:52,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6844 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-10-04 12:35:52,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-10-04 12:35:52,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-10-04 12:35:52,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-04 12:35:52,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-10-04 12:35:52,342 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2018-10-04 12:35:52,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:52,342 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-10-04 12:35:52,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-10-04 12:35:52,342 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-10-04 12:35:52,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-04 12:35:52,343 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:52,343 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1] [2018-10-04 12:35:52,343 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:52,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:52,344 INFO L82 PathProgramCache]: Analyzing trace with hash -372621303, now seen corresponding path program 59 times [2018-10-04 12:35:52,344 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:52,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:52,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:52,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:52,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:54,179 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:54,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:54,179 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:54,188 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:35:54,368 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-10-04 12:35:54,368 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:54,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:54,378 INFO L477 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 [2018-10-04 12:35:54,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:54,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:35:54,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:56,789 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:56,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:56,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 120 [2018-10-04 12:35:56,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-10-04 12:35:56,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-10-04 12:35:56,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-10-04 12:35:56,812 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2018-10-04 12:35:57,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:57,210 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-10-04 12:35:57,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-04 12:35:57,210 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2018-10-04 12:35:57,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:57,212 INFO L225 Difference]: With dead ends: 247 [2018-10-04 12:35:57,212 INFO L226 Difference]: Without dead ends: 246 [2018-10-04 12:35:57,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7080 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-10-04 12:35:57,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-10-04 12:35:57,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2018-10-04 12:35:57,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-04 12:35:57,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-10-04 12:35:57,218 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2018-10-04 12:35:57,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:57,219 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-10-04 12:35:57,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-10-04 12:35:57,219 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-10-04 12:35:57,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-04 12:35:57,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:57,220 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1] [2018-10-04 12:35:57,221 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:57,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:57,221 INFO L82 PathProgramCache]: Analyzing trace with hash 2067604418, now seen corresponding path program 60 times [2018-10-04 12:35:57,221 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:57,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:57,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:57,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:57,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:59,064 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:59,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:59,064 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:59,072 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:35:59,320 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-10-04 12:35:59,321 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:59,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:59,330 INFO L477 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 [2018-10-04 12:35:59,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:59,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:35:59,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:01,825 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:01,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:01,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 122 [2018-10-04 12:36:01,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-10-04 12:36:01,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-10-04 12:36:01,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-10-04 12:36:01,847 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2018-10-04 12:36:02,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:02,350 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-10-04 12:36:02,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-04 12:36:02,350 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2018-10-04 12:36:02,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:02,351 INFO L225 Difference]: With dead ends: 251 [2018-10-04 12:36:02,351 INFO L226 Difference]: Without dead ends: 250 [2018-10-04 12:36:02,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7320 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-10-04 12:36:02,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-04 12:36:02,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2018-10-04 12:36:02,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-04 12:36:02,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-10-04 12:36:02,358 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2018-10-04 12:36:02,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:02,358 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-10-04 12:36:02,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-10-04 12:36:02,358 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-10-04 12:36:02,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-04 12:36:02,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:02,360 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1] [2018-10-04 12:36:02,360 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:02,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:02,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1934261509, now seen corresponding path program 61 times [2018-10-04 12:36:02,361 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:02,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:02,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:02,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:02,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:04,250 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:04,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:04,251 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:04,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:04,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:04,339 INFO L477 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 [2018-10-04 12:36:04,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:04,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:36:04,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:06,919 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:06,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:06,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 124 [2018-10-04 12:36:06,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-10-04 12:36:06,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-10-04 12:36:06,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-10-04 12:36:06,942 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2018-10-04 12:36:07,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:07,396 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-10-04 12:36:07,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-04 12:36:07,396 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2018-10-04 12:36:07,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:07,398 INFO L225 Difference]: With dead ends: 255 [2018-10-04 12:36:07,398 INFO L226 Difference]: Without dead ends: 254 [2018-10-04 12:36:07,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7564 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-10-04 12:36:07,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-04 12:36:07,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2018-10-04 12:36:07,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-10-04 12:36:07,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-10-04 12:36:07,404 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2018-10-04 12:36:07,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:07,404 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-10-04 12:36:07,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-10-04 12:36:07,404 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-10-04 12:36:07,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-04 12:36:07,405 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:07,405 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1] [2018-10-04 12:36:07,405 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:07,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:07,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1611242932, now seen corresponding path program 62 times [2018-10-04 12:36:07,405 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:07,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:07,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:07,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:07,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:09,340 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:09,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:09,341 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:09,349 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:36:09,421 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:36:09,421 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:09,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:09,433 INFO L477 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 [2018-10-04 12:36:09,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:09,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:36:09,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:12,015 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:12,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:12,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 126 [2018-10-04 12:36:12,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-10-04 12:36:12,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-10-04 12:36:12,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-10-04 12:36:12,038 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2018-10-04 12:36:12,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:12,510 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-10-04 12:36:12,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-04 12:36:12,510 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2018-10-04 12:36:12,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:12,512 INFO L225 Difference]: With dead ends: 259 [2018-10-04 12:36:12,512 INFO L226 Difference]: Without dead ends: 258 [2018-10-04 12:36:12,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7812 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-10-04 12:36:12,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-04 12:36:12,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2018-10-04 12:36:12,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-10-04 12:36:12,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-10-04 12:36:12,517 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2018-10-04 12:36:12,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:12,517 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-10-04 12:36:12,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-10-04 12:36:12,517 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-10-04 12:36:12,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-04 12:36:12,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:12,518 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1] [2018-10-04 12:36:12,519 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:12,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:12,519 INFO L82 PathProgramCache]: Analyzing trace with hash -504384531, now seen corresponding path program 63 times [2018-10-04 12:36:12,519 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:12,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:12,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:12,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:12,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:14,646 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:14,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:14,647 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:14,657 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:36:14,975 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-10-04 12:36:14,975 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:14,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:14,989 INFO L477 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 [2018-10-04 12:36:14,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:15,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:36:15,009 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:17,714 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:17,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:17,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 128 [2018-10-04 12:36:17,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-10-04 12:36:17,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-10-04 12:36:17,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-10-04 12:36:17,738 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2018-10-04 12:36:18,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:18,225 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-10-04 12:36:18,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-04 12:36:18,225 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2018-10-04 12:36:18,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:18,227 INFO L225 Difference]: With dead ends: 263 [2018-10-04 12:36:18,227 INFO L226 Difference]: Without dead ends: 262 [2018-10-04 12:36:18,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8064 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-10-04 12:36:18,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-10-04 12:36:18,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2018-10-04 12:36:18,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-10-04 12:36:18,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-10-04 12:36:18,234 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2018-10-04 12:36:18,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:18,235 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-10-04 12:36:18,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-10-04 12:36:18,235 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-10-04 12:36:18,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-04 12:36:18,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:18,237 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1] [2018-10-04 12:36:18,237 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:18,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:18,237 INFO L82 PathProgramCache]: Analyzing trace with hash 972948902, now seen corresponding path program 64 times [2018-10-04 12:36:18,237 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:18,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:18,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:18,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:18,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:20,412 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:20,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:20,412 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:20,420 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:36:20,501 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:36:20,501 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:20,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:20,515 INFO L477 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 [2018-10-04 12:36:20,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:20,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:36:20,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:23,520 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:23,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:23,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 130 [2018-10-04 12:36:23,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-10-04 12:36:23,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-10-04 12:36:23,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-10-04 12:36:23,542 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2018-10-04 12:36:24,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:24,030 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-10-04 12:36:24,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-04 12:36:24,030 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2018-10-04 12:36:24,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:24,032 INFO L225 Difference]: With dead ends: 267 [2018-10-04 12:36:24,032 INFO L226 Difference]: Without dead ends: 266 [2018-10-04 12:36:24,033 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8320 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-10-04 12:36:24,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-10-04 12:36:24,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2018-10-04 12:36:24,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-10-04 12:36:24,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-10-04 12:36:24,039 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2018-10-04 12:36:24,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:24,039 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-10-04 12:36:24,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-10-04 12:36:24,039 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-10-04 12:36:24,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-04 12:36:24,041 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:24,041 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1] [2018-10-04 12:36:24,041 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:24,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:24,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1521144543, now seen corresponding path program 65 times [2018-10-04 12:36:24,041 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:24,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:24,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:24,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:24,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:26,190 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:26,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:26,191 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:26,199 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:36:26,410 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-10-04 12:36:26,410 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:26,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:26,421 INFO L477 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 [2018-10-04 12:36:26,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:26,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:36:26,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:29,114 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:29,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:29,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 132 [2018-10-04 12:36:29,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-10-04 12:36:29,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-10-04 12:36:29,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-10-04 12:36:29,139 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2018-10-04 12:36:29,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:29,640 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-10-04 12:36:29,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-04 12:36:29,640 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2018-10-04 12:36:29,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:29,642 INFO L225 Difference]: With dead ends: 271 [2018-10-04 12:36:29,642 INFO L226 Difference]: Without dead ends: 270 [2018-10-04 12:36:29,643 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8580 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-10-04 12:36:29,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-04 12:36:29,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2018-10-04 12:36:29,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-10-04 12:36:29,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-10-04 12:36:29,648 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2018-10-04 12:36:29,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:29,648 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-10-04 12:36:29,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-10-04 12:36:29,648 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-10-04 12:36:29,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-04 12:36:29,650 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:29,650 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1] [2018-10-04 12:36:29,650 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:29,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:29,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1857266792, now seen corresponding path program 66 times [2018-10-04 12:36:29,651 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:29,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:29,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:29,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:29,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:32,150 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:32,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:32,151 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:32,158 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:36:32,465 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-10-04 12:36:32,465 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:32,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:32,474 INFO L477 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 [2018-10-04 12:36:32,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:32,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:36:32,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:35,132 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:35,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:35,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 134 [2018-10-04 12:36:35,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-10-04 12:36:35,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-10-04 12:36:35,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-10-04 12:36:35,155 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 136 states. [2018-10-04 12:36:35,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:35,734 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-10-04 12:36:35,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-04 12:36:35,734 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268 [2018-10-04 12:36:35,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:35,736 INFO L225 Difference]: With dead ends: 275 [2018-10-04 12:36:35,736 INFO L226 Difference]: Without dead ends: 274 [2018-10-04 12:36:35,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8844 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-10-04 12:36:35,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-04 12:36:35,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2018-10-04 12:36:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-10-04 12:36:35,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-10-04 12:36:35,741 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2018-10-04 12:36:35,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:35,742 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-10-04 12:36:35,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-10-04 12:36:35,742 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-10-04 12:36:35,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-10-04 12:36:35,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:35,743 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1] [2018-10-04 12:36:35,743 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:35,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:35,743 INFO L82 PathProgramCache]: Analyzing trace with hash 370728913, now seen corresponding path program 67 times [2018-10-04 12:36:35,743 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:35,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:35,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:35,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:35,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:38,264 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:38,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:38,264 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:38,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:38,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:38,368 INFO L477 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 [2018-10-04 12:36:38,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:38,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:36:38,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:41,100 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:41,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:41,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 136 [2018-10-04 12:36:41,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-10-04 12:36:41,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-10-04 12:36:41,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-10-04 12:36:41,122 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 138 states. [2018-10-04 12:36:41,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:41,570 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-10-04 12:36:41,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-04 12:36:41,570 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272 [2018-10-04 12:36:41,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:41,572 INFO L225 Difference]: With dead ends: 279 [2018-10-04 12:36:41,572 INFO L226 Difference]: Without dead ends: 278 [2018-10-04 12:36:41,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9112 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-10-04 12:36:41,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-04 12:36:41,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2018-10-04 12:36:41,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-04 12:36:41,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-10-04 12:36:41,579 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2018-10-04 12:36:41,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:41,579 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-10-04 12:36:41,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-10-04 12:36:41,579 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-10-04 12:36:41,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-04 12:36:41,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:41,581 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1] [2018-10-04 12:36:41,581 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:41,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:41,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1675190390, now seen corresponding path program 68 times [2018-10-04 12:36:41,581 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:41,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:41,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:41,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:41,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:44,162 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:44,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:44,163 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:44,171 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:36:44,248 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:36:44,249 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:44,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:44,271 INFO L477 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 [2018-10-04 12:36:44,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:44,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:36:44,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:47,247 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:47,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:47,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 138 [2018-10-04 12:36:47,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-10-04 12:36:47,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-10-04 12:36:47,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-10-04 12:36:47,271 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 140 states. [2018-10-04 12:36:47,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:47,783 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-10-04 12:36:47,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-04 12:36:47,784 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276 [2018-10-04 12:36:47,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:47,785 INFO L225 Difference]: With dead ends: 283 [2018-10-04 12:36:47,786 INFO L226 Difference]: Without dead ends: 282 [2018-10-04 12:36:47,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9384 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-10-04 12:36:47,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-10-04 12:36:47,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2018-10-04 12:36:47,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-10-04 12:36:47,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-10-04 12:36:47,791 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2018-10-04 12:36:47,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:47,791 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-10-04 12:36:47,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-10-04 12:36:47,791 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-10-04 12:36:47,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-10-04 12:36:47,793 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:47,793 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1] [2018-10-04 12:36:47,793 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:47,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:47,794 INFO L82 PathProgramCache]: Analyzing trace with hash -513025341, now seen corresponding path program 69 times [2018-10-04 12:36:47,794 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:47,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:47,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:47,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:47,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:50,459 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:50,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:50,460 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:50,466 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:36:50,844 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-10-04 12:36:50,844 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:50,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:50,858 INFO L477 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 [2018-10-04 12:36:50,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:50,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:36:50,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:53,929 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:53,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:53,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 140 [2018-10-04 12:36:53,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-10-04 12:36:53,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-10-04 12:36:53,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-10-04 12:36:53,952 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 142 states. [2018-10-04 12:36:54,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:54,445 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-10-04 12:36:54,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-04 12:36:54,445 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280 [2018-10-04 12:36:54,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:54,447 INFO L225 Difference]: With dead ends: 287 [2018-10-04 12:36:54,447 INFO L226 Difference]: Without dead ends: 286 [2018-10-04 12:36:54,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9660 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-10-04 12:36:54,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-04 12:36:54,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2018-10-04 12:36:54,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-10-04 12:36:54,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-10-04 12:36:54,452 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2018-10-04 12:36:54,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:54,452 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-10-04 12:36:54,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-10-04 12:36:54,452 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-10-04 12:36:54,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-10-04 12:36:54,453 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:54,454 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1] [2018-10-04 12:36:54,454 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:54,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:54,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1052692860, now seen corresponding path program 70 times [2018-10-04 12:36:54,454 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:54,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:54,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:54,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:54,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:56,937 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:56,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:56,937 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:56,944 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:36:57,037 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:36:57,038 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:57,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:57,047 INFO L477 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 [2018-10-04 12:36:57,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:57,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:36:57,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:37:00,227 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:00,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:00,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 142 [2018-10-04 12:37:00,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-10-04 12:37:00,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-10-04 12:37:00,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-10-04 12:37:00,249 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 144 states. [2018-10-04 12:37:00,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:37:00,863 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-10-04 12:37:00,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-04 12:37:00,863 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284 [2018-10-04 12:37:00,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:37:00,865 INFO L225 Difference]: With dead ends: 291 [2018-10-04 12:37:00,865 INFO L226 Difference]: Without dead ends: 290 [2018-10-04 12:37:00,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9940 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-10-04 12:37:00,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-04 12:37:00,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2018-10-04 12:37:00,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-10-04 12:37:00,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-10-04 12:37:00,870 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2018-10-04 12:37:00,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:37:00,871 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-10-04 12:37:00,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-10-04 12:37:00,871 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-10-04 12:37:00,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-04 12:37:00,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:37:00,872 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1] [2018-10-04 12:37:00,872 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:37:00,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:37:00,872 INFO L82 PathProgramCache]: Analyzing trace with hash 936756149, now seen corresponding path program 71 times [2018-10-04 12:37:00,873 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:37:00,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:37:00,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:00,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:37:00,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:03,712 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:03,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:03,713 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:37:03,720 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:37:03,953 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-10-04 12:37:03,954 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:37:03,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:03,964 INFO L477 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 [2018-10-04 12:37:03,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:37:03,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:37:03,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:37:06,971 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:06,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:06,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 144 [2018-10-04 12:37:06,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-10-04 12:37:06,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-10-04 12:37:06,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-10-04 12:37:06,995 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 146 states. [2018-10-04 12:37:07,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:37:07,634 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-10-04 12:37:07,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-04 12:37:07,635 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288 [2018-10-04 12:37:07,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:37:07,637 INFO L225 Difference]: With dead ends: 295 [2018-10-04 12:37:07,637 INFO L226 Difference]: Without dead ends: 294 [2018-10-04 12:37:07,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10224 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-10-04 12:37:07,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-10-04 12:37:07,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2018-10-04 12:37:07,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-10-04 12:37:07,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-10-04 12:37:07,642 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2018-10-04 12:37:07,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:37:07,642 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-10-04 12:37:07,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-10-04 12:37:07,642 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-10-04 12:37:07,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-04 12:37:07,643 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:37:07,644 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1] [2018-10-04 12:37:07,644 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:37:07,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:37:07,644 INFO L82 PathProgramCache]: Analyzing trace with hash 189198702, now seen corresponding path program 72 times [2018-10-04 12:37:07,644 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:37:07,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:37:07,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:07,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:37:07,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:10,277 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:10,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:10,278 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:37:10,284 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:37:10,655 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-10-04 12:37:10,655 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:37:10,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:10,666 INFO L477 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 [2018-10-04 12:37:10,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:37:10,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:37:10,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:37:14,049 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:14,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:14,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 146 [2018-10-04 12:37:14,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-10-04 12:37:14,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-10-04 12:37:14,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-10-04 12:37:14,071 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 148 states. [2018-10-04 12:37:14,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:37:14,552 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-10-04 12:37:14,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-04 12:37:14,553 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292 [2018-10-04 12:37:14,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:37:14,555 INFO L225 Difference]: With dead ends: 299 [2018-10-04 12:37:14,555 INFO L226 Difference]: Without dead ends: 298 [2018-10-04 12:37:14,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10512 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-10-04 12:37:14,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-10-04 12:37:14,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2018-10-04 12:37:14,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-04 12:37:14,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-10-04 12:37:14,560 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2018-10-04 12:37:14,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:37:14,560 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-10-04 12:37:14,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-10-04 12:37:14,560 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-10-04 12:37:14,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-04 12:37:14,561 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:37:14,561 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1] [2018-10-04 12:37:14,562 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:37:14,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:37:14,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1116248743, now seen corresponding path program 73 times [2018-10-04 12:37:14,562 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:37:14,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:37:14,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:14,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:37:14,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:17,279 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:17,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:17,280 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:37:17,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:37:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:17,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:17,380 INFO L477 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 [2018-10-04 12:37:17,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:37:17,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:37:17,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:37:20,701 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:20,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:20,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 148 [2018-10-04 12:37:20,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-10-04 12:37:20,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-10-04 12:37:20,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-10-04 12:37:20,723 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 150 states. [2018-10-04 12:37:21,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:37:21,212 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-10-04 12:37:21,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-04 12:37:21,212 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296 [2018-10-04 12:37:21,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:37:21,214 INFO L225 Difference]: With dead ends: 303 [2018-10-04 12:37:21,214 INFO L226 Difference]: Without dead ends: 302 [2018-10-04 12:37:21,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10804 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-10-04 12:37:21,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-04 12:37:21,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2018-10-04 12:37:21,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-04 12:37:21,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-10-04 12:37:21,221 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2018-10-04 12:37:21,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:37:21,221 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-10-04 12:37:21,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-10-04 12:37:21,221 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-10-04 12:37:21,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-10-04 12:37:21,222 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:37:21,222 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1] [2018-10-04 12:37:21,222 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:37:21,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:37:21,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1106313056, now seen corresponding path program 74 times [2018-10-04 12:37:21,223 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:37:21,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:37:21,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:21,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:37:21,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:23,951 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:23,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:23,951 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:37:23,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:37:24,040 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:37:24,040 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:37:24,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:24,048 INFO L477 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 [2018-10-04 12:37:24,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:37:24,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:37:24,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:37:27,336 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:27,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:27,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 150 [2018-10-04 12:37:27,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-10-04 12:37:27,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-10-04 12:37:27,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-10-04 12:37:27,358 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 152 states. [2018-10-04 12:37:27,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:37:27,900 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-10-04 12:37:27,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-04 12:37:27,901 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300 [2018-10-04 12:37:27,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:37:27,902 INFO L225 Difference]: With dead ends: 307 [2018-10-04 12:37:27,902 INFO L226 Difference]: Without dead ends: 306 [2018-10-04 12:37:27,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11100 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-10-04 12:37:27,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-10-04 12:37:27,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-10-04 12:37:27,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-10-04 12:37:27,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-10-04 12:37:27,907 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2018-10-04 12:37:27,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:37:27,907 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-10-04 12:37:27,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-10-04 12:37:27,907 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-10-04 12:37:27,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-10-04 12:37:27,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:37:27,908 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1] [2018-10-04 12:37:27,908 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:37:27,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:37:27,909 INFO L82 PathProgramCache]: Analyzing trace with hash -659136615, now seen corresponding path program 75 times [2018-10-04 12:37:27,909 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:37:27,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:37:27,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:27,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:37:27,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:30,709 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:30,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:30,710 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:37:30,716 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:37:31,162 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-10-04 12:37:31,162 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:37:31,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:31,172 INFO L477 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 [2018-10-04 12:37:31,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:37:31,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:37:31,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:37:34,552 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:34,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:34,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 152 [2018-10-04 12:37:34,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-10-04 12:37:34,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-10-04 12:37:34,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-10-04 12:37:34,577 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 154 states. Received shutdown request... [2018-10-04 12:37:34,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-04 12:37:34,942 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 12:37:35,054 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 12:37:35,054 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:37:35 BoogieIcfgContainer [2018-10-04 12:37:35,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:37:35,055 INFO L168 Benchmark]: Toolchain (without parser) took 238010.52 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 789.6 MB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -818.5 MB). Peak memory consumption was 322.8 MB. Max. memory is 7.1 GB. [2018-10-04 12:37:35,057 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:37:35,057 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:37:35,058 INFO L168 Benchmark]: Boogie Preprocessor took 28.41 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:37:35,058 INFO L168 Benchmark]: RCFGBuilder took 365.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:37:35,058 INFO L168 Benchmark]: TraceAbstraction took 237544.87 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 789.6 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -839.7 MB). Peak memory consumption was 301.6 MB. Max. memory is 7.1 GB. [2018-10-04 12:37:35,060 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.41 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 365.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 237544.87 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 789.6 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -839.7 MB). Peak memory consumption was 301.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 17]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 17). Cancelled while BasicCegarLoop was constructing difference of abstraction (305states) and FLOYD_HOARE automaton (currently 60 states, 154 states before enhancement), while ReachableStatesComputation was computing reachable states (232 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. TIMEOUT Result, 237.3s OverallTime, 76 OverallIterations, 76 TraceHistogramMax, 24.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 229 SDtfs, 4215 SDslu, 4276 SDs, 0 SdLazy, 15885 SolverSat, 239 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14551 GetRequests, 8700 SyntacticMatches, 0 SemanticMatches, 5851 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292600 ImplicationChecksByTransitivity, 183.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=305occurred in iteration=75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 75 MinimizatonAttempts, 75 StatesRemovedByMinimization, 75 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 8.7s SatisfiabilityAnalysisTime, 196.7s InterpolantComputationTime, 23404 NumberOfCodeBlocks, 23404 NumberOfCodeBlocksAsserted, 1607 NumberOfCheckSat, 23253 ConstructedInterpolants, 0 QuantifiedInterpolants, 37828463 SizeOfPredicates, 450 NumberOfNonLiveVariables, 21675 ConjunctsInSsa, 9300 ConjunctsInUnsatCore, 151 InterpolantComputations, 1 PerfectInterpolantSequences, 0/579500 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified02.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-37-35-069.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified02.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-37-35-069.csv Completed graceful shutdown