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-simplified01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:33:36,513 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:33:36,515 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:33:36,527 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:33:36,527 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:33:36,528 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:33:36,529 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:33:36,531 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:33:36,533 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:33:36,534 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:33:36,535 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:33:36,535 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:33:36,536 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:33:36,537 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:33:36,538 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:33:36,539 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:33:36,539 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:33:36,541 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:33:36,543 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:33:36,545 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:33:36,546 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:33:36,547 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:33:36,550 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:33:36,550 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:33:36,550 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:33:36,551 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:33:36,552 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:33:36,553 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:33:36,554 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:33:36,555 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:33:36,556 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:33:36,556 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:33:36,557 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:33:36,557 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:33:36,558 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:33:36,559 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:33:36,559 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,575 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:33:36,575 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:33:36,576 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:33:36,576 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:33:36,577 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:33:36,577 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:33:36,577 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:33:36,577 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:33:36,578 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:33:36,578 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:33:36,578 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:33:36,578 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:33:36,578 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:33:36,579 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:33:36,579 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:33:36,579 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:33:36,579 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:33:36,579 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:33:36,579 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:33:36,580 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:33:36,580 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:33:36,580 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:33:36,580 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:33:36,580 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:33:36,581 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:33:36,581 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:33:36,581 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:33:36,581 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:33:36,581 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:33:36,582 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:33:36,637 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:33:36,654 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:33:36,660 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:33:36,661 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:33:36,662 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:33:36,664 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl [2018-10-04 12:33:36,665 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl' [2018-10-04 12:33:36,721 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:33:36,722 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:33:36,723 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:33:36,723 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:33:36,724 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:33:36,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:36" (1/1) ... [2018-10-04 12:33:36,759 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:36" (1/1) ... [2018-10-04 12:33:36,765 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 12:33:36,765 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 12:33:36,765 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 12:33:36,782 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:33:36,782 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:33:36,783 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:33:36,783 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:33:36,792 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:36" (1/1) ... [2018-10-04 12:33:36,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:36" (1/1) ... [2018-10-04 12:33:36,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:36" (1/1) ... [2018-10-04 12:33:36,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:36" (1/1) ... [2018-10-04 12:33:36,798 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:36" (1/1) ... [2018-10-04 12:33:36,802 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:36" (1/1) ... [2018-10-04 12:33:36,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:36" (1/1) ... [2018-10-04 12:33:36,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:33:36,807 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:33:36,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:33:36,808 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:33:36,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:36" (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:36,885 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-04 12:33:36,885 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-04 12:33:36,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-04 12:33:36,885 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-10-04 12:33:37,228 INFO L338 CfgBuilder]: Using library mode [2018-10-04 12:33:37,228 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:33:37 BoogieIcfgContainer [2018-10-04 12:33:37,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:33:37,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:33:37,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:33:37,233 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:33:37,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:33:36" (1/2) ... [2018-10-04 12:33:37,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9a718e and model type PointerIncrement-simplified01.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,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:33:37" (2/2) ... [2018-10-04 12:33:37,237 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified01.bpl [2018-10-04 12:33:37,248 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:33:37,256 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-10-04 12:33:37,304 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:33:37,305 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:33:37,306 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:33:37,306 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:33:37,306 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:33:37,306 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:33:37,306 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:33:37,306 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:33:37,307 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:33:37,324 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2018-10-04 12:33:37,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 12:33:37,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:37,332 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-04 12:33:37,333 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:33:37,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:37,339 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2018-10-04 12:33:37,342 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:37,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:37,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:37,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:37,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:37,633 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,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:33:37,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:33:37,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:33:37,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:33:37,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:33:37,654 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2018-10-04 12:33:37,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:37,794 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-10-04 12:33:37,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:33:37,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-10-04 12:33:37,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:37,807 INFO L225 Difference]: With dead ends: 20 [2018-10-04 12:33:37,808 INFO L226 Difference]: Without dead ends: 10 [2018-10-04 12:33:37,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:33:37,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-04 12:33:37,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 7. [2018-10-04 12:33:37,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 12:33:37,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-10-04 12:33:37,843 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2018-10-04 12:33:37,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:37,844 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-10-04 12:33:37,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:33:37,844 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-10-04 12:33:37,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:33:37,845 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:37,845 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 12:33:37,845 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:33:37,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:37,846 INFO L82 PathProgramCache]: Analyzing trace with hash 28755331, now seen corresponding path program 1 times [2018-10-04 12:33:37,846 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:37,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:37,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:37,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:37,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:38,137 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:38,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:33:38,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:33:38,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:33:38,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:33:38,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:33:38,141 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2018-10-04 12:33:38,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:38,332 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-10-04 12:33:38,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:33:38,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 12:33:38,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:38,333 INFO L225 Difference]: With dead ends: 17 [2018-10-04 12:33:38,334 INFO L226 Difference]: Without dead ends: 16 [2018-10-04 12:33:38,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:33:38,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-04 12:33:38,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2018-10-04 12:33:38,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 12:33:38,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-10-04 12:33:38,341 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 5 [2018-10-04 12:33:38,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:38,342 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-10-04 12:33:38,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:33:38,342 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-10-04 12:33:38,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:33:38,343 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:38,343 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-10-04 12:33:38,343 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:33:38,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:38,344 INFO L82 PathProgramCache]: Analyzing trace with hash 2132412303, now seen corresponding path program 1 times [2018-10-04 12:33:38,344 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:38,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:38,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:38,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:38,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:38,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:38,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:33:38,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:33:38,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:33:38,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:33:38,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:33:38,418 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 3 states. [2018-10-04 12:33:38,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:38,432 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-10-04 12:33:38,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:33:38,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-10-04 12:33:38,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:38,434 INFO L225 Difference]: With dead ends: 18 [2018-10-04 12:33:38,434 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 12:33:38,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 12:33:38,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 12:33:38,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 12:33:38,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-04 12:33:38,439 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-10-04 12:33:38,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:38,439 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-04 12:33:38,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:33:38,439 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-04 12:33:38,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:33:38,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:38,440 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2018-10-04 12:33:38,441 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:33:38,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:38,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1391871885, now seen corresponding path program 1 times [2018-10-04 12:33:38,441 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:38,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:38,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:38,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:38,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:38,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:38,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:38,693 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,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:38,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:38,815 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,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:38,832 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,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:38,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:38,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:38,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2018-10-04 12:33:38,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:33:38,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:33:38,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:33:38,988 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2018-10-04 12:33:39,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:39,354 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-10-04 12:33:39,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:33:39,356 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-10-04 12:33:39,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:39,358 INFO L225 Difference]: With dead ends: 20 [2018-10-04 12:33:39,358 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 12:33:39,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:33:39,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 12:33:39,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2018-10-04 12:33:39,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 12:33:39,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-04 12:33:39,368 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2018-10-04 12:33:39,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:39,368 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-04 12:33:39,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:33:39,370 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-04 12:33:39,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:33:39,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:39,371 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1] [2018-10-04 12:33:39,371 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:33:39,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:39,372 INFO L82 PathProgramCache]: Analyzing trace with hash -750183549, now seen corresponding path program 2 times [2018-10-04 12:33:39,372 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:39,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:39,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:39,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:39,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:39,538 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:39,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:39,539 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:39,548 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:33:39,575 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:33:39,575 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:39,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:39,597 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,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:39,610 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,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:39,997 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:40,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:40,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-10-04 12:33:40,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:40,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:40,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:40,021 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 10 states. [2018-10-04 12:33:40,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:40,307 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-04 12:33:40,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:33:40,309 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-10-04 12:33:40,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:40,310 INFO L225 Difference]: With dead ends: 25 [2018-10-04 12:33:40,310 INFO L226 Difference]: Without dead ends: 24 [2018-10-04 12:33:40,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:33:40,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-04 12:33:40,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-10-04 12:33:40,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-04 12:33:40,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-04 12:33:40,316 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2018-10-04 12:33:40,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:40,316 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-04 12:33:40,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:40,317 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-04 12:33:40,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 12:33:40,318 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:40,318 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1] [2018-10-04 12:33:40,318 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:33:40,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:40,318 INFO L82 PathProgramCache]: Analyzing trace with hash -948100493, now seen corresponding path program 3 times [2018-10-04 12:33:40,319 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:40,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:40,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:40,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:40,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:40,456 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:40,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:40,457 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:40,476 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:33:40,501 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 12:33:40,501 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:40,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:40,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:40,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:40,534 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,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:40,649 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:40,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:40,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2018-10-04 12:33:40,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 12:33:40,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 12:33:40,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-10-04 12:33:40,673 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-10-04 12:33:41,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:41,017 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-10-04 12:33:41,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:33:41,020 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-10-04 12:33:41,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:41,021 INFO L225 Difference]: With dead ends: 30 [2018-10-04 12:33:41,021 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:33:41,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:33:41,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:33:41,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-10-04 12:33:41,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:33:41,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-10-04 12:33:41,028 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2018-10-04 12:33:41,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:41,028 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-10-04 12:33:41,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 12:33:41,029 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-10-04 12:33:41,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 12:33:41,029 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:41,030 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1] [2018-10-04 12:33:41,030 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:33:41,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:41,031 INFO L82 PathProgramCache]: Analyzing trace with hash 711455107, now seen corresponding path program 4 times [2018-10-04 12:33:41,031 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:41,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:41,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:41,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:41,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:41,262 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:41,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:41,262 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:41,274 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:33:41,321 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:33:41,321 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:41,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:41,341 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,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:41,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:33:41,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:41,454 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:41,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:41,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-10-04 12:33:41,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:33:41,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:33:41,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:33:41,477 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2018-10-04 12:33:41,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:41,740 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-04 12:33:41,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:33:41,749 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-10-04 12:33:41,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:41,750 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:33:41,750 INFO L226 Difference]: Without dead ends: 34 [2018-10-04 12:33:41,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2018-10-04 12:33:41,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-04 12:33:41,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-10-04 12:33:41,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 12:33:41,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-04 12:33:41,761 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2018-10-04 12:33:41,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:41,762 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-04 12:33:41,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:33:41,762 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-04 12:33:41,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 12:33:41,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:41,765 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1] [2018-10-04 12:33:41,765 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:33:41,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:41,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1614023795, now seen corresponding path program 5 times [2018-10-04 12:33:41,765 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:41,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:41,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:41,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:41,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:41,952 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:41,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:41,952 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:41,960 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:33:41,988 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 12:33:41,988 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:41,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:42,004 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,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:42,014 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,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:42,282 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:42,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:42,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-10-04 12:33:42,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:33:42,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:33:42,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:33:42,304 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-10-04 12:33:42,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:42,784 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-10-04 12:33:42,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:42,791 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-10-04 12:33:42,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:42,792 INFO L225 Difference]: With dead ends: 40 [2018-10-04 12:33:42,792 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:33:42,793 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=330, Unknown=0, NotChecked=0, Total=506 [2018-10-04 12:33:42,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:33:42,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-10-04 12:33:42,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-04 12:33:42,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-04 12:33:42,800 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2018-10-04 12:33:42,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:42,800 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-04 12:33:42,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:33:42,801 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-04 12:33:42,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-04 12:33:42,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:42,802 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1] [2018-10-04 12:33:42,802 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:33:42,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:42,802 INFO L82 PathProgramCache]: Analyzing trace with hash -512538749, now seen corresponding path program 6 times [2018-10-04 12:33:42,802 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:42,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:42,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:42,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:42,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:43,200 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:43,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:43,201 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:43,208 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:33:43,251 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:33:43,251 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:43,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:43,260 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,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:43,271 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,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:43,568 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:43,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:43,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-10-04 12:33:43,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 12:33:43,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 12:33:43,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:33:43,602 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 18 states. [2018-10-04 12:33:43,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:43,923 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-04 12:33:43,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:33:43,925 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2018-10-04 12:33:43,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:43,926 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:33:43,926 INFO L226 Difference]: Without dead ends: 44 [2018-10-04 12:33:43,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=225, Invalid=425, Unknown=0, NotChecked=0, Total=650 [2018-10-04 12:33:43,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-04 12:33:43,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-10-04 12:33:43,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-04 12:33:43,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-04 12:33:43,935 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 35 [2018-10-04 12:33:43,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:43,936 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-04 12:33:43,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 12:33:43,937 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-04 12:33:43,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-04 12:33:43,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:43,939 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1] [2018-10-04 12:33:43,939 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:33:43,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:43,940 INFO L82 PathProgramCache]: Analyzing trace with hash 416183923, now seen corresponding path program 7 times [2018-10-04 12:33:43,940 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:43,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:43,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:43,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:43,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:44,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:44,160 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) [2018-10-04 12:33:44,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:44,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:44,238 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,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:44,265 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,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:44,619 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:44,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:44,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2018-10-04 12:33:44,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 12:33:44,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 12:33:44,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2018-10-04 12:33:44,641 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 20 states. [2018-10-04 12:33:44,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:44,946 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-10-04 12:33:44,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:33:44,947 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-10-04 12:33:44,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:44,948 INFO L225 Difference]: With dead ends: 50 [2018-10-04 12:33:44,948 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:33:44,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=280, Invalid=532, Unknown=0, NotChecked=0, Total=812 [2018-10-04 12:33:44,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:33:44,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-10-04 12:33:44,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-04 12:33:44,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-04 12:33:44,958 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 40 [2018-10-04 12:33:44,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:44,959 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-04 12:33:44,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 12:33:44,959 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-04 12:33:44,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-04 12:33:44,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:44,960 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1] [2018-10-04 12:33:44,961 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:33:44,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:44,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1523260803, now seen corresponding path program 8 times [2018-10-04 12:33:44,961 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:44,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:44,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:44,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:44,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:45,955 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:45,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:45,956 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:45,963 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:33:45,996 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:33:45,996 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:45,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:46,019 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,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:46,068 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,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:46,218 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:46,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:46,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2018-10-04 12:33:46,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 12:33:46,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 12:33:46,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=304, Unknown=0, NotChecked=0, Total=462 [2018-10-04 12:33:46,249 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 22 states. [2018-10-04 12:33:46,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:46,773 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-04 12:33:46,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:33:46,774 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2018-10-04 12:33:46,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:46,775 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:33:46,776 INFO L226 Difference]: Without dead ends: 54 [2018-10-04 12:33:46,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=341, Invalid=651, Unknown=0, NotChecked=0, Total=992 [2018-10-04 12:33:46,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-04 12:33:46,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-10-04 12:33:46,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-04 12:33:46,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-04 12:33:46,785 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 45 [2018-10-04 12:33:46,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:46,786 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-04 12:33:46,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 12:33:46,786 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-04 12:33:46,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-04 12:33:46,787 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:46,787 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1] [2018-10-04 12:33:46,787 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:33:46,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:46,788 INFO L82 PathProgramCache]: Analyzing trace with hash 183263347, now seen corresponding path program 9 times [2018-10-04 12:33:46,788 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:46,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:46,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:46,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:46,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:47,161 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:47,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:47,161 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:47,172 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:33:47,292 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-04 12:33:47,292 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:47,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:47,305 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,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:47,316 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,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:47,769 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:47,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:47,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2018-10-04 12:33:47,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 12:33:47,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 12:33:47,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=362, Unknown=0, NotChecked=0, Total=552 [2018-10-04 12:33:47,790 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 24 states. [2018-10-04 12:33:48,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:48,355 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-10-04 12:33:48,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:33:48,356 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2018-10-04 12:33:48,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:48,358 INFO L225 Difference]: With dead ends: 60 [2018-10-04 12:33:48,358 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:33:48,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=408, Invalid=782, Unknown=0, NotChecked=0, Total=1190 [2018-10-04 12:33:48,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:33:48,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-10-04 12:33:48,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-04 12:33:48,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-04 12:33:48,370 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 50 [2018-10-04 12:33:48,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:48,370 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-04 12:33:48,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-04 12:33:48,370 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-04 12:33:48,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-04 12:33:48,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:48,371 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1] [2018-10-04 12:33:48,372 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:33:48,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:48,372 INFO L82 PathProgramCache]: Analyzing trace with hash -2133888125, now seen corresponding path program 10 times [2018-10-04 12:33:48,372 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:48,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:48,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:48,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:48,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:48,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:48,699 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:48,711 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:33:48,749 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:33:48,749 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:48,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:48,770 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,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:48,801 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,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:48,974 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:48,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:48,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2018-10-04 12:33:48,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-04 12:33:48,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-04 12:33:48,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=425, Unknown=0, NotChecked=0, Total=650 [2018-10-04 12:33:48,996 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 26 states. [2018-10-04 12:33:49,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:49,446 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-04 12:33:49,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:33:49,447 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2018-10-04 12:33:49,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:49,448 INFO L225 Difference]: With dead ends: 65 [2018-10-04 12:33:49,448 INFO L226 Difference]: Without dead ends: 64 [2018-10-04 12:33:49,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=481, Invalid=925, Unknown=0, NotChecked=0, Total=1406 [2018-10-04 12:33:49,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-04 12:33:49,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-10-04 12:33:49,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-04 12:33:49,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-04 12:33:49,460 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 55 [2018-10-04 12:33:49,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:49,461 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-04 12:33:49,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-04 12:33:49,461 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-04 12:33:49,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-04 12:33:49,462 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:49,462 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1] [2018-10-04 12:33:49,462 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:33:49,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:49,463 INFO L82 PathProgramCache]: Analyzing trace with hash -936523149, now seen corresponding path program 11 times [2018-10-04 12:33:49,463 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:49,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:49,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:49,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:49,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:49,777 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:49,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:49,777 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:49,784 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:33:49,853 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-04 12:33:49,853 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:49,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:49,883 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,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:49,893 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,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:50,171 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:50,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:50,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2018-10-04 12:33:50,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-04 12:33:50,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-04 12:33:50,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=493, Unknown=0, NotChecked=0, Total=756 [2018-10-04 12:33:50,193 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2018-10-04 12:33:50,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:50,696 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-10-04 12:33:50,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:33:50,697 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-10-04 12:33:50,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:50,698 INFO L225 Difference]: With dead ends: 70 [2018-10-04 12:33:50,698 INFO L226 Difference]: Without dead ends: 69 [2018-10-04 12:33:50,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=560, Invalid=1080, Unknown=0, NotChecked=0, Total=1640 [2018-10-04 12:33:50,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-04 12:33:50,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-10-04 12:33:50,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-04 12:33:50,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-10-04 12:33:50,709 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 60 [2018-10-04 12:33:50,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:50,710 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-10-04 12:33:50,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-04 12:33:50,710 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-10-04 12:33:50,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-04 12:33:50,711 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:50,711 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1] [2018-10-04 12:33:50,711 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:33:50,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:50,712 INFO L82 PathProgramCache]: Analyzing trace with hash -975156861, now seen corresponding path program 12 times [2018-10-04 12:33:50,712 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:50,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:50,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:50,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:50,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:51,094 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:51,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:51,095 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:51,106 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:33:51,169 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-04 12:33:51,170 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:51,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:51,195 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,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:51,233 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,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:51,459 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:51,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:51,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 28 [2018-10-04 12:33:51,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-04 12:33:51,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-04 12:33:51,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=566, Unknown=0, NotChecked=0, Total=870 [2018-10-04 12:33:51,481 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 30 states. [2018-10-04 12:33:51,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:51,998 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-10-04 12:33:51,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:33:51,999 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2018-10-04 12:33:51,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:51,999 INFO L225 Difference]: With dead ends: 75 [2018-10-04 12:33:51,999 INFO L226 Difference]: Without dead ends: 74 [2018-10-04 12:33:52,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=645, Invalid=1247, Unknown=0, NotChecked=0, Total=1892 [2018-10-04 12:33:52,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-04 12:33:52,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2018-10-04 12:33:52,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-04 12:33:52,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-10-04 12:33:52,014 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 65 [2018-10-04 12:33:52,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:52,014 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-10-04 12:33:52,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-04 12:33:52,014 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-10-04 12:33:52,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-04 12:33:52,015 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:52,015 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1] [2018-10-04 12:33:52,016 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:33:52,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:52,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1513272435, now seen corresponding path program 13 times [2018-10-04 12:33:52,016 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:52,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:52,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:52,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:52,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:52,605 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:52,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:52,606 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:52,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:52,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:52,670 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,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:52,680 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,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:53,107 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:53,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:53,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 30 [2018-10-04 12:33:53,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-04 12:33:53,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-04 12:33:53,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=644, Unknown=0, NotChecked=0, Total=992 [2018-10-04 12:33:53,129 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 32 states. [2018-10-04 12:33:53,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:53,915 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-10-04 12:33:53,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:33:53,916 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 70 [2018-10-04 12:33:53,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:53,917 INFO L225 Difference]: With dead ends: 80 [2018-10-04 12:33:53,917 INFO L226 Difference]: Without dead ends: 79 [2018-10-04 12:33:53,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=736, Invalid=1426, Unknown=0, NotChecked=0, Total=2162 [2018-10-04 12:33:53,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-04 12:33:53,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-10-04 12:33:53,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-04 12:33:53,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-10-04 12:33:53,929 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 70 [2018-10-04 12:33:53,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:53,929 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-10-04 12:33:53,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-04 12:33:53,930 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-10-04 12:33:53,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-04 12:33:53,930 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:53,931 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1] [2018-10-04 12:33:53,931 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:33:53,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:53,931 INFO L82 PathProgramCache]: Analyzing trace with hash 610115459, now seen corresponding path program 14 times [2018-10-04 12:33:53,931 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:53,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:53,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:53,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:53,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:54,427 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:54,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:54,427 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:54,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:33:54,493 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:33:54,493 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:54,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:54,499 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:54,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:54,510 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:54,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:54,765 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:54,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:54,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 32 [2018-10-04 12:33:54,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-04 12:33:54,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-04 12:33:54,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=727, Unknown=0, NotChecked=0, Total=1122 [2018-10-04 12:33:54,787 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 34 states. [2018-10-04 12:33:55,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:55,376 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-10-04 12:33:55,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 12:33:55,377 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2018-10-04 12:33:55,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:55,378 INFO L225 Difference]: With dead ends: 85 [2018-10-04 12:33:55,378 INFO L226 Difference]: Without dead ends: 84 [2018-10-04 12:33:55,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=833, Invalid=1617, Unknown=0, NotChecked=0, Total=2450 [2018-10-04 12:33:55,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-04 12:33:55,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-10-04 12:33:55,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-04 12:33:55,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-04 12:33:55,390 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 75 [2018-10-04 12:33:55,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:55,391 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-04 12:33:55,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-04 12:33:55,391 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-04 12:33:55,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-04 12:33:55,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:55,392 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1] [2018-10-04 12:33:55,392 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:33:55,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:55,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1117462131, now seen corresponding path program 15 times [2018-10-04 12:33:55,392 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:55,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:55,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:55,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:55,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:56,221 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:56,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:56,221 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:56,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:33:56,318 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-04 12:33:56,319 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:56,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:56,342 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,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:56,360 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,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:56,711 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:56,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:56,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 34 [2018-10-04 12:33:56,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-04 12:33:56,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-04 12:33:56,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=815, Unknown=0, NotChecked=0, Total=1260 [2018-10-04 12:33:56,733 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 36 states. [2018-10-04 12:33:57,638 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 12:33:57,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:57,913 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-10-04 12:33:57,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 12:33:57,913 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 80 [2018-10-04 12:33:57,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:57,914 INFO L225 Difference]: With dead ends: 90 [2018-10-04 12:33:57,915 INFO L226 Difference]: Without dead ends: 89 [2018-10-04 12:33:57,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=936, Invalid=1820, Unknown=0, NotChecked=0, Total=2756 [2018-10-04 12:33:57,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-04 12:33:57,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-10-04 12:33:57,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-04 12:33:57,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-10-04 12:33:57,928 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 80 [2018-10-04 12:33:57,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:57,928 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-10-04 12:33:57,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-04 12:33:57,929 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-10-04 12:33:57,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-04 12:33:57,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:57,930 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1] [2018-10-04 12:33:57,930 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:33:57,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:57,930 INFO L82 PathProgramCache]: Analyzing trace with hash 514291075, now seen corresponding path program 16 times [2018-10-04 12:33:57,930 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:57,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:57,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:57,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:57,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:58,728 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:58,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:58,728 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:58,743 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:33:58,804 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:33:58,804 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:58,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:58,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:58,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:33:58,823 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,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:33:59,196 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:59,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:59,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 36 [2018-10-04 12:33:59,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-04 12:33:59,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-04 12:33:59,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=908, Unknown=0, NotChecked=0, Total=1406 [2018-10-04 12:33:59,218 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 38 states. [2018-10-04 12:33:59,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:59,818 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-10-04 12:33:59,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:33:59,819 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 85 [2018-10-04 12:33:59,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:59,820 INFO L225 Difference]: With dead ends: 95 [2018-10-04 12:33:59,820 INFO L226 Difference]: Without dead ends: 94 [2018-10-04 12:33:59,822 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1045, Invalid=2035, Unknown=0, NotChecked=0, Total=3080 [2018-10-04 12:33:59,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-04 12:33:59,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-10-04 12:33:59,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-04 12:33:59,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-10-04 12:33:59,835 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 85 [2018-10-04 12:33:59,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:59,835 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-10-04 12:33:59,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-04 12:33:59,835 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-10-04 12:33:59,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-04 12:33:59,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:59,836 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1] [2018-10-04 12:33:59,836 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:33:59,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:59,837 INFO L82 PathProgramCache]: Analyzing trace with hash 2064058483, now seen corresponding path program 17 times [2018-10-04 12:33:59,837 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:59,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:59,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:59,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:59,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:00,140 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:00,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:00,141 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:34:00,149 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:34:00,259 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-10-04 12:34:00,259 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:00,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:00,265 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,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:00,276 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,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:00,669 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:00,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:00,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 38 [2018-10-04 12:34:00,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-04 12:34:00,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-04 12:34:00,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=1006, Unknown=0, NotChecked=0, Total=1560 [2018-10-04 12:34:00,691 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 40 states. [2018-10-04 12:34:01,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:01,310 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-10-04 12:34:01,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 12:34:01,311 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 90 [2018-10-04 12:34:01,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:01,312 INFO L225 Difference]: With dead ends: 100 [2018-10-04 12:34:01,312 INFO L226 Difference]: Without dead ends: 99 [2018-10-04 12:34:01,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1160, Invalid=2262, Unknown=0, NotChecked=0, Total=3422 [2018-10-04 12:34:01,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-04 12:34:01,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2018-10-04 12:34:01,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-04 12:34:01,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-10-04 12:34:01,326 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 90 [2018-10-04 12:34:01,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:01,326 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-10-04 12:34:01,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-04 12:34:01,327 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-10-04 12:34:01,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-04 12:34:01,327 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:01,328 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1] [2018-10-04 12:34:01,328 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:01,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:01,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1088566397, now seen corresponding path program 18 times [2018-10-04 12:34:01,329 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:01,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:01,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:01,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:01,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:01,836 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:01,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:01,836 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:34:01,844 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:34:01,940 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-04 12:34:01,940 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:01,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:01,954 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,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:01,964 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,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:02,298 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:02,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:02,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 40 [2018-10-04 12:34:02,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-04 12:34:02,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-04 12:34:02,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=613, Invalid=1109, Unknown=0, NotChecked=0, Total=1722 [2018-10-04 12:34:02,321 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 42 states. [2018-10-04 12:34:03,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:03,293 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-10-04 12:34:03,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 12:34:03,293 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 95 [2018-10-04 12:34:03,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:03,294 INFO L225 Difference]: With dead ends: 105 [2018-10-04 12:34:03,294 INFO L226 Difference]: Without dead ends: 104 [2018-10-04 12:34:03,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1115 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1281, Invalid=2501, Unknown=0, NotChecked=0, Total=3782 [2018-10-04 12:34:03,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-04 12:34:03,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-10-04 12:34:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-04 12:34:03,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-04 12:34:03,308 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 95 [2018-10-04 12:34:03,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:03,308 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-04 12:34:03,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-04 12:34:03,308 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-04 12:34:03,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-04 12:34:03,309 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:03,309 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1] [2018-10-04 12:34:03,309 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:03,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:03,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1964405363, now seen corresponding path program 19 times [2018-10-04 12:34:03,310 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:03,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:03,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:03,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:03,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:03,884 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:03,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:03,885 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:34:03,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:03,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:03,973 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:03,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:03,981 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:03,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:04,358 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:04,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:04,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 42 [2018-10-04 12:34:04,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-04 12:34:04,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-04 12:34:04,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1217, Unknown=0, NotChecked=0, Total=1892 [2018-10-04 12:34:04,382 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 44 states. [2018-10-04 12:34:05,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:05,160 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-10-04 12:34:05,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:34:05,163 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 100 [2018-10-04 12:34:05,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:05,164 INFO L225 Difference]: With dead ends: 110 [2018-10-04 12:34:05,164 INFO L226 Difference]: Without dead ends: 109 [2018-10-04 12:34:05,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1234 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1408, Invalid=2752, Unknown=0, NotChecked=0, Total=4160 [2018-10-04 12:34:05,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-04 12:34:05,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2018-10-04 12:34:05,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-04 12:34:05,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-10-04 12:34:05,178 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 100 [2018-10-04 12:34:05,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:05,178 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-10-04 12:34:05,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-04 12:34:05,178 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-10-04 12:34:05,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-04 12:34:05,179 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:05,179 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1] [2018-10-04 12:34:05,179 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:05,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:05,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1742691965, now seen corresponding path program 20 times [2018-10-04 12:34:05,180 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:05,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:05,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:05,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:05,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:06,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:06,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:06,067 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:34:06,075 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:34:06,144 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:34:06,144 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:06,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:06,151 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:06,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:06,160 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,160 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:07,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:07,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:07,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 44 [2018-10-04 12:34:07,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-04 12:34:07,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-04 12:34:07,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=740, Invalid=1330, Unknown=0, NotChecked=0, Total=2070 [2018-10-04 12:34:07,846 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 46 states. [2018-10-04 12:34:08,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:08,804 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-10-04 12:34:08,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 12:34:08,805 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 105 [2018-10-04 12:34:08,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:08,806 INFO L225 Difference]: With dead ends: 115 [2018-10-04 12:34:08,806 INFO L226 Difference]: Without dead ends: 114 [2018-10-04 12:34:08,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1359 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1541, Invalid=3015, Unknown=0, NotChecked=0, Total=4556 [2018-10-04 12:34:08,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-04 12:34:08,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2018-10-04 12:34:08,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-04 12:34:08,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-10-04 12:34:08,821 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 105 [2018-10-04 12:34:08,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:08,821 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-10-04 12:34:08,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-04 12:34:08,821 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-10-04 12:34:08,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-04 12:34:08,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:08,822 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1] [2018-10-04 12:34:08,823 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:08,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:08,823 INFO L82 PathProgramCache]: Analyzing trace with hash 443112563, now seen corresponding path program 21 times [2018-10-04 12:34:08,823 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:08,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:08,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:08,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:08,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:09,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:09,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:09,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 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:34:09,573 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:34:09,687 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-04 12:34:09,687 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:09,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:09,699 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,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:09,707 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,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:10,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:10,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:10,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 46 [2018-10-04 12:34:10,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-04 12:34:10,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-04 12:34:10,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=808, Invalid=1448, Unknown=0, NotChecked=0, Total=2256 [2018-10-04 12:34:10,167 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 48 states. [2018-10-04 12:34:11,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:11,044 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-10-04 12:34:11,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 12:34:11,045 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 110 [2018-10-04 12:34:11,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:11,046 INFO L225 Difference]: With dead ends: 120 [2018-10-04 12:34:11,046 INFO L226 Difference]: Without dead ends: 119 [2018-10-04 12:34:11,048 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1490 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1680, Invalid=3290, Unknown=0, NotChecked=0, Total=4970 [2018-10-04 12:34:11,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-04 12:34:11,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2018-10-04 12:34:11,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-04 12:34:11,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-10-04 12:34:11,064 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 110 [2018-10-04 12:34:11,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:11,065 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-10-04 12:34:11,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-04 12:34:11,065 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-10-04 12:34:11,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-04 12:34:11,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:11,065 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1] [2018-10-04 12:34:11,066 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:11,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:11,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1005586557, now seen corresponding path program 22 times [2018-10-04 12:34:11,066 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:11,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:11,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:11,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:11,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:11,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:11,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:11,654 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:34:11,662 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:34:11,743 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:34:11,743 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:11,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:11,767 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:11,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:11,848 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:11,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:12,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:12,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:12,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 48 [2018-10-04 12:34:12,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-04 12:34:12,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-04 12:34:12,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=879, Invalid=1571, Unknown=0, NotChecked=0, Total=2450 [2018-10-04 12:34:12,443 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 50 states. [2018-10-04 12:34:13,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:13,542 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-10-04 12:34:13,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 12:34:13,542 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 115 [2018-10-04 12:34:13,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:13,544 INFO L225 Difference]: With dead ends: 125 [2018-10-04 12:34:13,544 INFO L226 Difference]: Without dead ends: 124 [2018-10-04 12:34:13,545 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1627 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1825, Invalid=3577, Unknown=0, NotChecked=0, Total=5402 [2018-10-04 12:34:13,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-04 12:34:13,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2018-10-04 12:34:13,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-04 12:34:13,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-10-04 12:34:13,559 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 115 [2018-10-04 12:34:13,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:13,560 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-10-04 12:34:13,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-04 12:34:13,560 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-10-04 12:34:13,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-04 12:34:13,560 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:13,561 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1] [2018-10-04 12:34:13,561 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:13,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:13,561 INFO L82 PathProgramCache]: Analyzing trace with hash -861944205, now seen corresponding path program 23 times [2018-10-04 12:34:13,561 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:13,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:13,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:13,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:13,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:14,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:14,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:14,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 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:34:14,122 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:34:14,245 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-10-04 12:34:14,245 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:14,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:14,253 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,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:14,267 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,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:14,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:14,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:14,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 50 [2018-10-04 12:34:14,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-04 12:34:14,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-04 12:34:14,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=953, Invalid=1699, Unknown=0, NotChecked=0, Total=2652 [2018-10-04 12:34:14,783 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 52 states. [2018-10-04 12:34:15,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:15,886 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-10-04 12:34:15,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 12:34:15,887 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 120 [2018-10-04 12:34:15,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:15,888 INFO L225 Difference]: With dead ends: 130 [2018-10-04 12:34:15,888 INFO L226 Difference]: Without dead ends: 129 [2018-10-04 12:34:15,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1976, Invalid=3876, Unknown=0, NotChecked=0, Total=5852 [2018-10-04 12:34:15,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-04 12:34:15,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2018-10-04 12:34:15,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-04 12:34:15,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-10-04 12:34:15,905 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 120 [2018-10-04 12:34:15,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:15,906 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-10-04 12:34:15,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-04 12:34:15,906 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-10-04 12:34:15,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-04 12:34:15,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:15,907 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1] [2018-10-04 12:34:15,907 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:15,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:15,907 INFO L82 PathProgramCache]: Analyzing trace with hash -448017021, now seen corresponding path program 24 times [2018-10-04 12:34:15,908 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:15,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:15,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:15,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:15,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:16,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:16,437 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:16,446 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:34:16,573 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-04 12:34:16,573 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:16,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:16,603 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:16,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:16,607 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:16,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:17,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:17,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:17,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 52 [2018-10-04 12:34:17,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-04 12:34:17,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-04 12:34:17,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1030, Invalid=1832, Unknown=0, NotChecked=0, Total=2862 [2018-10-04 12:34:17,150 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 54 states. [2018-10-04 12:34:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:18,119 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-10-04 12:34:18,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 12:34:18,120 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 125 [2018-10-04 12:34:18,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:18,121 INFO L225 Difference]: With dead ends: 135 [2018-10-04 12:34:18,121 INFO L226 Difference]: Without dead ends: 134 [2018-10-04 12:34:18,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1919 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2133, Invalid=4187, Unknown=0, NotChecked=0, Total=6320 [2018-10-04 12:34:18,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-04 12:34:18,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2018-10-04 12:34:18,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-04 12:34:18,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-10-04 12:34:18,143 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 125 [2018-10-04 12:34:18,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:18,144 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-10-04 12:34:18,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-04 12:34:18,144 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-10-04 12:34:18,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-04 12:34:18,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:18,145 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1] [2018-10-04 12:34:18,145 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:18,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:18,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1700376691, now seen corresponding path program 25 times [2018-10-04 12:34:18,146 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:18,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:18,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:18,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:18,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:18,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:18,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:18,846 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:18,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:18,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:18,963 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:18,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:18,972 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:18,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:19,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:19,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:19,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 54 [2018-10-04 12:34:19,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-04 12:34:19,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-04 12:34:19,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1110, Invalid=1970, Unknown=0, NotChecked=0, Total=3080 [2018-10-04 12:34:19,561 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 56 states. [2018-10-04 12:34:20,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:20,596 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-10-04 12:34:20,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 12:34:20,597 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 130 [2018-10-04 12:34:20,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:20,598 INFO L225 Difference]: With dead ends: 140 [2018-10-04 12:34:20,598 INFO L226 Difference]: Without dead ends: 139 [2018-10-04 12:34:20,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2074 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2296, Invalid=4510, Unknown=0, NotChecked=0, Total=6806 [2018-10-04 12:34:20,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-04 12:34:20,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2018-10-04 12:34:20,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-04 12:34:20,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-10-04 12:34:20,620 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 130 [2018-10-04 12:34:20,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:20,620 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-10-04 12:34:20,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-04 12:34:20,621 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-10-04 12:34:20,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-04 12:34:20,621 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:20,622 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1] [2018-10-04 12:34:20,622 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:20,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:20,622 INFO L82 PathProgramCache]: Analyzing trace with hash 640951171, now seen corresponding path program 26 times [2018-10-04 12:34:20,622 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:20,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:20,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:20,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:20,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:21,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:21,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:21,210 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:21,218 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:34:21,304 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:34:21,304 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:21,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:21,328 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,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:21,427 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,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:22,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:22,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:22,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 56 [2018-10-04 12:34:22,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-04 12:34:22,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-04 12:34:22,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1193, Invalid=2113, Unknown=0, NotChecked=0, Total=3306 [2018-10-04 12:34:22,664 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 58 states. [2018-10-04 12:34:23,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:23,894 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-10-04 12:34:23,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 12:34:23,894 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 135 [2018-10-04 12:34:23,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:23,895 INFO L225 Difference]: With dead ends: 145 [2018-10-04 12:34:23,895 INFO L226 Difference]: Without dead ends: 144 [2018-10-04 12:34:23,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2235 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2465, Invalid=4845, Unknown=0, NotChecked=0, Total=7310 [2018-10-04 12:34:23,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-04 12:34:23,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2018-10-04 12:34:23,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-04 12:34:23,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-10-04 12:34:23,922 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 135 [2018-10-04 12:34:23,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:23,923 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-10-04 12:34:23,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-04 12:34:23,923 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-10-04 12:34:23,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-04 12:34:23,924 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:23,924 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1] [2018-10-04 12:34:23,924 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:23,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:23,925 INFO L82 PathProgramCache]: Analyzing trace with hash 909580915, now seen corresponding path program 27 times [2018-10-04 12:34:23,925 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:23,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:23,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:23,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:23,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:24,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:24,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:24,697 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:24,706 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:34:24,853 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-10-04 12:34:24,853 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:24,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:24,868 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,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:24,876 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,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:25,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:25,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:25,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 58 [2018-10-04 12:34:25,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-04 12:34:25,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-04 12:34:25,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1279, Invalid=2261, Unknown=0, NotChecked=0, Total=3540 [2018-10-04 12:34:25,753 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 60 states. [2018-10-04 12:34:27,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:27,044 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-10-04 12:34:27,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 12:34:27,044 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 140 [2018-10-04 12:34:27,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:27,045 INFO L225 Difference]: With dead ends: 150 [2018-10-04 12:34:27,045 INFO L226 Difference]: Without dead ends: 149 [2018-10-04 12:34:27,046 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2402 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2640, Invalid=5192, Unknown=0, NotChecked=0, Total=7832 [2018-10-04 12:34:27,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-04 12:34:27,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2018-10-04 12:34:27,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-04 12:34:27,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-10-04 12:34:27,066 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 140 [2018-10-04 12:34:27,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:27,067 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-10-04 12:34:27,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-04 12:34:27,067 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-10-04 12:34:27,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-04 12:34:27,067 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:27,067 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1] [2018-10-04 12:34:27,068 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:27,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:27,068 INFO L82 PathProgramCache]: Analyzing trace with hash 958986627, now seen corresponding path program 28 times [2018-10-04 12:34:27,068 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:27,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:27,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:27,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:27,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:27,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:27,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:27,843 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:27,851 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:34:27,945 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:34:27,946 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:27,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:27,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:27,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:27,961 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:27,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:29,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:29,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:29,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 60 [2018-10-04 12:34:29,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-04 12:34:29,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-04 12:34:29,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=2414, Unknown=0, NotChecked=0, Total=3782 [2018-10-04 12:34:29,053 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 62 states. [2018-10-04 12:34:30,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:30,376 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-10-04 12:34:30,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 12:34:30,377 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 145 [2018-10-04 12:34:30,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:30,378 INFO L225 Difference]: With dead ends: 155 [2018-10-04 12:34:30,378 INFO L226 Difference]: Without dead ends: 154 [2018-10-04 12:34:30,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2575 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2821, Invalid=5551, Unknown=0, NotChecked=0, Total=8372 [2018-10-04 12:34:30,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-04 12:34:30,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2018-10-04 12:34:30,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-04 12:34:30,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-10-04 12:34:30,406 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 145 [2018-10-04 12:34:30,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:30,407 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-10-04 12:34:30,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-04 12:34:30,407 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-10-04 12:34:30,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-04 12:34:30,408 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:30,408 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1] [2018-10-04 12:34:30,408 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:30,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:30,409 INFO L82 PathProgramCache]: Analyzing trace with hash 148374643, now seen corresponding path program 29 times [2018-10-04 12:34:30,409 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:30,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:30,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:30,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:30,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:31,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:31,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:31,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 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:31,128 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:34:31,271 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-10-04 12:34:31,271 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:31,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:31,297 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:31,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:31,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:34:31,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:32,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:32,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:32,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 62 [2018-10-04 12:34:32,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-04 12:34:32,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-04 12:34:32,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1460, Invalid=2572, Unknown=0, NotChecked=0, Total=4032 [2018-10-04 12:34:32,211 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 64 states. [2018-10-04 12:34:33,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:33,468 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-10-04 12:34:33,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 12:34:33,469 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 150 [2018-10-04 12:34:33,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:33,470 INFO L225 Difference]: With dead ends: 160 [2018-10-04 12:34:33,470 INFO L226 Difference]: Without dead ends: 159 [2018-10-04 12:34:33,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2754 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3008, Invalid=5922, Unknown=0, NotChecked=0, Total=8930 [2018-10-04 12:34:33,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-04 12:34:33,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2018-10-04 12:34:33,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-04 12:34:33,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-10-04 12:34:33,495 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 150 [2018-10-04 12:34:33,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:33,496 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-10-04 12:34:33,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-04 12:34:33,496 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-10-04 12:34:33,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-04 12:34:33,497 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:33,497 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1] [2018-10-04 12:34:33,497 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:33,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:33,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1485459331, now seen corresponding path program 30 times [2018-10-04 12:34:33,498 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:33,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:33,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:33,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:33,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:34,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:34,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:34,528 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:34,535 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:34:34,702 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-04 12:34:34,703 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:34,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:34,710 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:34,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:34,721 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:34,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:35,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:35,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:35,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 64 [2018-10-04 12:34:35,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-04 12:34:35,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-04 12:34:35,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1555, Invalid=2735, Unknown=0, NotChecked=0, Total=4290 [2018-10-04 12:34:35,484 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 66 states. [2018-10-04 12:34:36,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:36,930 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-10-04 12:34:36,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-04 12:34:36,930 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 155 [2018-10-04 12:34:36,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:36,931 INFO L225 Difference]: With dead ends: 165 [2018-10-04 12:34:36,931 INFO L226 Difference]: Without dead ends: 164 [2018-10-04 12:34:36,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2939 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3201, Invalid=6305, Unknown=0, NotChecked=0, Total=9506 [2018-10-04 12:34:36,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-04 12:34:36,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2018-10-04 12:34:36,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-04 12:34:36,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-10-04 12:34:36,958 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 155 [2018-10-04 12:34:36,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:36,959 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-10-04 12:34:36,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-04 12:34:36,959 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-10-04 12:34:36,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-04 12:34:36,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:36,960 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1] [2018-10-04 12:34:36,960 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:36,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:36,961 INFO L82 PathProgramCache]: Analyzing trace with hash 517762675, now seen corresponding path program 31 times [2018-10-04 12:34:36,961 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:36,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:36,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:36,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:36,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:38,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:38,262 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:38,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:38,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:38,375 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:38,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:38,393 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:38,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:39,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:39,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:39,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 66 [2018-10-04 12:34:39,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-04 12:34:39,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-04 12:34:39,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=2903, Unknown=0, NotChecked=0, Total=4556 [2018-10-04 12:34:39,398 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 68 states. [2018-10-04 12:34:40,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:40,736 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-10-04 12:34:40,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 12:34:40,736 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 160 [2018-10-04 12:34:40,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:40,738 INFO L225 Difference]: With dead ends: 170 [2018-10-04 12:34:40,738 INFO L226 Difference]: Without dead ends: 169 [2018-10-04 12:34:40,739 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3130 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3400, Invalid=6700, Unknown=0, NotChecked=0, Total=10100 [2018-10-04 12:34:40,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-04 12:34:40,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2018-10-04 12:34:40,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-04 12:34:40,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-10-04 12:34:40,771 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 160 [2018-10-04 12:34:40,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:40,772 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-10-04 12:34:40,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-04 12:34:40,772 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-10-04 12:34:40,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-04 12:34:40,773 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:40,773 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1] [2018-10-04 12:34:40,773 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:40,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:40,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1186473347, now seen corresponding path program 32 times [2018-10-04 12:34:40,774 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:40,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:40,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:40,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:40,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:42,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:42,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:42,537 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:42,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:34:42,649 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:34:42,650 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:42,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:42,669 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,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:42,681 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,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:43,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:43,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:43,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 68 [2018-10-04 12:34:43,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-04 12:34:43,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-04 12:34:43,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1754, Invalid=3076, Unknown=0, NotChecked=0, Total=4830 [2018-10-04 12:34:43,513 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 70 states. [2018-10-04 12:34:45,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:45,264 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-10-04 12:34:45,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 12:34:45,264 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 165 [2018-10-04 12:34:45,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:45,265 INFO L225 Difference]: With dead ends: 175 [2018-10-04 12:34:45,265 INFO L226 Difference]: Without dead ends: 174 [2018-10-04 12:34:45,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3327 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3605, Invalid=7107, Unknown=0, NotChecked=0, Total=10712 [2018-10-04 12:34:45,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-04 12:34:45,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2018-10-04 12:34:45,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-04 12:34:45,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-04 12:34:45,301 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 165 [2018-10-04 12:34:45,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:45,302 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-04 12:34:45,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-04 12:34:45,302 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-04 12:34:45,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-04 12:34:45,303 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:45,303 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1] [2018-10-04 12:34:45,303 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:45,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:45,303 INFO L82 PathProgramCache]: Analyzing trace with hash 837048435, now seen corresponding path program 33 times [2018-10-04 12:34:45,304 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:45,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:45,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:45,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:45,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:46,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:46,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:46,433 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:46,441 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:34:46,643 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-10-04 12:34:46,643 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:46,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:46,655 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:46,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:46,663 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:46,663 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:47,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:47,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:47,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 70 [2018-10-04 12:34:47,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-04 12:34:47,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-04 12:34:47,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1858, Invalid=3254, Unknown=0, NotChecked=0, Total=5112 [2018-10-04 12:34:47,584 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 72 states. [2018-10-04 12:34:49,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:49,107 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-10-04 12:34:49,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 12:34:49,107 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 170 [2018-10-04 12:34:49,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:49,108 INFO L225 Difference]: With dead ends: 180 [2018-10-04 12:34:49,108 INFO L226 Difference]: Without dead ends: 179 [2018-10-04 12:34:49,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3530 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3816, Invalid=7526, Unknown=0, NotChecked=0, Total=11342 [2018-10-04 12:34:49,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-04 12:34:49,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2018-10-04 12:34:49,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-04 12:34:49,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-10-04 12:34:49,139 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 170 [2018-10-04 12:34:49,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:49,139 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-10-04 12:34:49,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-04 12:34:49,139 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-10-04 12:34:49,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-04 12:34:49,140 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:49,140 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1] [2018-10-04 12:34:49,141 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:49,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:49,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1309834115, now seen corresponding path program 34 times [2018-10-04 12:34:49,141 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:49,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:49,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:49,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:49,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:50,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:50,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:50,132 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:50,163 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:34:50,281 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:34:50,281 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:50,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:50,303 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:50,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:50,399 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:50,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:51,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:51,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:51,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 72 [2018-10-04 12:34:51,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-04 12:34:51,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-04 12:34:51,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1965, Invalid=3437, Unknown=0, NotChecked=0, Total=5402 [2018-10-04 12:34:51,301 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 74 states. [2018-10-04 12:34:53,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:53,267 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-10-04 12:34:53,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 12:34:53,268 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 175 [2018-10-04 12:34:53,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:53,269 INFO L225 Difference]: With dead ends: 185 [2018-10-04 12:34:53,269 INFO L226 Difference]: Without dead ends: 184 [2018-10-04 12:34:53,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3739 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4033, Invalid=7957, Unknown=0, NotChecked=0, Total=11990 [2018-10-04 12:34:53,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-04 12:34:53,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2018-10-04 12:34:53,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-04 12:34:53,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-10-04 12:34:53,300 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 175 [2018-10-04 12:34:53,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:53,300 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-10-04 12:34:53,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-04 12:34:53,300 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-10-04 12:34:53,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-04 12:34:53,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:53,301 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1] [2018-10-04 12:34:53,302 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:53,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:53,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1938801267, now seen corresponding path program 35 times [2018-10-04 12:34:53,302 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:53,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:53,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:53,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:53,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:54,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:54,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:54,347 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:54,354 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:34:54,537 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-10-04 12:34:54,537 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:54,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:54,568 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:54,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:54,651 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:54,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:55,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:55,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:55,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 74 [2018-10-04 12:34:55,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-04 12:34:55,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-04 12:34:55,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2075, Invalid=3625, Unknown=0, NotChecked=0, Total=5700 [2018-10-04 12:34:55,702 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 76 states. [2018-10-04 12:34:57,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:57,355 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-10-04 12:34:57,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-04 12:34:57,355 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 180 [2018-10-04 12:34:57,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:57,356 INFO L225 Difference]: With dead ends: 190 [2018-10-04 12:34:57,357 INFO L226 Difference]: Without dead ends: 189 [2018-10-04 12:34:57,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3954 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4256, Invalid=8400, Unknown=0, NotChecked=0, Total=12656 [2018-10-04 12:34:57,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-04 12:34:57,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2018-10-04 12:34:57,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-04 12:34:57,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-10-04 12:34:57,395 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 180 [2018-10-04 12:34:57,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:57,395 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-10-04 12:34:57,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-04 12:34:57,396 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-10-04 12:34:57,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-04 12:34:57,396 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:57,397 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1] [2018-10-04 12:34:57,397 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:57,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:57,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1090081155, now seen corresponding path program 36 times [2018-10-04 12:34:57,397 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:57,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:57,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:57,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:57,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:58,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:58,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:58,349 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:58,356 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:34:58,569 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-10-04 12:34:58,569 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:58,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:58,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:34:58,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:58,679 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,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:00,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:00,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:00,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 76 [2018-10-04 12:35:00,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-04 12:35:00,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-04 12:35:00,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2188, Invalid=3818, Unknown=0, NotChecked=0, Total=6006 [2018-10-04 12:35:00,564 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 78 states. [2018-10-04 12:35:02,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:02,242 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-10-04 12:35:02,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-04 12:35:02,243 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 185 [2018-10-04 12:35:02,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:02,244 INFO L225 Difference]: With dead ends: 195 [2018-10-04 12:35:02,244 INFO L226 Difference]: Without dead ends: 194 [2018-10-04 12:35:02,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4175 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4485, Invalid=8855, Unknown=0, NotChecked=0, Total=13340 [2018-10-04 12:35:02,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-04 12:35:02,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2018-10-04 12:35:02,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-04 12:35:02,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-10-04 12:35:02,276 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 185 [2018-10-04 12:35:02,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:02,276 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-10-04 12:35:02,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-04 12:35:02,277 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-10-04 12:35:02,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-04 12:35:02,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:02,278 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1] [2018-10-04 12:35:02,278 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:35:02,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:02,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1921078157, now seen corresponding path program 37 times [2018-10-04 12:35:02,278 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:02,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:02,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:02,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:02,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:03,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:03,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:03,356 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:35:03,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:03,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:03,503 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,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:03,516 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,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:04,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:04,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:04,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 78 [2018-10-04 12:35:04,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-04 12:35:04,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-04 12:35:04,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2304, Invalid=4016, Unknown=0, NotChecked=0, Total=6320 [2018-10-04 12:35:04,848 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 80 states. [2018-10-04 12:35:06,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:06,610 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-10-04 12:35:06,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-04 12:35:06,610 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 190 [2018-10-04 12:35:06,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:06,611 INFO L225 Difference]: With dead ends: 200 [2018-10-04 12:35:06,611 INFO L226 Difference]: Without dead ends: 199 [2018-10-04 12:35:06,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4402 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4720, Invalid=9322, Unknown=0, NotChecked=0, Total=14042 [2018-10-04 12:35:06,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-04 12:35:06,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2018-10-04 12:35:06,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-04 12:35:06,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-10-04 12:35:06,643 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 190 [2018-10-04 12:35:06,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:06,643 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-10-04 12:35:06,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-04 12:35:06,643 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-10-04 12:35:06,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-04 12:35:06,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:06,644 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1] [2018-10-04 12:35:06,644 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:35:06,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:06,644 INFO L82 PathProgramCache]: Analyzing trace with hash 2043455363, now seen corresponding path program 38 times [2018-10-04 12:35:06,645 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:06,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:06,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:06,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:06,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:07,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:07,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:07,594 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:35:07,611 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:35:07,735 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:35:07,736 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:07,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:07,748 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,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:07,756 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,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:08,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:08,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:08,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 80 [2018-10-04 12:35:08,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-04 12:35:08,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-04 12:35:08,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2423, Invalid=4219, Unknown=0, NotChecked=0, Total=6642 [2018-10-04 12:35:08,943 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 82 states. [2018-10-04 12:35:10,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:10,990 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-10-04 12:35:10,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 12:35:10,990 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 195 [2018-10-04 12:35:10,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:10,991 INFO L225 Difference]: With dead ends: 205 [2018-10-04 12:35:10,991 INFO L226 Difference]: Without dead ends: 204 [2018-10-04 12:35:10,992 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4635 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4961, Invalid=9801, Unknown=0, NotChecked=0, Total=14762 [2018-10-04 12:35:10,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-10-04 12:35:11,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2018-10-04 12:35:11,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-04 12:35:11,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-10-04 12:35:11,024 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 195 [2018-10-04 12:35:11,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:11,025 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-10-04 12:35:11,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-04 12:35:11,025 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-10-04 12:35:11,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-04 12:35:11,026 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:11,026 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1] [2018-10-04 12:35:11,026 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:35:11,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:11,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1588521357, now seen corresponding path program 39 times [2018-10-04 12:35:11,026 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:11,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:11,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:11,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:11,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:12,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:12,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:12,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 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:35:12,465 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:35:12,741 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-10-04 12:35:12,741 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:12,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:12,751 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:12,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:12,761 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:12,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:13,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:13,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:13,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 82 [2018-10-04 12:35:13,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-04 12:35:13,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-04 12:35:13,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2545, Invalid=4427, Unknown=0, NotChecked=0, Total=6972 [2018-10-04 12:35:13,879 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 84 states. [2018-10-04 12:35:16,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:16,005 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-10-04 12:35:16,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-04 12:35:16,005 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 200 [2018-10-04 12:35:16,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:16,006 INFO L225 Difference]: With dead ends: 210 [2018-10-04 12:35:16,006 INFO L226 Difference]: Without dead ends: 209 [2018-10-04 12:35:16,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4874 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5208, Invalid=10292, Unknown=0, NotChecked=0, Total=15500 [2018-10-04 12:35:16,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-04 12:35:16,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2018-10-04 12:35:16,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-04 12:35:16,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-10-04 12:35:16,041 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 200 [2018-10-04 12:35:16,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:16,041 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-10-04 12:35:16,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-04 12:35:16,041 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-10-04 12:35:16,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-04 12:35:16,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:16,042 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1] [2018-10-04 12:35:16,043 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:35:16,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:16,043 INFO L82 PathProgramCache]: Analyzing trace with hash -622035581, now seen corresponding path program 40 times [2018-10-04 12:35:16,043 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:16,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:16,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:16,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:16,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:17,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:17,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:17,113 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:35:17,127 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:35:17,265 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:35:17,265 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:17,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:17,276 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:17,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:17,293 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:17,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:18,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:18,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:18,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 84 [2018-10-04 12:35:18,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-04 12:35:18,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-04 12:35:18,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2670, Invalid=4640, Unknown=0, NotChecked=0, Total=7310 [2018-10-04 12:35:18,453 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 86 states. [2018-10-04 12:35:20,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:20,626 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-10-04 12:35:20,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 12:35:20,626 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 205 [2018-10-04 12:35:20,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:20,627 INFO L225 Difference]: With dead ends: 215 [2018-10-04 12:35:20,628 INFO L226 Difference]: Without dead ends: 214 [2018-10-04 12:35:20,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5119 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5461, Invalid=10795, Unknown=0, NotChecked=0, Total=16256 [2018-10-04 12:35:20,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-04 12:35:20,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2018-10-04 12:35:20,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-04 12:35:20,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-10-04 12:35:20,665 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 205 [2018-10-04 12:35:20,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:20,665 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-10-04 12:35:20,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-04 12:35:20,666 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-10-04 12:35:20,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-04 12:35:20,666 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:20,666 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1] [2018-10-04 12:35:20,667 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:35:20,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:20,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1218904179, now seen corresponding path program 41 times [2018-10-04 12:35:20,667 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:20,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:20,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:20,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:20,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:21,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:21,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:21,816 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:35:21,823 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:35:22,206 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-10-04 12:35:22,206 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:22,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:22,230 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,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:22,244 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,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:23,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:23,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:23,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 86 [2018-10-04 12:35:23,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-04 12:35:23,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-04 12:35:23,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2798, Invalid=4858, Unknown=0, NotChecked=0, Total=7656 [2018-10-04 12:35:23,537 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 88 states. [2018-10-04 12:35:25,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:25,775 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-10-04 12:35:25,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-04 12:35:25,776 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 210 [2018-10-04 12:35:25,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:25,777 INFO L225 Difference]: With dead ends: 220 [2018-10-04 12:35:25,777 INFO L226 Difference]: Without dead ends: 219 [2018-10-04 12:35:25,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5370 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5720, Invalid=11310, Unknown=0, NotChecked=0, Total=17030 [2018-10-04 12:35:25,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-04 12:35:25,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2018-10-04 12:35:25,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-04 12:35:25,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-10-04 12:35:25,824 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 210 [2018-10-04 12:35:25,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:25,824 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-10-04 12:35:25,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-04 12:35:25,824 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-10-04 12:35:25,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-04 12:35:25,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:25,826 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1] [2018-10-04 12:35:25,826 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:35:25,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:25,826 INFO L82 PathProgramCache]: Analyzing trace with hash -826748029, now seen corresponding path program 42 times [2018-10-04 12:35:25,826 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:25,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:25,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:25,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:25,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:26,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:26,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:26,955 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:35:26,964 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:35:27,258 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-10-04 12:35:27,259 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:27,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:27,268 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:27,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:27,278 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:27,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:28,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:28,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:28,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 88 [2018-10-04 12:35:28,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-04 12:35:28,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-04 12:35:28,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2929, Invalid=5081, Unknown=0, NotChecked=0, Total=8010 [2018-10-04 12:35:28,553 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 90 states. [2018-10-04 12:35:28,904 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-04 12:35:31,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:31,421 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-10-04 12:35:31,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-04 12:35:31,422 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 215 [2018-10-04 12:35:31,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:31,423 INFO L225 Difference]: With dead ends: 225 [2018-10-04 12:35:31,423 INFO L226 Difference]: Without dead ends: 224 [2018-10-04 12:35:31,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5627 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5985, Invalid=11837, Unknown=0, NotChecked=0, Total=17822 [2018-10-04 12:35:31,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-10-04 12:35:31,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2018-10-04 12:35:31,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-04 12:35:31,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-10-04 12:35:31,568 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 215 [2018-10-04 12:35:31,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:31,568 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-10-04 12:35:31,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-04 12:35:31,569 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-10-04 12:35:31,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-04 12:35:31,569 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:31,570 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1] [2018-10-04 12:35:31,570 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:35:31,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:31,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1793037709, now seen corresponding path program 43 times [2018-10-04 12:35:31,570 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:31,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:31,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:31,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:31,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:33,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:33,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:33,183 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:35:33,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:33,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:33,346 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:33,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:33,358 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:33,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:34,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:34,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:34,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 90 [2018-10-04 12:35:34,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-04 12:35:34,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-04 12:35:34,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3063, Invalid=5309, Unknown=0, NotChecked=0, Total=8372 [2018-10-04 12:35:34,733 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 92 states. [2018-10-04 12:35:37,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:37,138 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-10-04 12:35:37,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-04 12:35:37,138 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 220 [2018-10-04 12:35:37,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:37,139 INFO L225 Difference]: With dead ends: 230 [2018-10-04 12:35:37,139 INFO L226 Difference]: Without dead ends: 229 [2018-10-04 12:35:37,155 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5890 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6256, Invalid=12376, Unknown=0, NotChecked=0, Total=18632 [2018-10-04 12:35:37,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-10-04 12:35:37,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2018-10-04 12:35:37,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-10-04 12:35:37,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2018-10-04 12:35:37,204 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 220 [2018-10-04 12:35:37,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:37,205 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2018-10-04 12:35:37,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-04 12:35:37,205 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2018-10-04 12:35:37,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-04 12:35:37,206 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:37,206 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1] [2018-10-04 12:35:37,206 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:35:37,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:37,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1200728451, now seen corresponding path program 44 times [2018-10-04 12:35:37,206 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:37,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:37,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:37,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:37,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:38,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:38,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:38,744 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:35:38,752 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:35:38,897 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:35:38,898 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:38,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:38,908 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:38,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:38,917 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:38,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:40,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:40,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:40,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 92 [2018-10-04 12:35:40,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-04 12:35:40,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-04 12:35:40,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3200, Invalid=5542, Unknown=0, NotChecked=0, Total=8742 [2018-10-04 12:35:40,716 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 94 states. [2018-10-04 12:35:43,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:43,127 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-10-04 12:35:43,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-04 12:35:43,127 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 225 [2018-10-04 12:35:43,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:43,128 INFO L225 Difference]: With dead ends: 235 [2018-10-04 12:35:43,128 INFO L226 Difference]: Without dead ends: 234 [2018-10-04 12:35:43,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6159 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6533, Invalid=12927, Unknown=0, NotChecked=0, Total=19460 [2018-10-04 12:35:43,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-04 12:35:43,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2018-10-04 12:35:43,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-04 12:35:43,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-10-04 12:35:43,189 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 225 [2018-10-04 12:35:43,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:43,190 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-10-04 12:35:43,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-04 12:35:43,190 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-10-04 12:35:43,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-04 12:35:43,191 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:43,191 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1] [2018-10-04 12:35:43,192 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:35:43,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:43,192 INFO L82 PathProgramCache]: Analyzing trace with hash 274551923, now seen corresponding path program 45 times [2018-10-04 12:35:43,192 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:43,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:43,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:43,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:43,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:44,494 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:44,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:44,494 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:35:44,503 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:35:44,811 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-10-04 12:35:44,811 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:44,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:44,823 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,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:44,832 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,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:46,528 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:46,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:46,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 94 [2018-10-04 12:35:46,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-04 12:35:46,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-04 12:35:46,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3340, Invalid=5780, Unknown=0, NotChecked=0, Total=9120 [2018-10-04 12:35:46,552 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 96 states. [2018-10-04 12:35:48,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:48,934 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2018-10-04 12:35:48,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-04 12:35:48,934 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 230 [2018-10-04 12:35:48,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:48,936 INFO L225 Difference]: With dead ends: 240 [2018-10-04 12:35:48,936 INFO L226 Difference]: Without dead ends: 239 [2018-10-04 12:35:48,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6434 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6816, Invalid=13490, Unknown=0, NotChecked=0, Total=20306 [2018-10-04 12:35:48,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-04 12:35:48,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2018-10-04 12:35:48,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-10-04 12:35:48,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-10-04 12:35:48,990 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 230 [2018-10-04 12:35:48,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:48,990 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-10-04 12:35:48,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-04 12:35:48,990 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-10-04 12:35:48,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-04 12:35:48,992 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:48,992 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1] [2018-10-04 12:35:48,992 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:35:48,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:48,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1076428925, now seen corresponding path program 46 times [2018-10-04 12:35:48,993 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:48,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:48,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:48,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:48,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:50,428 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:50,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:50,428 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:35:50,446 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:35:50,609 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:35:50,610 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:50,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:50,627 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:50,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:50,635 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:50,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:52,231 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:52,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:52,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 96 [2018-10-04 12:35:52,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-10-04 12:35:52,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-10-04 12:35:52,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3483, Invalid=6023, Unknown=0, NotChecked=0, Total=9506 [2018-10-04 12:35:52,254 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 98 states. [2018-10-04 12:35:54,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:54,742 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-10-04 12:35:54,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-04 12:35:54,751 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 235 [2018-10-04 12:35:54,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:54,752 INFO L225 Difference]: With dead ends: 245 [2018-10-04 12:35:54,752 INFO L226 Difference]: Without dead ends: 244 [2018-10-04 12:35:54,754 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6715 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7105, Invalid=14065, Unknown=0, NotChecked=0, Total=21170 [2018-10-04 12:35:54,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-04 12:35:54,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2018-10-04 12:35:54,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-04 12:35:54,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-10-04 12:35:54,817 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 235 [2018-10-04 12:35:54,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:54,818 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-10-04 12:35:54,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-10-04 12:35:54,818 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-10-04 12:35:54,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-04 12:35:54,819 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:54,819 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1] [2018-10-04 12:35:54,819 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:35:54,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:54,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1140998541, now seen corresponding path program 47 times [2018-10-04 12:35:54,820 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:54,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:54,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:54,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:54,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:56,665 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:56,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:56,665 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:56,673 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:35:56,954 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-10-04 12:35:56,954 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:56,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:56,966 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:56,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:56,979 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:56,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:58,523 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:58,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:58,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 98 [2018-10-04 12:35:58,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-10-04 12:35:58,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-10-04 12:35:58,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3629, Invalid=6271, Unknown=0, NotChecked=0, Total=9900 [2018-10-04 12:35:58,546 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 100 states. [2018-10-04 12:36:01,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:01,373 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2018-10-04 12:36:01,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-04 12:36:01,374 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 240 [2018-10-04 12:36:01,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:01,375 INFO L225 Difference]: With dead ends: 250 [2018-10-04 12:36:01,375 INFO L226 Difference]: Without dead ends: 249 [2018-10-04 12:36:01,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7002 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7400, Invalid=14652, Unknown=0, NotChecked=0, Total=22052 [2018-10-04 12:36:01,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-04 12:36:01,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2018-10-04 12:36:01,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-10-04 12:36:01,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-10-04 12:36:01,423 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 240 [2018-10-04 12:36:01,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:01,423 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-10-04 12:36:01,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-10-04 12:36:01,424 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-10-04 12:36:01,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-04 12:36:01,424 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:01,425 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1] [2018-10-04 12:36:01,425 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:36:01,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:01,425 INFO L82 PathProgramCache]: Analyzing trace with hash 971560323, now seen corresponding path program 48 times [2018-10-04 12:36:01,425 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:01,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:01,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:01,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:01,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:03,358 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:03,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:03,358 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:36:03,365 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:36:03,702 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-10-04 12:36:03,702 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:03,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:03,719 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:03,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:03,725 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:03,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:05,519 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:05,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:05,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 100 [2018-10-04 12:36:05,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-04 12:36:05,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-04 12:36:05,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3778, Invalid=6524, Unknown=0, NotChecked=0, Total=10302 [2018-10-04 12:36:05,545 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 102 states. [2018-10-04 12:36:08,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:08,435 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-10-04 12:36:08,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-04 12:36:08,435 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 245 [2018-10-04 12:36:08,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:08,437 INFO L225 Difference]: With dead ends: 255 [2018-10-04 12:36:08,437 INFO L226 Difference]: Without dead ends: 254 [2018-10-04 12:36:08,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7295 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7701, Invalid=15251, Unknown=0, NotChecked=0, Total=22952 [2018-10-04 12:36:08,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-04 12:36:08,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2018-10-04 12:36:08,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-04 12:36:08,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-10-04 12:36:08,495 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 245 [2018-10-04 12:36:08,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:08,496 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-10-04 12:36:08,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-04 12:36:08,496 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-10-04 12:36:08,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-04 12:36:08,497 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:08,497 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1] [2018-10-04 12:36:08,497 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:36:08,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:08,498 INFO L82 PathProgramCache]: Analyzing trace with hash 295807091, now seen corresponding path program 49 times [2018-10-04 12:36:08,498 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:08,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:08,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:08,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:08,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:10,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:10,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:10,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 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:36:10,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:10,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:10,266 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:10,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:10,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:36:10,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:12,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:12,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:12,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 102 [2018-10-04 12:36:12,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-10-04 12:36:12,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-10-04 12:36:12,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3930, Invalid=6782, Unknown=0, NotChecked=0, Total=10712 [2018-10-04 12:36:12,366 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 104 states. [2018-10-04 12:36:15,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:15,202 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2018-10-04 12:36:15,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-04 12:36:15,202 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 250 [2018-10-04 12:36:15,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:15,204 INFO L225 Difference]: With dead ends: 260 [2018-10-04 12:36:15,204 INFO L226 Difference]: Without dead ends: 259 [2018-10-04 12:36:15,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7594 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8008, Invalid=15862, Unknown=0, NotChecked=0, Total=23870 [2018-10-04 12:36:15,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-04 12:36:15,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2018-10-04 12:36:15,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-04 12:36:15,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2018-10-04 12:36:15,272 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 250 [2018-10-04 12:36:15,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:15,273 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2018-10-04 12:36:15,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-10-04 12:36:15,273 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2018-10-04 12:36:15,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-04 12:36:15,275 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:15,275 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1] [2018-10-04 12:36:15,275 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:36:15,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:15,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1076308867, now seen corresponding path program 50 times [2018-10-04 12:36:15,276 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:15,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:15,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:15,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:15,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:17,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:17,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:17,079 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:36:17,089 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:36:17,268 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:36:17,269 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:17,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:17,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:36:17,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:17,303 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:17,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:19,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:19,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:19,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 104 [2018-10-04 12:36:19,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-10-04 12:36:19,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-10-04 12:36:19,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4085, Invalid=7045, Unknown=0, NotChecked=0, Total=11130 [2018-10-04 12:36:19,093 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 106 states. [2018-10-04 12:36:22,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:22,072 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-10-04 12:36:22,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-04 12:36:22,072 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 255 [2018-10-04 12:36:22,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:22,073 INFO L225 Difference]: With dead ends: 265 [2018-10-04 12:36:22,073 INFO L226 Difference]: Without dead ends: 264 [2018-10-04 12:36:22,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7899 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8321, Invalid=16485, Unknown=0, NotChecked=0, Total=24806 [2018-10-04 12:36:22,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-10-04 12:36:22,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2018-10-04 12:36:22,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-10-04 12:36:22,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-10-04 12:36:22,128 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 255 [2018-10-04 12:36:22,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:22,128 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-10-04 12:36:22,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-10-04 12:36:22,128 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-10-04 12:36:22,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-04 12:36:22,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:22,130 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1] [2018-10-04 12:36:22,130 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:36:22,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:22,130 INFO L82 PathProgramCache]: Analyzing trace with hash 48829043, now seen corresponding path program 51 times [2018-10-04 12:36:22,130 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:22,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:22,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:22,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:22,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:23,617 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:23,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:23,617 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:36:23,624 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:36:23,999 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-10-04 12:36:23,999 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:24,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:24,022 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:24,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:24,030 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:24,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:25,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:25,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:25,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 106 [2018-10-04 12:36:25,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-04 12:36:25,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-04 12:36:25,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4243, Invalid=7313, Unknown=0, NotChecked=0, Total=11556 [2018-10-04 12:36:25,846 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 108 states. [2018-10-04 12:36:28,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:28,938 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2018-10-04 12:36:28,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-04 12:36:28,939 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 260 [2018-10-04 12:36:28,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:28,940 INFO L225 Difference]: With dead ends: 270 [2018-10-04 12:36:28,940 INFO L226 Difference]: Without dead ends: 269 [2018-10-04 12:36:28,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8210 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8640, Invalid=17120, Unknown=0, NotChecked=0, Total=25760 [2018-10-04 12:36:28,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-04 12:36:29,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2018-10-04 12:36:29,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-04 12:36:29,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2018-10-04 12:36:29,003 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 260 [2018-10-04 12:36:29,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:29,004 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2018-10-04 12:36:29,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-04 12:36:29,004 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2018-10-04 12:36:29,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-10-04 12:36:29,005 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:29,005 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1] [2018-10-04 12:36:29,005 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:36:29,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:29,005 INFO L82 PathProgramCache]: Analyzing trace with hash -453901949, now seen corresponding path program 52 times [2018-10-04 12:36:29,005 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:29,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:29,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:29,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:29,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:30,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:30,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:30,640 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:36:30,649 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:36:30,829 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:36:30,829 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:30,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:30,841 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:30,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:30,849 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:30,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:32,876 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:32,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:32,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 108 [2018-10-04 12:36:32,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-10-04 12:36:32,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-10-04 12:36:32,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4404, Invalid=7586, Unknown=0, NotChecked=0, Total=11990 [2018-10-04 12:36:32,900 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 110 states. [2018-10-04 12:36:35,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:35,917 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-10-04 12:36:35,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-04 12:36:35,917 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 265 [2018-10-04 12:36:35,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:35,918 INFO L225 Difference]: With dead ends: 275 [2018-10-04 12:36:35,918 INFO L226 Difference]: Without dead ends: 274 [2018-10-04 12:36:35,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8527 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8965, Invalid=17767, Unknown=0, NotChecked=0, Total=26732 [2018-10-04 12:36:35,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-04 12:36:35,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2018-10-04 12:36:35,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-04 12:36:35,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-10-04 12:36:35,978 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 265 [2018-10-04 12:36:35,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:35,978 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-10-04 12:36:35,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-10-04 12:36:35,978 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-10-04 12:36:35,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-04 12:36:35,979 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:35,979 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1] [2018-10-04 12:36:35,980 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:36:35,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:35,980 INFO L82 PathProgramCache]: Analyzing trace with hash -109839245, now seen corresponding path program 53 times [2018-10-04 12:36:35,980 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:35,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:35,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:35,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:35,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:37,945 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:37,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:37,946 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:36:37,953 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:36:38,313 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-10-04 12:36:38,313 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:38,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:38,327 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,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:38,335 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,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:40,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:40,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:40,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 110 [2018-10-04 12:36:40,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-10-04 12:36:40,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-10-04 12:36:40,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4568, Invalid=7864, Unknown=0, NotChecked=0, Total=12432 [2018-10-04 12:36:40,275 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 112 states. [2018-10-04 12:36:43,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:43,606 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2018-10-04 12:36:43,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-04 12:36:43,606 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 270 [2018-10-04 12:36:43,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:43,608 INFO L225 Difference]: With dead ends: 280 [2018-10-04 12:36:43,608 INFO L226 Difference]: Without dead ends: 279 [2018-10-04 12:36:43,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8850 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9296, Invalid=18426, Unknown=0, NotChecked=0, Total=27722 [2018-10-04 12:36:43,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-04 12:36:43,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 276. [2018-10-04 12:36:43,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-04 12:36:43,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2018-10-04 12:36:43,670 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 270 [2018-10-04 12:36:43,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:43,671 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2018-10-04 12:36:43,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-10-04 12:36:43,671 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2018-10-04 12:36:43,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-04 12:36:43,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:43,672 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1] [2018-10-04 12:36:43,673 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:36:43,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:43,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1029089405, now seen corresponding path program 54 times [2018-10-04 12:36:43,673 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:43,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:43,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:43,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:43,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:45,230 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:45,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:45,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 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:36:45,237 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:36:45,629 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-10-04 12:36:45,629 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:45,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:45,641 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:45,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:45,652 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:45,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:47,967 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:47,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:47,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 112 [2018-10-04 12:36:47,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-10-04 12:36:47,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-10-04 12:36:47,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4735, Invalid=8147, Unknown=0, NotChecked=0, Total=12882 [2018-10-04 12:36:47,993 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 114 states. [2018-10-04 12:36:51,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:51,192 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-10-04 12:36:51,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-04 12:36:51,193 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 275 [2018-10-04 12:36:51,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:51,194 INFO L225 Difference]: With dead ends: 285 [2018-10-04 12:36:51,194 INFO L226 Difference]: Without dead ends: 284 [2018-10-04 12:36:51,195 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9179 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9633, Invalid=19097, Unknown=0, NotChecked=0, Total=28730 [2018-10-04 12:36:51,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-10-04 12:36:51,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2018-10-04 12:36:51,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-10-04 12:36:51,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-10-04 12:36:51,251 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 275 [2018-10-04 12:36:51,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:51,251 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-10-04 12:36:51,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-10-04 12:36:51,251 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-10-04 12:36:51,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-10-04 12:36:51,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:51,252 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1] [2018-10-04 12:36:51,252 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:36:51,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:51,252 INFO L82 PathProgramCache]: Analyzing trace with hash -689805709, now seen corresponding path program 55 times [2018-10-04 12:36:51,253 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:51,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:51,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:51,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:51,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:53,074 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:53,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:53,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 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:36:53,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:53,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:53,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:53,274 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:53,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:53,285 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:53,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:55,311 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:55,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:55,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 114 [2018-10-04 12:36:55,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-10-04 12:36:55,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-10-04 12:36:55,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4905, Invalid=8435, Unknown=0, NotChecked=0, Total=13340 [2018-10-04 12:36:55,335 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 116 states. [2018-10-04 12:36:58,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:58,798 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2018-10-04 12:36:58,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-04 12:36:58,798 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 280 [2018-10-04 12:36:58,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:58,799 INFO L225 Difference]: With dead ends: 290 [2018-10-04 12:36:58,799 INFO L226 Difference]: Without dead ends: 289 [2018-10-04 12:36:58,800 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9514 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9976, Invalid=19780, Unknown=0, NotChecked=0, Total=29756 [2018-10-04 12:36:58,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-10-04 12:36:58,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2018-10-04 12:36:58,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-10-04 12:36:58,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2018-10-04 12:36:58,858 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 280 [2018-10-04 12:36:58,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:58,858 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2018-10-04 12:36:58,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-10-04 12:36:58,859 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2018-10-04 12:36:58,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-10-04 12:36:58,859 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:58,860 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1] [2018-10-04 12:36:58,860 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:36:58,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:58,860 INFO L82 PathProgramCache]: Analyzing trace with hash -72536701, now seen corresponding path program 56 times [2018-10-04 12:36:58,860 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:58,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:58,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:58,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:58,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:00,561 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:00,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:00,561 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:37:00,569 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:37:00,754 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:37:00,754 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:37:00,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:00,765 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:00,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:37:00,773 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:00,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:37:03,167 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:03,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:03,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 116 [2018-10-04 12:37:03,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-10-04 12:37:03,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-10-04 12:37:03,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5078, Invalid=8728, Unknown=0, NotChecked=0, Total=13806 [2018-10-04 12:37:03,189 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 118 states. [2018-10-04 12:37:06,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:37:06,496 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-10-04 12:37:06,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-04 12:37:06,497 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 285 [2018-10-04 12:37:06,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:37:06,498 INFO L225 Difference]: With dead ends: 295 [2018-10-04 12:37:06,498 INFO L226 Difference]: Without dead ends: 294 [2018-10-04 12:37:06,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9855 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=10325, Invalid=20475, Unknown=0, NotChecked=0, Total=30800 [2018-10-04 12:37:06,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-10-04 12:37:06,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2018-10-04 12:37:06,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-10-04 12:37:06,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-10-04 12:37:06,564 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 285 [2018-10-04 12:37:06,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:37:06,564 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-10-04 12:37:06,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-10-04 12:37:06,564 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-10-04 12:37:06,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-04 12:37:06,565 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:37:06,565 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1] [2018-10-04 12:37:06,565 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:37:06,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:37:06,566 INFO L82 PathProgramCache]: Analyzing trace with hash -187412365, now seen corresponding path program 57 times [2018-10-04 12:37:06,566 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:37:06,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:37:06,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:06,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:37:06,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:08,607 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:08,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:08,607 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:37:08,614 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:37:09,055 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-10-04 12:37:09,055 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:37:09,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:09,068 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:09,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:37:09,077 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:09,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:37:11,356 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:11,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:11,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 118 [2018-10-04 12:37:11,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-10-04 12:37:11,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-10-04 12:37:11,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5254, Invalid=9026, Unknown=0, NotChecked=0, Total=14280 [2018-10-04 12:37:11,380 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 120 states. [2018-10-04 12:37:15,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:37:15,048 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2018-10-04 12:37:15,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-04 12:37:15,048 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 290 [2018-10-04 12:37:15,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:37:15,049 INFO L225 Difference]: With dead ends: 300 [2018-10-04 12:37:15,049 INFO L226 Difference]: Without dead ends: 299 [2018-10-04 12:37:15,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10202 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10680, Invalid=21182, Unknown=0, NotChecked=0, Total=31862 [2018-10-04 12:37:15,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-10-04 12:37:15,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2018-10-04 12:37:15,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-10-04 12:37:15,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2018-10-04 12:37:15,120 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 290 [2018-10-04 12:37:15,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:37:15,120 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2018-10-04 12:37:15,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-10-04 12:37:15,120 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2018-10-04 12:37:15,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-10-04 12:37:15,122 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:37:15,122 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1] [2018-10-04 12:37:15,122 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:37:15,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:37:15,122 INFO L82 PathProgramCache]: Analyzing trace with hash 979207043, now seen corresponding path program 58 times [2018-10-04 12:37:15,123 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:37:15,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:37:15,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:15,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:37:15,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:16,988 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:16,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:16,988 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:37:16,999 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:37:17,196 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:37:17,197 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:37:17,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:17,208 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,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:37:17,216 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,216 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:37:19,638 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:19,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:19,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 120 [2018-10-04 12:37:19,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-10-04 12:37:19,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-10-04 12:37:19,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5433, Invalid=9329, Unknown=0, NotChecked=0, Total=14762 [2018-10-04 12:37:19,661 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 122 states. [2018-10-04 12:37:23,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:37:23,160 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-10-04 12:37:23,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-04 12:37:23,160 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 295 [2018-10-04 12:37:23,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:37:23,162 INFO L225 Difference]: With dead ends: 305 [2018-10-04 12:37:23,162 INFO L226 Difference]: Without dead ends: 304 [2018-10-04 12:37:23,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10555 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=11041, Invalid=21901, Unknown=0, NotChecked=0, Total=32942 [2018-10-04 12:37:23,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-10-04 12:37:23,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2018-10-04 12:37:23,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-04 12:37:23,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-10-04 12:37:23,232 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 295 [2018-10-04 12:37:23,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:37:23,232 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-10-04 12:37:23,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-10-04 12:37:23,232 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-10-04 12:37:23,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-10-04 12:37:23,233 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:37:23,234 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1] [2018-10-04 12:37:23,234 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:37:23,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:37:23,234 INFO L82 PathProgramCache]: Analyzing trace with hash 619297395, now seen corresponding path program 59 times [2018-10-04 12:37:23,234 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:37:23,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:37:23,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:23,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:37:23,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:25,099 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:25,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:25,099 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:37:25,107 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:37:25,511 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-10-04 12:37:25,511 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:37:25,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:25,527 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:25,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:37:25,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:37:25,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:37:27,771 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:27,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:27,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 122 [2018-10-04 12:37:27,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-10-04 12:37:27,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-10-04 12:37:27,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5615, Invalid=9637, Unknown=0, NotChecked=0, Total=15252 [2018-10-04 12:37:27,794 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 124 states. [2018-10-04 12:37:31,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:37:31,415 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2018-10-04 12:37:31,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-04 12:37:31,415 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 300 [2018-10-04 12:37:31,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:37:31,417 INFO L225 Difference]: With dead ends: 310 [2018-10-04 12:37:31,417 INFO L226 Difference]: Without dead ends: 309 [2018-10-04 12:37:31,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10914 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=11408, Invalid=22632, Unknown=0, NotChecked=0, Total=34040 [2018-10-04 12:37:31,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-10-04 12:37:31,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2018-10-04 12:37:31,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-10-04 12:37:31,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2018-10-04 12:37:31,488 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 300 [2018-10-04 12:37:31,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:37:31,488 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 306 transitions. [2018-10-04 12:37:31,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-10-04 12:37:31,488 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 306 transitions. [2018-10-04 12:37:31,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-10-04 12:37:31,489 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:37:31,489 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1] [2018-10-04 12:37:31,490 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:37:31,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:37:31,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1323673213, now seen corresponding path program 60 times [2018-10-04 12:37:31,490 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:37:31,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:37:31,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:31,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:37:31,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:33,471 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:33,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:33,471 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:37:33,479 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:37:33,961 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-10-04 12:37:33,962 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:37:33,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:33,975 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:33,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:37:33,985 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:33,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 Received shutdown request... [2018-10-04 12:37:35,270 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-04 12:37:35,471 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:37:35,472 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 12:37:35,478 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 12:37:35,478 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:37:35 BoogieIcfgContainer [2018-10-04 12:37:35,478 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:37:35,479 INFO L168 Benchmark]: Toolchain (without parser) took 238757.84 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: -1.3 GB). Peak memory consumption was 690.3 MB. Max. memory is 7.1 GB. [2018-10-04 12:37:35,479 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.27 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,480 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.97 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,486 INFO L168 Benchmark]: Boogie Preprocessor took 23.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,486 INFO L168 Benchmark]: RCFGBuilder took 421.39 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,486 INFO L168 Benchmark]: TraceAbstraction took 238248.45 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 669.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:37:35,490 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.27 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 58.97 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 23.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. * RCFGBuilder took 421.39 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 238248.45 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 669.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that procedure precondition always holds and assertion always holds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 306 with TraceHistMax 61, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 110 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that procedure precondition always holds and assertion always holds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 306 with TraceHistMax 61, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 110 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 2 error locations. TIMEOUT Result, 238.1s OverallTime, 63 OverallIterations, 61 TraceHistogramMax, 98.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 143 SDtfs, 10665 SDslu, 197 SDs, 0 SdLazy, 16677 SolverSat, 5351 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12872 GetRequests, 7200 SyntacticMatches, 0 SemanticMatches, 5672 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224732 ImplicationChecksByTransitivity, 176.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=306occurred in iteration=62, 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: 1.8s AutomataMinimizationTime, 62 MinimizatonAttempts, 185 StatesRemovedByMinimization, 61 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.5s SsaConstructionTime, 9.4s SatisfiabilityAnalysisTime, 117.8s InterpolantComputationTime, 18307 NumberOfCodeBlocks, 18307 NumberOfCodeBlocksAsserted, 1031 NumberOfCheckSat, 18186 ConstructedInterpolants, 0 QuantifiedInterpolants, 29486531 SizeOfPredicates, 639 NumberOfNonLiveVariables, 39176 ConjunctsInSsa, 6411 ConjunctsInUnsatCore, 121 InterpolantComputations, 3 PerfectInterpolantSequences, 2/356362 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-simplified01.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-37-35-503.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified01.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-37-35-503.csv Completed graceful shutdown