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_PUPT.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:58:04,892 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:58:04,894 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:58:04,906 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:58:04,906 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:58:04,907 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:58:04,908 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:58:04,910 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:58:04,912 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:58:04,912 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:58:04,913 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:58:04,914 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:58:04,914 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:58:04,915 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:58:04,920 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:58:04,921 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:58:04,922 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:58:04,925 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:58:04,930 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:58:04,931 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:58:04,934 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:58:04,935 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:58:04,939 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:58:04,939 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:58:04,939 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:58:04,940 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:58:04,941 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:58:04,942 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:58:04,943 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:58:04,944 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:58:04,945 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:58:04,945 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:58:04,947 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:58:04,947 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:58:04,948 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:58:04,949 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:58:04,949 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-01 00:58:04,978 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:58:04,978 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:58:04,979 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:58:04,982 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:58:04,983 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:58:04,983 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:58:04,983 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:58:04,984 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:58:04,984 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:58:04,984 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:58:04,984 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:58:04,984 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:58:04,986 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:58:04,986 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:58:04,986 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:58:04,986 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:58:04,987 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:58:04,987 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:58:04,988 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:58:04,988 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:58:04,988 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:58:04,988 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:58:04,988 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:58:04,989 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:58:04,989 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:58:04,989 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:58:04,989 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:58:04,990 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:58:04,990 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:58:04,990 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:58:04,990 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:58:05,039 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:58:05,054 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:58:05,060 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:58:05,061 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:58:05,062 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:58:05,062 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl [2018-10-01 00:58:05,063 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl' [2018-10-01 00:58:05,106 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:58:05,109 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:58:05,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:58:05,110 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:58:05,110 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:58:05,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:58:05" (1/1) ... [2018-10-01 00:58:05,141 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:58:05" (1/1) ... [2018-10-01 00:58:05,146 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-01 00:58:05,146 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-01 00:58:05,146 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-01 00:58:05,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:58:05,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:58:05,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:58:05,149 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:58:05,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:58:05" (1/1) ... [2018-10-01 00:58:05,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:58:05" (1/1) ... [2018-10-01 00:58:05,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:58:05" (1/1) ... [2018-10-01 00:58:05,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:58:05" (1/1) ... [2018-10-01 00:58:05,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:58:05" (1/1) ... [2018-10-01 00:58:05,167 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:58:05" (1/1) ... [2018-10-01 00:58:05,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:58:05" (1/1) ... [2018-10-01 00:58:05,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:58:05,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:58:05,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:58:05,170 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:58:05,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:58:05" (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-01 00:58:05,238 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-10-01 00:58:05,238 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-01 00:58:05,239 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-01 00:58:05,508 INFO L345 CfgBuilder]: Using library mode [2018-10-01 00:58:05,509 INFO L202 PluginConnector]: Adding new model BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:58:05 BoogieIcfgContainer [2018-10-01 00:58:05,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:58:05,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:58:05,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:58:05,514 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:58:05,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:58:05" (1/2) ... [2018-10-01 00:58:05,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76b75a99 and model type BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:58:05, skipping insertion in model container [2018-10-01 00:58:05,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:58:05" (2/2) ... [2018-10-01 00:58:05,518 INFO L112 eAbstractionObserver]: Analyzing ICFG BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl [2018-10-01 00:58:05,528 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:58:05,537 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-10-01 00:58:05,578 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:58:05,579 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:58:05,579 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:58:05,579 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:58:05,579 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:58:05,579 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:58:05,579 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:58:05,579 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:58:05,580 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:58:05,594 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-10-01 00:58:05,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-01 00:58:05,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:05,601 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-01 00:58:05,602 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:05,608 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:05,609 INFO L82 PathProgramCache]: Analyzing trace with hash 30176, now seen corresponding path program 1 times [2018-10-01 00:58:05,611 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:05,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:05,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:05,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:58:05,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:05,738 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-01 00:58:05,740 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:58:05,740 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:58:05,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:58:05,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:58:05,758 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:05,760 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-10-01 00:58:06,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:06,017 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2018-10-01 00:58:06,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:58:06,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-01 00:58:06,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:06,030 INFO L225 Difference]: With dead ends: 19 [2018-10-01 00:58:06,031 INFO L226 Difference]: Without dead ends: 9 [2018-10-01 00:58:06,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:58:06,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-01 00:58:06,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-01 00:58:06,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-01 00:58:06,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-10-01 00:58:06,065 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 3 [2018-10-01 00:58:06,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:06,065 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-10-01 00:58:06,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:58:06,066 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-10-01 00:58:06,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-01 00:58:06,066 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:06,066 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-01 00:58:06,066 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:06,067 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:06,067 INFO L82 PathProgramCache]: Analyzing trace with hash 28755427, now seen corresponding path program 1 times [2018-10-01 00:58:06,067 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:06,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:06,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:06,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:58:06,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:06,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:06,134 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:06,134 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-01 00:58:06,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:58:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:06,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:06,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:06,261 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-01 00:58:06,261 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2018-10-01 00:58:06,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:58:06,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:58:06,262 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:06,262 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2018-10-01 00:58:06,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:06,367 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2018-10-01 00:58:06,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:58:06,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-01 00:58:06,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:06,369 INFO L225 Difference]: With dead ends: 19 [2018-10-01 00:58:06,369 INFO L226 Difference]: Without dead ends: 13 [2018-10-01 00:58:06,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:58:06,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-01 00:58:06,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-10-01 00:58:06,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-01 00:58:06,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-10-01 00:58:06,374 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 5 [2018-10-01 00:58:06,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:06,374 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-10-01 00:58:06,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:58:06,374 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-10-01 00:58:06,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:58:06,375 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:06,375 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-10-01 00:58:06,376 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:06,376 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:06,376 INFO L82 PathProgramCache]: Analyzing trace with hash 223461163, now seen corresponding path program 1 times [2018-10-01 00:58:06,376 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:06,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:06,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:06,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:58:06,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:06,494 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:06,494 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:06,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 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-01 00:58:06,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:58:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:06,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:06,639 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:06,672 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:06,672 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-01 00:58:06,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:58:06,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:58:06,673 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:06,673 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 5 states. [2018-10-01 00:58:06,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:06,933 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-10-01 00:58:06,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:58:06,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-10-01 00:58:06,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:06,936 INFO L225 Difference]: With dead ends: 21 [2018-10-01 00:58:06,936 INFO L226 Difference]: Without dead ends: 14 [2018-10-01 00:58:06,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:58:06,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-01 00:58:06,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-01 00:58:06,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-01 00:58:06,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-10-01 00:58:06,941 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2018-10-01 00:58:06,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:06,941 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-10-01 00:58:06,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:58:06,941 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-10-01 00:58:06,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-01 00:58:06,942 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:06,942 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-01 00:58:06,942 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:06,943 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:06,943 INFO L82 PathProgramCache]: Analyzing trace with hash -4275986, now seen corresponding path program 2 times [2018-10-01 00:58:06,943 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:06,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:06,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:06,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:58:06,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:07,019 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:07,019 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:07,020 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-01 00:58:07,029 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:58:07,043 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:58:07,043 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:07,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:07,086 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:07,107 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:07,107 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-01 00:58:07,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-01 00:58:07,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-01 00:58:07,108 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:07,108 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 6 states. [2018-10-01 00:58:07,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:07,226 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-10-01 00:58:07,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-01 00:58:07,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-10-01 00:58:07,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:07,227 INFO L225 Difference]: With dead ends: 23 [2018-10-01 00:58:07,228 INFO L226 Difference]: Without dead ends: 16 [2018-10-01 00:58:07,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:58:07,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-01 00:58:07,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-01 00:58:07,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-01 00:58:07,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-10-01 00:58:07,232 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2018-10-01 00:58:07,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:07,233 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-10-01 00:58:07,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-01 00:58:07,233 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-10-01 00:58:07,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 00:58:07,234 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:07,234 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-01 00:58:07,234 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:07,235 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:07,235 INFO L82 PathProgramCache]: Analyzing trace with hash 183655921, now seen corresponding path program 3 times [2018-10-01 00:58:07,235 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:07,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:07,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:07,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:07,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:07,394 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:07,395 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:07,395 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01 00:58:07,403 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:58:07,410 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-01 00:58:07,410 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:07,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:07,441 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-01 00:58:07,463 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:07,463 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2018-10-01 00:58:07,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:58:07,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:58:07,464 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:07,465 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 9 states. [2018-10-01 00:58:08,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:08,129 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-10-01 00:58:08,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-01 00:58:08,130 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-10-01 00:58:08,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:08,133 INFO L225 Difference]: With dead ends: 28 [2018-10-01 00:58:08,134 INFO L226 Difference]: Without dead ends: 21 [2018-10-01 00:58:08,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:58:08,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-01 00:58:08,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-10-01 00:58:08,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-01 00:58:08,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-10-01 00:58:08,139 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 13 [2018-10-01 00:58:08,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:08,139 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-10-01 00:58:08,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:58:08,139 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-10-01 00:58:08,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-01 00:58:08,140 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:08,140 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-01 00:58:08,140 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:08,141 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:08,141 INFO L82 PathProgramCache]: Analyzing trace with hash -166307655, now seen corresponding path program 4 times [2018-10-01 00:58:08,141 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:08,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:08,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:08,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:08,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:08,238 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:58:08,239 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:08,239 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-01 00:58:08,251 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:58:08,260 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:58:08,261 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:08,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:08,364 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:58:08,385 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:08,385 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-01 00:58:08,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:58:08,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:58:08,386 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:08,386 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 8 states. [2018-10-01 00:58:08,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:08,509 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-10-01 00:58:08,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-01 00:58:08,509 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-10-01 00:58:08,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:08,510 INFO L225 Difference]: With dead ends: 31 [2018-10-01 00:58:08,510 INFO L226 Difference]: Without dead ends: 22 [2018-10-01 00:58:08,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:58:08,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-01 00:58:08,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-01 00:58:08,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-01 00:58:08,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-10-01 00:58:08,515 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 17 [2018-10-01 00:58:08,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:08,516 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-10-01 00:58:08,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:58:08,516 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-10-01 00:58:08,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-01 00:58:08,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:08,517 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-01 00:58:08,517 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:08,517 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:08,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1611851644, now seen corresponding path program 5 times [2018-10-01 00:58:08,518 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:08,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:08,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:08,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:08,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:08,644 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:58:08,645 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:08,645 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-01 00:58:08,655 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:58:08,669 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-01 00:58:08,669 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:08,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:08,735 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:58:08,758 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:08,758 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-01 00:58:08,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:58:08,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:58:08,759 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:08,759 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 9 states. [2018-10-01 00:58:08,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:08,918 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-10-01 00:58:08,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-01 00:58:08,920 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-10-01 00:58:08,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:08,921 INFO L225 Difference]: With dead ends: 33 [2018-10-01 00:58:08,921 INFO L226 Difference]: Without dead ends: 24 [2018-10-01 00:58:08,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:58:08,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-01 00:58:08,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-01 00:58:08,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-01 00:58:08,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-10-01 00:58:08,927 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 19 [2018-10-01 00:58:08,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:08,927 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-10-01 00:58:08,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:58:08,928 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-10-01 00:58:08,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-01 00:58:08,928 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:08,929 INFO L375 BasicCegarLoop]: trace histogram [9, 7, 2, 1, 1, 1] [2018-10-01 00:58:08,929 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:08,929 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:08,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1025954175, now seen corresponding path program 6 times [2018-10-01 00:58:08,929 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:08,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:08,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:08,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:08,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:58:09,130 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:09,131 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:58:09,139 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:58:09,153 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-10-01 00:58:09,153 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:09,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:09,273 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 17 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:09,298 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:09,298 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2018-10-01 00:58:09,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-01 00:58:09,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-01 00:58:09,299 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:09,299 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 19 states. [2018-10-01 00:58:09,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:09,880 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2018-10-01 00:58:09,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-01 00:58:09,881 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2018-10-01 00:58:09,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:09,883 INFO L225 Difference]: With dead ends: 50 [2018-10-01 00:58:09,883 INFO L226 Difference]: Without dead ends: 41 [2018-10-01 00:58:09,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:58:09,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-01 00:58:09,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-10-01 00:58:09,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-01 00:58:09,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2018-10-01 00:58:09,890 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 21 [2018-10-01 00:58:09,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:09,890 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2018-10-01 00:58:09,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-01 00:58:09,890 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2018-10-01 00:58:09,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-01 00:58:09,891 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:09,891 INFO L375 BasicCegarLoop]: trace histogram [17, 9, 8, 1, 1, 1] [2018-10-01 00:58:09,892 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:09,892 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:09,892 INFO L82 PathProgramCache]: Analyzing trace with hash -509505115, now seen corresponding path program 7 times [2018-10-01 00:58:09,892 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:09,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:09,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:09,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:09,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:10,006 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 72 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-01 00:58:10,006 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:10,006 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-01 00:58:10,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:58:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:10,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 72 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-01 00:58:10,113 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:10,114 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-01 00:58:10,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-01 00:58:10,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-01 00:58:10,114 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:10,115 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand 11 states. [2018-10-01 00:58:10,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:10,278 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2018-10-01 00:58:10,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-01 00:58:10,287 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-10-01 00:58:10,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:10,288 INFO L225 Difference]: With dead ends: 65 [2018-10-01 00:58:10,288 INFO L226 Difference]: Without dead ends: 42 [2018-10-01 00:58:10,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:58:10,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-01 00:58:10,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-10-01 00:58:10,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-01 00:58:10,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2018-10-01 00:58:10,297 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 37 [2018-10-01 00:58:10,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:10,299 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2018-10-01 00:58:10,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-01 00:58:10,299 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2018-10-01 00:58:10,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-01 00:58:10,300 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:10,300 INFO L375 BasicCegarLoop]: trace histogram [18, 9, 9, 1, 1, 1] [2018-10-01 00:58:10,301 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:10,301 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:10,301 INFO L82 PathProgramCache]: Analyzing trace with hash -431087384, now seen corresponding path program 8 times [2018-10-01 00:58:10,301 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:10,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:10,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:10,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:58:10,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:10,492 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 170 proven. 90 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-01 00:58:10,492 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:10,493 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-01 00:58:10,507 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:58:10,536 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:58:10,537 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:10,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:10,609 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 170 proven. 90 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-01 00:58:10,629 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:10,629 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-01 00:58:10,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-01 00:58:10,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-01 00:58:10,630 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:10,630 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 12 states. [2018-10-01 00:58:10,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:10,779 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2018-10-01 00:58:10,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-01 00:58:10,780 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-10-01 00:58:10,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:10,783 INFO L225 Difference]: With dead ends: 67 [2018-10-01 00:58:10,783 INFO L226 Difference]: Without dead ends: 44 [2018-10-01 00:58:10,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:58:10,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-01 00:58:10,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-01 00:58:10,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-01 00:58:10,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-10-01 00:58:10,790 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 39 [2018-10-01 00:58:10,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:10,790 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-10-01 00:58:10,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-01 00:58:10,791 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-10-01 00:58:10,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-01 00:58:10,792 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:10,792 INFO L375 BasicCegarLoop]: trace histogram [19, 10, 9, 1, 1, 1] [2018-10-01 00:58:10,792 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:10,793 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:10,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1913908075, now seen corresponding path program 9 times [2018-10-01 00:58:10,793 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:10,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:10,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:10,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:10,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:10,924 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 187 proven. 110 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-01 00:58:10,925 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:10,925 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-01 00:58:10,934 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:58:10,964 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-10-01 00:58:10,964 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:10,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:11,270 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 37 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:11,291 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:11,291 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21] total 32 [2018-10-01 00:58:11,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-01 00:58:11,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-01 00:58:11,293 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:11,293 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 32 states. [2018-10-01 00:58:11,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:11,975 INFO L93 Difference]: Finished difference Result 90 states and 130 transitions. [2018-10-01 00:58:11,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-01 00:58:11,975 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 41 [2018-10-01 00:58:11,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:11,977 INFO L225 Difference]: With dead ends: 90 [2018-10-01 00:58:11,977 INFO L226 Difference]: Without dead ends: 67 [2018-10-01 00:58:11,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:58:11,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-01 00:58:11,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-10-01 00:58:11,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-01 00:58:11,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2018-10-01 00:58:11,985 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 85 transitions. Word has length 41 [2018-10-01 00:58:11,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:11,985 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 85 transitions. [2018-10-01 00:58:11,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-01 00:58:11,986 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2018-10-01 00:58:11,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-01 00:58:11,987 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:11,987 INFO L375 BasicCegarLoop]: trace histogram [30, 19, 11, 1, 1, 1] [2018-10-01 00:58:11,988 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:11,988 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:11,988 INFO L82 PathProgramCache]: Analyzing trace with hash -2050603744, now seen corresponding path program 10 times [2018-10-01 00:58:11,988 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:11,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:11,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:11,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:11,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:12,345 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 444 proven. 132 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-10-01 00:58:12,345 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:12,345 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-01 00:58:12,356 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:58:12,411 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:58:12,412 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:12,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:12,808 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 444 proven. 132 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-10-01 00:58:12,836 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:12,836 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-01 00:58:12,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:58:12,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:58:12,837 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:12,837 INFO L87 Difference]: Start difference. First operand 66 states and 85 transitions. Second operand 14 states. [2018-10-01 00:58:13,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:13,016 INFO L93 Difference]: Finished difference Result 111 states and 150 transitions. [2018-10-01 00:58:13,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-01 00:58:13,017 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2018-10-01 00:58:13,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:13,018 INFO L225 Difference]: With dead ends: 111 [2018-10-01 00:58:13,019 INFO L226 Difference]: Without dead ends: 68 [2018-10-01 00:58:13,019 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:58:13,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-01 00:58:13,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-10-01 00:58:13,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-01 00:58:13,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2018-10-01 00:58:13,027 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 63 [2018-10-01 00:58:13,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:13,027 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2018-10-01 00:58:13,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:58:13,027 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2018-10-01 00:58:13,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-01 00:58:13,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:13,029 INFO L375 BasicCegarLoop]: trace histogram [31, 19, 12, 1, 1, 1] [2018-10-01 00:58:13,029 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:13,029 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:13,029 INFO L82 PathProgramCache]: Analyzing trace with hash 335902371, now seen corresponding path program 11 times [2018-10-01 00:58:13,029 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:13,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:13,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:13,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:13,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 481 proven. 156 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-10-01 00:58:13,158 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:13,158 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-01 00:58:13,166 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:58:13,208 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2018-10-01 00:58:13,208 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:13,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:13,598 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 481 proven. 156 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-10-01 00:58:13,621 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:13,621 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-01 00:58:13,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-01 00:58:13,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-01 00:58:13,622 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:13,622 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand 15 states. [2018-10-01 00:58:13,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:13,926 INFO L93 Difference]: Finished difference Result 113 states and 152 transitions. [2018-10-01 00:58:13,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:58:13,927 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2018-10-01 00:58:13,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:13,927 INFO L225 Difference]: With dead ends: 113 [2018-10-01 00:58:13,928 INFO L226 Difference]: Without dead ends: 70 [2018-10-01 00:58:13,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:58:13,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-01 00:58:13,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-10-01 00:58:13,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-01 00:58:13,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2018-10-01 00:58:13,935 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 65 [2018-10-01 00:58:13,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:13,935 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2018-10-01 00:58:13,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-01 00:58:13,936 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2018-10-01 00:58:13,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-01 00:58:13,937 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:13,937 INFO L375 BasicCegarLoop]: trace histogram [32, 19, 13, 1, 1, 1] [2018-10-01 00:58:13,937 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:13,937 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:13,937 INFO L82 PathProgramCache]: Analyzing trace with hash 255742822, now seen corresponding path program 12 times [2018-10-01 00:58:13,938 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:13,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:13,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:13,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:13,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:14,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 518 proven. 182 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-10-01 00:58:14,170 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:14,170 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-01 00:58:14,179 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:58:14,217 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) [2018-10-01 00:58:14,218 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:14,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:14,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 507 proven. 361 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-10-01 00:58:14,442 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:14,442 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22] total 36 [2018-10-01 00:58:14,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-01 00:58:14,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-01 00:58:14,443 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:14,443 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand 36 states. [2018-10-01 00:58:15,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:15,120 INFO L93 Difference]: Finished difference Result 118 states and 160 transitions. [2018-10-01 00:58:15,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-01 00:58:15,121 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 67 [2018-10-01 00:58:15,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:15,121 INFO L225 Difference]: With dead ends: 118 [2018-10-01 00:58:15,122 INFO L226 Difference]: Without dead ends: 75 [2018-10-01 00:58:15,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:58:15,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-01 00:58:15,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-10-01 00:58:15,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-01 00:58:15,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2018-10-01 00:58:15,129 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 67 [2018-10-01 00:58:15,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:15,130 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2018-10-01 00:58:15,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-01 00:58:15,130 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2018-10-01 00:58:15,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-01 00:58:15,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:15,131 INFO L375 BasicCegarLoop]: trace histogram [34, 20, 14, 1, 1, 1] [2018-10-01 00:58:15,131 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:15,132 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:15,132 INFO L82 PathProgramCache]: Analyzing trace with hash -15063890, now seen corresponding path program 13 times [2018-10-01 00:58:15,132 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:15,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:15,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:15,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:15,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:15,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 585 proven. 210 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-01 00:58:15,264 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:15,264 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01 00:58:15,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:58:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:15,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:16,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 585 proven. 210 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-01 00:58:16,113 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:16,114 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-01 00:58:16,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-01 00:58:16,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-01 00:58:16,114 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:16,115 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 17 states. [2018-10-01 00:58:16,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:16,241 INFO L93 Difference]: Finished difference Result 121 states and 162 transitions. [2018-10-01 00:58:16,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:58:16,241 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 71 [2018-10-01 00:58:16,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:16,242 INFO L225 Difference]: With dead ends: 121 [2018-10-01 00:58:16,242 INFO L226 Difference]: Without dead ends: 76 [2018-10-01 00:58:16,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:58:16,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-01 00:58:16,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-10-01 00:58:16,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-01 00:58:16,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 96 transitions. [2018-10-01 00:58:16,249 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 96 transitions. Word has length 71 [2018-10-01 00:58:16,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:16,249 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 96 transitions. [2018-10-01 00:58:16,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-01 00:58:16,249 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2018-10-01 00:58:16,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-01 00:58:16,250 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:16,251 INFO L375 BasicCegarLoop]: trace histogram [35, 20, 15, 1, 1, 1] [2018-10-01 00:58:16,251 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:16,251 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:16,251 INFO L82 PathProgramCache]: Analyzing trace with hash -694344911, now seen corresponding path program 14 times [2018-10-01 00:58:16,251 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:16,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:16,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:16,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:58:16,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:16,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 624 proven. 240 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-01 00:58:16,494 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:16,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 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-01 00:58:16,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:58:16,539 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:58:16,540 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:16,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:16,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 624 proven. 240 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-01 00:58:16,671 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:16,671 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-01 00:58:16,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-01 00:58:16,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-01 00:58:16,672 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:16,672 INFO L87 Difference]: Start difference. First operand 76 states and 96 transitions. Second operand 18 states. [2018-10-01 00:58:16,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:16,863 INFO L93 Difference]: Finished difference Result 123 states and 164 transitions. [2018-10-01 00:58:16,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-01 00:58:16,863 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 73 [2018-10-01 00:58:16,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:16,865 INFO L225 Difference]: With dead ends: 123 [2018-10-01 00:58:16,865 INFO L226 Difference]: Without dead ends: 78 [2018-10-01 00:58:16,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:58:16,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-01 00:58:16,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-10-01 00:58:16,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-01 00:58:16,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 98 transitions. [2018-10-01 00:58:16,871 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 98 transitions. Word has length 73 [2018-10-01 00:58:16,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:16,872 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 98 transitions. [2018-10-01 00:58:16,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-01 00:58:16,872 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 98 transitions. [2018-10-01 00:58:16,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-01 00:58:16,873 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:16,873 INFO L375 BasicCegarLoop]: trace histogram [36, 20, 16, 1, 1, 1] [2018-10-01 00:58:16,874 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:16,874 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:16,874 INFO L82 PathProgramCache]: Analyzing trace with hash -648377100, now seen corresponding path program 15 times [2018-10-01 00:58:16,874 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:16,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:16,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:16,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:16,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:17,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 663 proven. 272 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-01 00:58:17,102 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:17,102 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-01 00:58:17,111 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:58:17,155 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-10-01 00:58:17,155 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:17,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:17,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 663 proven. 272 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-01 00:58:17,355 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:17,355 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-01 00:58:17,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-01 00:58:17,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-01 00:58:17,356 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:17,356 INFO L87 Difference]: Start difference. First operand 78 states and 98 transitions. Second operand 19 states. [2018-10-01 00:58:17,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:17,522 INFO L93 Difference]: Finished difference Result 125 states and 166 transitions. [2018-10-01 00:58:17,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-01 00:58:17,523 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2018-10-01 00:58:17,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:17,524 INFO L225 Difference]: With dead ends: 125 [2018-10-01 00:58:17,524 INFO L226 Difference]: Without dead ends: 80 [2018-10-01 00:58:17,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:58:17,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-01 00:58:17,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-10-01 00:58:17,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-01 00:58:17,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2018-10-01 00:58:17,531 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 75 [2018-10-01 00:58:17,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:17,531 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2018-10-01 00:58:17,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-01 00:58:17,531 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2018-10-01 00:58:17,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-01 00:58:17,532 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:17,533 INFO L375 BasicCegarLoop]: trace histogram [37, 20, 17, 1, 1, 1] [2018-10-01 00:58:17,533 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:17,533 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:17,533 INFO L82 PathProgramCache]: Analyzing trace with hash 577016311, now seen corresponding path program 16 times [2018-10-01 00:58:17,533 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:17,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:17,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:17,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:17,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:17,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 702 proven. 306 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-01 00:58:17,854 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:17,854 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-01 00:58:17,872 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:58:17,902 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:58:17,903 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:17,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:18,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 702 proven. 306 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-01 00:58:18,639 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:18,639 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-01 00:58:18,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-01 00:58:18,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-01 00:58:18,640 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:18,640 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand 20 states. [2018-10-01 00:58:19,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:19,238 INFO L93 Difference]: Finished difference Result 127 states and 168 transitions. [2018-10-01 00:58:19,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-01 00:58:19,239 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 77 [2018-10-01 00:58:19,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:19,240 INFO L225 Difference]: With dead ends: 127 [2018-10-01 00:58:19,240 INFO L226 Difference]: Without dead ends: 82 [2018-10-01 00:58:19,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:58:19,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-01 00:58:19,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-10-01 00:58:19,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-01 00:58:19,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 102 transitions. [2018-10-01 00:58:19,246 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 102 transitions. Word has length 77 [2018-10-01 00:58:19,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:19,247 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 102 transitions. [2018-10-01 00:58:19,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-01 00:58:19,247 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions. [2018-10-01 00:58:19,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-01 00:58:19,248 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:19,248 INFO L375 BasicCegarLoop]: trace histogram [38, 20, 18, 1, 1, 1] [2018-10-01 00:58:19,248 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:19,249 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:19,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1359045178, now seen corresponding path program 17 times [2018-10-01 00:58:19,249 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:19,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:19,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:19,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:19,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:19,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:19,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 342 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-01 00:58:19,444 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:19,444 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-01 00:58:19,452 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:58:19,582 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 39 check-sat command(s) [2018-10-01 00:58:19,582 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:19,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 342 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-01 00:58:19,832 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:19,833 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-01 00:58:19,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-01 00:58:19,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-01 00:58:19,833 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:19,834 INFO L87 Difference]: Start difference. First operand 82 states and 102 transitions. Second operand 21 states. [2018-10-01 00:58:20,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:20,162 INFO L93 Difference]: Finished difference Result 129 states and 170 transitions. [2018-10-01 00:58:20,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-01 00:58:20,162 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 79 [2018-10-01 00:58:20,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:20,164 INFO L225 Difference]: With dead ends: 129 [2018-10-01 00:58:20,164 INFO L226 Difference]: Without dead ends: 84 [2018-10-01 00:58:20,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:58:20,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-01 00:58:20,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-10-01 00:58:20,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-01 00:58:20,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 104 transitions. [2018-10-01 00:58:20,170 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 104 transitions. Word has length 79 [2018-10-01 00:58:20,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:20,170 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 104 transitions. [2018-10-01 00:58:20,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-01 00:58:20,171 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2018-10-01 00:58:20,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-01 00:58:20,172 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:20,172 INFO L375 BasicCegarLoop]: trace histogram [39, 20, 19, 1, 1, 1] [2018-10-01 00:58:20,172 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:20,172 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:20,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1269509565, now seen corresponding path program 18 times [2018-10-01 00:58:20,173 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:20,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:20,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:20,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:20,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:20,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 780 proven. 380 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-01 00:58:20,844 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:20,844 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01 00:58:20,853 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:58:20,896 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) [2018-10-01 00:58:20,896 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:20,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 779 proven. 400 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-10-01 00:58:21,113 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:21,113 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 43 [2018-10-01 00:58:21,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-01 00:58:21,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-01 00:58:21,114 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:21,114 INFO L87 Difference]: Start difference. First operand 84 states and 104 transitions. Second operand 43 states. [2018-10-01 00:58:21,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:21,752 INFO L93 Difference]: Finished difference Result 134 states and 178 transitions. [2018-10-01 00:58:21,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-01 00:58:21,752 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 81 [2018-10-01 00:58:21,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:21,753 INFO L225 Difference]: With dead ends: 134 [2018-10-01 00:58:21,753 INFO L226 Difference]: Without dead ends: 89 [2018-10-01 00:58:21,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:58:21,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-01 00:58:21,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-10-01 00:58:21,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-01 00:58:21,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2018-10-01 00:58:21,757 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 81 [2018-10-01 00:58:21,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:21,758 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2018-10-01 00:58:21,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-01 00:58:21,758 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2018-10-01 00:58:21,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-01 00:58:21,759 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:21,764 INFO L375 BasicCegarLoop]: trace histogram [41, 21, 20, 1, 1, 1] [2018-10-01 00:58:21,765 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:21,765 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:21,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1080732667, now seen corresponding path program 19 times [2018-10-01 00:58:21,765 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:21,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:21,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:21,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:21,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:22,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 420 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-10-01 00:58:22,159 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:22,159 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-01 00:58:22,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:58:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:22,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:22,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 420 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-10-01 00:58:22,287 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:22,287 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-01 00:58:22,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-01 00:58:22,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-01 00:58:22,288 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:22,288 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand 23 states. [2018-10-01 00:58:22,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:22,443 INFO L93 Difference]: Finished difference Result 137 states and 180 transitions. [2018-10-01 00:58:22,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-01 00:58:22,445 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 85 [2018-10-01 00:58:22,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:22,446 INFO L225 Difference]: With dead ends: 137 [2018-10-01 00:58:22,446 INFO L226 Difference]: Without dead ends: 90 [2018-10-01 00:58:22,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:58:22,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-01 00:58:22,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-10-01 00:58:22,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-01 00:58:22,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2018-10-01 00:58:22,451 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 85 [2018-10-01 00:58:22,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:22,451 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2018-10-01 00:58:22,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-01 00:58:22,451 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2018-10-01 00:58:22,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-01 00:58:22,452 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:22,452 INFO L375 BasicCegarLoop]: trace histogram [42, 21, 21, 1, 1, 1] [2018-10-01 00:58:22,452 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:22,452 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:22,452 INFO L82 PathProgramCache]: Analyzing trace with hash -95735480, now seen corresponding path program 20 times [2018-10-01 00:58:22,453 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:22,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:22,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:22,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:58:22,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:22,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 902 proven. 462 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-10-01 00:58:22,643 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:22,643 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-01 00:58:22,650 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:58:22,678 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:58:22,679 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:22,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:22,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 902 proven. 462 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-10-01 00:58:22,899 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:22,899 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-01 00:58:22,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-01 00:58:22,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-01 00:58:22,900 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:22,900 INFO L87 Difference]: Start difference. First operand 90 states and 111 transitions. Second operand 24 states. [2018-10-01 00:58:23,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:23,120 INFO L93 Difference]: Finished difference Result 139 states and 182 transitions. [2018-10-01 00:58:23,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-01 00:58:23,123 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 87 [2018-10-01 00:58:23,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:23,124 INFO L225 Difference]: With dead ends: 139 [2018-10-01 00:58:23,124 INFO L226 Difference]: Without dead ends: 92 [2018-10-01 00:58:23,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:58:23,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-01 00:58:23,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-10-01 00:58:23,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-01 00:58:23,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 113 transitions. [2018-10-01 00:58:23,128 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 113 transitions. Word has length 87 [2018-10-01 00:58:23,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:23,129 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 113 transitions. [2018-10-01 00:58:23,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-01 00:58:23,129 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 113 transitions. [2018-10-01 00:58:23,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-01 00:58:23,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:23,130 INFO L375 BasicCegarLoop]: trace histogram [43, 22, 21, 1, 1, 1] [2018-10-01 00:58:23,130 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:23,130 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:23,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1593756107, now seen corresponding path program 21 times [2018-10-01 00:58:23,130 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:23,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:23,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:23,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:23,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 943 proven. 506 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-10-01 00:58:23,329 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:23,329 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-01 00:58:23,336 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:58:23,383 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-10-01 00:58:23,383 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:23,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:23,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 85 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:23,789 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:23,790 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 45] total 68 [2018-10-01 00:58:23,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-01 00:58:23,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-01 00:58:23,791 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:23,791 INFO L87 Difference]: Start difference. First operand 92 states and 113 transitions. Second operand 68 states. [2018-10-01 00:58:25,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:25,197 INFO L93 Difference]: Finished difference Result 186 states and 274 transitions. [2018-10-01 00:58:25,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-01 00:58:25,197 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 89 [2018-10-01 00:58:25,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:25,199 INFO L225 Difference]: With dead ends: 186 [2018-10-01 00:58:25,199 INFO L226 Difference]: Without dead ends: 139 [2018-10-01 00:58:25,199 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:58:25,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-01 00:58:25,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2018-10-01 00:58:25,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-10-01 00:58:25,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 181 transitions. [2018-10-01 00:58:25,204 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 181 transitions. Word has length 89 [2018-10-01 00:58:25,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:25,204 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 181 transitions. [2018-10-01 00:58:25,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-01 00:58:25,205 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 181 transitions. [2018-10-01 00:58:25,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-01 00:58:25,205 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:25,205 INFO L375 BasicCegarLoop]: trace histogram [66, 43, 23, 1, 1, 1] [2018-10-01 00:58:25,206 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:25,206 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:25,206 INFO L82 PathProgramCache]: Analyzing trace with hash 2117767484, now seen corresponding path program 22 times [2018-10-01 00:58:25,206 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:25,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:25,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:25,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:25,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:25,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2040 proven. 552 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2018-10-01 00:58:25,482 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:25,482 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-01 00:58:25,490 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:58:25,538 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:58:25,538 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:25,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:25,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2040 proven. 552 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2018-10-01 00:58:25,676 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:25,676 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-01 00:58:25,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-01 00:58:25,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-01 00:58:25,676 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:25,677 INFO L87 Difference]: Start difference. First operand 138 states and 181 transitions. Second operand 26 states. [2018-10-01 00:58:25,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:25,890 INFO L93 Difference]: Finished difference Result 231 states and 318 transitions. [2018-10-01 00:58:25,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-01 00:58:25,890 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 135 [2018-10-01 00:58:25,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:25,891 INFO L225 Difference]: With dead ends: 231 [2018-10-01 00:58:25,891 INFO L226 Difference]: Without dead ends: 140 [2018-10-01 00:58:25,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:58:25,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-01 00:58:25,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-10-01 00:58:25,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-01 00:58:25,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 183 transitions. [2018-10-01 00:58:25,896 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 183 transitions. Word has length 135 [2018-10-01 00:58:25,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:25,896 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 183 transitions. [2018-10-01 00:58:25,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-01 00:58:25,897 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 183 transitions. [2018-10-01 00:58:25,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-01 00:58:25,897 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:25,897 INFO L375 BasicCegarLoop]: trace histogram [67, 43, 24, 1, 1, 1] [2018-10-01 00:58:25,898 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:25,898 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:25,898 INFO L82 PathProgramCache]: Analyzing trace with hash 130545599, now seen corresponding path program 23 times [2018-10-01 00:58:25,898 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:25,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:25,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:25,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:25,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:26,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2125 proven. 600 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2018-10-01 00:58:26,748 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:26,748 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-01 00:58:26,755 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:58:26,847 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 68 check-sat command(s) [2018-10-01 00:58:26,847 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:26,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:26,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2125 proven. 600 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2018-10-01 00:58:26,977 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:26,977 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-01 00:58:26,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-01 00:58:26,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-01 00:58:26,978 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:26,978 INFO L87 Difference]: Start difference. First operand 140 states and 183 transitions. Second operand 27 states. [2018-10-01 00:58:27,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:27,352 INFO L93 Difference]: Finished difference Result 233 states and 320 transitions. [2018-10-01 00:58:27,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-01 00:58:27,352 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 137 [2018-10-01 00:58:27,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:27,353 INFO L225 Difference]: With dead ends: 233 [2018-10-01 00:58:27,353 INFO L226 Difference]: Without dead ends: 142 [2018-10-01 00:58:27,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:58:27,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-01 00:58:27,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-10-01 00:58:27,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-10-01 00:58:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 185 transitions. [2018-10-01 00:58:27,358 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 185 transitions. Word has length 137 [2018-10-01 00:58:27,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:27,358 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 185 transitions. [2018-10-01 00:58:27,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-01 00:58:27,358 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 185 transitions. [2018-10-01 00:58:27,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-01 00:58:27,359 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:27,359 INFO L375 BasicCegarLoop]: trace histogram [68, 43, 25, 1, 1, 1] [2018-10-01 00:58:27,360 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:27,360 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:27,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1670760834, now seen corresponding path program 24 times [2018-10-01 00:58:27,360 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:27,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:27,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:27,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:27,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:28,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2210 proven. 650 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2018-10-01 00:58:28,293 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:28,293 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-01 00:58:28,308 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:58:28,413 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 68 check-sat command(s) [2018-10-01 00:58:28,413 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:28,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:28,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2175 proven. 1849 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2018-10-01 00:58:28,814 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:28,814 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 46] total 72 [2018-10-01 00:58:28,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-01 00:58:28,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-01 00:58:28,816 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:28,816 INFO L87 Difference]: Start difference. First operand 142 states and 185 transitions. Second operand 72 states. [2018-10-01 00:58:30,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:30,335 INFO L93 Difference]: Finished difference Result 238 states and 328 transitions. [2018-10-01 00:58:30,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-01 00:58:30,335 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 139 [2018-10-01 00:58:30,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:30,336 INFO L225 Difference]: With dead ends: 238 [2018-10-01 00:58:30,336 INFO L226 Difference]: Without dead ends: 147 [2018-10-01 00:58:30,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:58:30,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-01 00:58:30,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2018-10-01 00:58:30,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-01 00:58:30,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 190 transitions. [2018-10-01 00:58:30,341 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 190 transitions. Word has length 139 [2018-10-01 00:58:30,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:30,341 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 190 transitions. [2018-10-01 00:58:30,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-01 00:58:30,341 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2018-10-01 00:58:30,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-01 00:58:30,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:30,342 INFO L375 BasicCegarLoop]: trace histogram [70, 44, 26, 1, 1, 1] [2018-10-01 00:58:30,342 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:30,342 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:30,342 INFO L82 PathProgramCache]: Analyzing trace with hash 243202250, now seen corresponding path program 25 times [2018-10-01 00:58:30,342 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:30,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:30,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:30,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:30,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:30,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2349 proven. 702 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-01 00:58:30,584 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:30,584 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-01 00:58:30,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:58:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:30,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:30,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2349 proven. 702 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-01 00:58:30,760 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:30,760 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-01 00:58:30,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-01 00:58:30,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-01 00:58:30,761 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:30,761 INFO L87 Difference]: Start difference. First operand 146 states and 190 transitions. Second operand 29 states. [2018-10-01 00:58:31,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:31,081 INFO L93 Difference]: Finished difference Result 241 states and 330 transitions. [2018-10-01 00:58:31,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-01 00:58:31,082 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 143 [2018-10-01 00:58:31,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:31,083 INFO L225 Difference]: With dead ends: 241 [2018-10-01 00:58:31,083 INFO L226 Difference]: Without dead ends: 148 [2018-10-01 00:58:31,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:58:31,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-01 00:58:31,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-10-01 00:58:31,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-01 00:58:31,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 192 transitions. [2018-10-01 00:58:31,090 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 192 transitions. Word has length 143 [2018-10-01 00:58:31,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:31,090 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 192 transitions. [2018-10-01 00:58:31,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-01 00:58:31,090 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 192 transitions. [2018-10-01 00:58:31,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-01 00:58:31,091 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:31,091 INFO L375 BasicCegarLoop]: trace histogram [71, 44, 27, 1, 1, 1] [2018-10-01 00:58:31,091 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:31,092 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:31,092 INFO L82 PathProgramCache]: Analyzing trace with hash -565498803, now seen corresponding path program 26 times [2018-10-01 00:58:31,092 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:31,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:31,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:31,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:58:31,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2436 proven. 756 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-01 00:58:31,456 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:31,456 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-01 00:58:31,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:58:31,512 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:58:31,513 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:31,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:31,628 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2436 proven. 756 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-01 00:58:31,648 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:31,648 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-01 00:58:31,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-01 00:58:31,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-01 00:58:31,649 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:31,649 INFO L87 Difference]: Start difference. First operand 148 states and 192 transitions. Second operand 30 states. [2018-10-01 00:58:31,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:31,978 INFO L93 Difference]: Finished difference Result 243 states and 332 transitions. [2018-10-01 00:58:31,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-01 00:58:31,978 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 145 [2018-10-01 00:58:31,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:31,980 INFO L225 Difference]: With dead ends: 243 [2018-10-01 00:58:31,980 INFO L226 Difference]: Without dead ends: 150 [2018-10-01 00:58:31,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:58:31,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-01 00:58:31,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-10-01 00:58:31,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-01 00:58:31,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 194 transitions. [2018-10-01 00:58:31,985 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 194 transitions. Word has length 145 [2018-10-01 00:58:31,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:31,985 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 194 transitions. [2018-10-01 00:58:31,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-01 00:58:31,986 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 194 transitions. [2018-10-01 00:58:31,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-01 00:58:31,986 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:31,986 INFO L375 BasicCegarLoop]: trace histogram [72, 44, 28, 1, 1, 1] [2018-10-01 00:58:31,987 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:31,987 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:31,987 INFO L82 PathProgramCache]: Analyzing trace with hash -338130160, now seen corresponding path program 27 times [2018-10-01 00:58:31,987 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:31,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:31,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:31,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:31,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:32,265 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2523 proven. 812 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-01 00:58:32,265 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:32,265 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-01 00:58:32,273 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:58:32,341 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 59 check-sat command(s) [2018-10-01 00:58:32,342 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:32,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:32,466 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2523 proven. 812 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-01 00:58:32,486 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:32,486 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-10-01 00:58:32,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-01 00:58:32,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-01 00:58:32,487 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:32,487 INFO L87 Difference]: Start difference. First operand 150 states and 194 transitions. Second operand 31 states. [2018-10-01 00:58:32,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:32,866 INFO L93 Difference]: Finished difference Result 245 states and 334 transitions. [2018-10-01 00:58:32,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-01 00:58:32,866 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 147 [2018-10-01 00:58:32,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:32,868 INFO L225 Difference]: With dead ends: 245 [2018-10-01 00:58:32,868 INFO L226 Difference]: Without dead ends: 152 [2018-10-01 00:58:32,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:58:32,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-10-01 00:58:32,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-10-01 00:58:32,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-10-01 00:58:32,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 196 transitions. [2018-10-01 00:58:32,873 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 196 transitions. Word has length 147 [2018-10-01 00:58:32,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:32,874 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 196 transitions. [2018-10-01 00:58:32,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-01 00:58:32,874 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 196 transitions. [2018-10-01 00:58:32,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-01 00:58:32,875 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:32,875 INFO L375 BasicCegarLoop]: trace histogram [73, 44, 29, 1, 1, 1] [2018-10-01 00:58:32,875 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:32,875 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:32,875 INFO L82 PathProgramCache]: Analyzing trace with hash -880196333, now seen corresponding path program 28 times [2018-10-01 00:58:32,875 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:32,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:32,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:32,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:32,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:33,079 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2610 proven. 870 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-01 00:58:33,080 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:33,080 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-01 00:58:33,096 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:58:33,162 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:58:33,163 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:33,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:33,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2610 proven. 870 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-01 00:58:33,302 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:33,303 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-01 00:58:33,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-01 00:58:33,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-01 00:58:33,303 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:33,303 INFO L87 Difference]: Start difference. First operand 152 states and 196 transitions. Second operand 32 states. [2018-10-01 00:58:34,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:34,149 INFO L93 Difference]: Finished difference Result 247 states and 336 transitions. [2018-10-01 00:58:34,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-01 00:58:34,149 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 149 [2018-10-01 00:58:34,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:34,151 INFO L225 Difference]: With dead ends: 247 [2018-10-01 00:58:34,151 INFO L226 Difference]: Without dead ends: 154 [2018-10-01 00:58:34,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:58:34,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-01 00:58:34,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-10-01 00:58:34,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-10-01 00:58:34,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 198 transitions. [2018-10-01 00:58:34,157 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 198 transitions. Word has length 149 [2018-10-01 00:58:34,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:34,157 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 198 transitions. [2018-10-01 00:58:34,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-01 00:58:34,157 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 198 transitions. [2018-10-01 00:58:34,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-01 00:58:34,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:34,158 INFO L375 BasicCegarLoop]: trace histogram [74, 44, 30, 1, 1, 1] [2018-10-01 00:58:34,159 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:34,159 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:34,159 INFO L82 PathProgramCache]: Analyzing trace with hash -2114745770, now seen corresponding path program 29 times [2018-10-01 00:58:34,159 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:34,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:34,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:34,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:34,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:34,553 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2697 proven. 930 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-01 00:58:34,553 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:34,553 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-01 00:58:34,576 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:58:34,734 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 75 check-sat command(s) [2018-10-01 00:58:34,734 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:34,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:34,934 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2697 proven. 930 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-01 00:58:34,954 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:34,954 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-01 00:58:34,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-01 00:58:34,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-01 00:58:34,955 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:34,955 INFO L87 Difference]: Start difference. First operand 154 states and 198 transitions. Second operand 33 states. [2018-10-01 00:58:35,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:35,430 INFO L93 Difference]: Finished difference Result 249 states and 338 transitions. [2018-10-01 00:58:35,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-01 00:58:35,430 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 151 [2018-10-01 00:58:35,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:35,431 INFO L225 Difference]: With dead ends: 249 [2018-10-01 00:58:35,431 INFO L226 Difference]: Without dead ends: 156 [2018-10-01 00:58:35,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:58:35,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-10-01 00:58:35,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-10-01 00:58:35,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-01 00:58:35,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 200 transitions. [2018-10-01 00:58:35,437 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 200 transitions. Word has length 151 [2018-10-01 00:58:35,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:35,437 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 200 transitions. [2018-10-01 00:58:35,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-01 00:58:35,437 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 200 transitions. [2018-10-01 00:58:35,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-01 00:58:35,438 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:35,438 INFO L375 BasicCegarLoop]: trace histogram [75, 44, 31, 1, 1, 1] [2018-10-01 00:58:35,439 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:35,439 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:35,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1189186265, now seen corresponding path program 30 times [2018-10-01 00:58:35,439 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:35,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:35,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:35,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:35,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:35,754 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2784 proven. 992 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-01 00:58:35,754 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:35,754 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-01 00:58:35,762 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:58:35,865 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 75 check-sat command(s) [2018-10-01 00:58:35,865 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:35,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:36,441 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2759 proven. 1936 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2018-10-01 00:58:36,462 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:36,462 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 47] total 79 [2018-10-01 00:58:36,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-01 00:58:36,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-01 00:58:36,463 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:36,463 INFO L87 Difference]: Start difference. First operand 156 states and 200 transitions. Second operand 79 states. [2018-10-01 00:58:38,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:38,091 INFO L93 Difference]: Finished difference Result 254 states and 346 transitions. [2018-10-01 00:58:38,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-01 00:58:38,091 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 153 [2018-10-01 00:58:38,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:38,092 INFO L225 Difference]: With dead ends: 254 [2018-10-01 00:58:38,092 INFO L226 Difference]: Without dead ends: 161 [2018-10-01 00:58:38,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:58:38,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-01 00:58:38,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2018-10-01 00:58:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-01 00:58:38,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 205 transitions. [2018-10-01 00:58:38,098 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 205 transitions. Word has length 153 [2018-10-01 00:58:38,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:38,098 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 205 transitions. [2018-10-01 00:58:38,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-01 00:58:38,098 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 205 transitions. [2018-10-01 00:58:38,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-01 00:58:38,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:38,099 INFO L375 BasicCegarLoop]: trace histogram [77, 45, 32, 1, 1, 1] [2018-10-01 00:58:38,099 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:38,099 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:38,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1177907423, now seen corresponding path program 31 times [2018-10-01 00:58:38,100 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:38,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:38,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:38,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:38,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:38,333 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2937 proven. 1056 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-01 00:58:38,333 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:38,333 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-01 00:58:38,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:58:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:38,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:38,521 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2937 proven. 1056 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-01 00:58:38,540 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:38,541 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-10-01 00:58:38,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-01 00:58:38,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-01 00:58:38,541 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:38,542 INFO L87 Difference]: Start difference. First operand 160 states and 205 transitions. Second operand 35 states. [2018-10-01 00:58:38,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:38,930 INFO L93 Difference]: Finished difference Result 257 states and 348 transitions. [2018-10-01 00:58:38,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-01 00:58:38,930 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 157 [2018-10-01 00:58:38,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:38,932 INFO L225 Difference]: With dead ends: 257 [2018-10-01 00:58:38,932 INFO L226 Difference]: Without dead ends: 162 [2018-10-01 00:58:38,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:58:38,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-01 00:58:38,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-10-01 00:58:38,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-01 00:58:38,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 207 transitions. [2018-10-01 00:58:38,938 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 207 transitions. Word has length 157 [2018-10-01 00:58:38,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:38,938 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 207 transitions. [2018-10-01 00:58:38,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-01 00:58:38,938 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 207 transitions. [2018-10-01 00:58:38,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-01 00:58:38,939 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:38,939 INFO L375 BasicCegarLoop]: trace histogram [78, 45, 33, 1, 1, 1] [2018-10-01 00:58:38,939 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:38,940 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:38,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1509367452, now seen corresponding path program 32 times [2018-10-01 00:58:38,940 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:38,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:38,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:38,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:58:38,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:39,684 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3026 proven. 1122 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-01 00:58:39,684 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:39,684 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-01 00:58:39,691 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:58:39,751 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:58:39,751 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:39,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3026 proven. 1122 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-01 00:58:39,924 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:39,924 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-01 00:58:39,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-01 00:58:39,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-01 00:58:39,925 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:39,925 INFO L87 Difference]: Start difference. First operand 162 states and 207 transitions. Second operand 36 states. [2018-10-01 00:58:40,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:40,490 INFO L93 Difference]: Finished difference Result 259 states and 350 transitions. [2018-10-01 00:58:40,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-01 00:58:40,491 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 159 [2018-10-01 00:58:40,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:40,492 INFO L225 Difference]: With dead ends: 259 [2018-10-01 00:58:40,493 INFO L226 Difference]: Without dead ends: 164 [2018-10-01 00:58:40,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:58:40,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-01 00:58:40,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-10-01 00:58:40,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-01 00:58:40,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 209 transitions. [2018-10-01 00:58:40,499 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 209 transitions. Word has length 159 [2018-10-01 00:58:40,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:40,500 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 209 transitions. [2018-10-01 00:58:40,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-01 00:58:40,500 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 209 transitions. [2018-10-01 00:58:40,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-01 00:58:40,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:40,501 INFO L375 BasicCegarLoop]: trace histogram [79, 45, 34, 1, 1, 1] [2018-10-01 00:58:40,501 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:40,502 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:40,502 INFO L82 PathProgramCache]: Analyzing trace with hash 2080091879, now seen corresponding path program 33 times [2018-10-01 00:58:40,502 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:40,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:40,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:40,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:40,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:41,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 3115 proven. 1190 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-01 00:58:41,637 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:41,638 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-01 00:58:41,645 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:58:41,747 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 71 check-sat command(s) [2018-10-01 00:58:41,747 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:41,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:42,356 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 3115 proven. 1190 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-01 00:58:42,377 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:42,377 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-10-01 00:58:42,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-01 00:58:42,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-01 00:58:42,378 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:42,378 INFO L87 Difference]: Start difference. First operand 164 states and 209 transitions. Second operand 37 states. [2018-10-01 00:58:42,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:42,636 INFO L93 Difference]: Finished difference Result 261 states and 352 transitions. [2018-10-01 00:58:42,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-01 00:58:42,637 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 161 [2018-10-01 00:58:42,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:42,639 INFO L225 Difference]: With dead ends: 261 [2018-10-01 00:58:42,639 INFO L226 Difference]: Without dead ends: 166 [2018-10-01 00:58:42,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:58:42,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-01 00:58:42,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-10-01 00:58:42,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-01 00:58:42,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 211 transitions. [2018-10-01 00:58:42,645 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 211 transitions. Word has length 161 [2018-10-01 00:58:42,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:42,645 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 211 transitions. [2018-10-01 00:58:42,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-01 00:58:42,645 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 211 transitions. [2018-10-01 00:58:42,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-01 00:58:42,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:42,646 INFO L375 BasicCegarLoop]: trace histogram [80, 45, 35, 1, 1, 1] [2018-10-01 00:58:42,647 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:42,647 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:42,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1603197014, now seen corresponding path program 34 times [2018-10-01 00:58:42,647 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:42,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:42,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:42,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:42,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:43,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3204 proven. 1260 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-01 00:58:43,376 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:43,376 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-01 00:58:43,384 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:58:43,439 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:58:43,439 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:43,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:43,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3204 proven. 1260 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-01 00:58:43,634 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:43,635 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-01 00:58:43,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-01 00:58:43,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-01 00:58:43,635 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:43,635 INFO L87 Difference]: Start difference. First operand 166 states and 211 transitions. Second operand 38 states. [2018-10-01 00:58:43,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:43,922 INFO L93 Difference]: Finished difference Result 263 states and 354 transitions. [2018-10-01 00:58:43,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-01 00:58:43,923 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 163 [2018-10-01 00:58:43,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:43,924 INFO L225 Difference]: With dead ends: 263 [2018-10-01 00:58:43,924 INFO L226 Difference]: Without dead ends: 168 [2018-10-01 00:58:43,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:58:43,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-10-01 00:58:43,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-10-01 00:58:43,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-10-01 00:58:43,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 213 transitions. [2018-10-01 00:58:43,929 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 213 transitions. Word has length 163 [2018-10-01 00:58:43,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:43,929 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 213 transitions. [2018-10-01 00:58:43,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-01 00:58:43,929 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 213 transitions. [2018-10-01 00:58:43,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-01 00:58:43,930 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:43,930 INFO L375 BasicCegarLoop]: trace histogram [81, 45, 36, 1, 1, 1] [2018-10-01 00:58:43,930 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:43,931 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:43,931 INFO L82 PathProgramCache]: Analyzing trace with hash 2104196013, now seen corresponding path program 35 times [2018-10-01 00:58:43,931 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:43,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:43,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:43,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:43,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:45,115 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 3293 proven. 1332 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-01 00:58:45,115 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:45,115 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01 00:58:45,123 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:58:45,235 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 82 check-sat command(s) [2018-10-01 00:58:45,235 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:45,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:45,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 3293 proven. 1332 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-01 00:58:45,414 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:45,415 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-10-01 00:58:45,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-01 00:58:45,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-01 00:58:45,415 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:45,415 INFO L87 Difference]: Start difference. First operand 168 states and 213 transitions. Second operand 39 states. [2018-10-01 00:58:45,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:45,979 INFO L93 Difference]: Finished difference Result 265 states and 356 transitions. [2018-10-01 00:58:45,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-01 00:58:45,980 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 165 [2018-10-01 00:58:45,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:45,980 INFO L225 Difference]: With dead ends: 265 [2018-10-01 00:58:45,981 INFO L226 Difference]: Without dead ends: 170 [2018-10-01 00:58:45,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:58:45,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-01 00:58:45,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-10-01 00:58:45,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-01 00:58:45,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 215 transitions. [2018-10-01 00:58:45,986 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 215 transitions. Word has length 165 [2018-10-01 00:58:45,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:45,986 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 215 transitions. [2018-10-01 00:58:45,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-01 00:58:45,986 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 215 transitions. [2018-10-01 00:58:45,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-01 00:58:45,987 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:45,987 INFO L375 BasicCegarLoop]: trace histogram [82, 45, 37, 1, 1, 1] [2018-10-01 00:58:45,988 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:45,988 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:45,988 INFO L82 PathProgramCache]: Analyzing trace with hash 86039280, now seen corresponding path program 36 times [2018-10-01 00:58:45,988 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:45,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:45,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:45,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:45,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 3382 proven. 1406 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-01 00:58:47,184 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:47,184 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01 00:58:47,193 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:58:47,307 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 82 check-sat command(s) [2018-10-01 00:58:47,307 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:47,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:48,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 3382 proven. 1406 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-01 00:58:48,452 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:48,452 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-10-01 00:58:48,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-01 00:58:48,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-01 00:58:48,453 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:48,453 INFO L87 Difference]: Start difference. First operand 170 states and 215 transitions. Second operand 40 states. [2018-10-01 00:58:48,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:48,716 INFO L93 Difference]: Finished difference Result 267 states and 358 transitions. [2018-10-01 00:58:48,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-01 00:58:48,716 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 167 [2018-10-01 00:58:48,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:48,718 INFO L225 Difference]: With dead ends: 267 [2018-10-01 00:58:48,718 INFO L226 Difference]: Without dead ends: 172 [2018-10-01 00:58:48,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time [2018-10-01 00:58:48,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-10-01 00:58:48,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-10-01 00:58:48,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-10-01 00:58:48,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 217 transitions. [2018-10-01 00:58:48,724 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 217 transitions. Word has length 167 [2018-10-01 00:58:48,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:48,724 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 217 transitions. [2018-10-01 00:58:48,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-01 00:58:48,724 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 217 transitions. [2018-10-01 00:58:48,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-01 00:58:48,725 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:48,725 INFO L375 BasicCegarLoop]: trace histogram [83, 45, 38, 1, 1, 1] [2018-10-01 00:58:48,726 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:48,726 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:48,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1962636659, now seen corresponding path program 37 times [2018-10-01 00:58:48,726 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:48,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:48,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:48,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:48,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:49,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3471 proven. 1482 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-01 00:58:49,080 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:49,080 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-01 00:58:49,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:58:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:49,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:49,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3471 proven. 1482 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-01 00:58:49,324 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:49,324 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-10-01 00:58:49,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-01 00:58:49,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-01 00:58:49,325 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:49,325 INFO L87 Difference]: Start difference. First operand 172 states and 217 transitions. Second operand 41 states. [2018-10-01 00:58:49,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:49,983 INFO L93 Difference]: Finished difference Result 269 states and 360 transitions. [2018-10-01 00:58:49,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-01 00:58:49,983 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 169 [2018-10-01 00:58:49,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:49,985 INFO L225 Difference]: With dead ends: 269 [2018-10-01 00:58:49,985 INFO L226 Difference]: Without dead ends: 174 [2018-10-01 00:58:49,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:58:49,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-01 00:58:49,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-10-01 00:58:49,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-10-01 00:58:49,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 219 transitions. [2018-10-01 00:58:49,990 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 219 transitions. Word has length 169 [2018-10-01 00:58:49,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:49,990 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 219 transitions. [2018-10-01 00:58:49,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-01 00:58:49,991 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 219 transitions. [2018-10-01 00:58:49,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-01 00:58:49,991 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:49,992 INFO L375 BasicCegarLoop]: trace histogram [84, 45, 39, 1, 1, 1] [2018-10-01 00:58:49,992 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:49,992 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:49,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1486453558, now seen corresponding path program 38 times [2018-10-01 00:58:49,992 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:49,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:49,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:49,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:58:49,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:50,620 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 3560 proven. 1560 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-01 00:58:50,620 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:50,620 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-01 00:58:50,627 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:58:50,682 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:58:50,682 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:50,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:50,944 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 3560 proven. 1560 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-01 00:58:50,964 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:50,964 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-10-01 00:58:50,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-01 00:58:50,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-01 00:58:50,965 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:50,965 INFO L87 Difference]: Start difference. First operand 174 states and 219 transitions. Second operand 42 states. [2018-10-01 00:58:51,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:51,434 INFO L93 Difference]: Finished difference Result 271 states and 362 transitions. [2018-10-01 00:58:51,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-01 00:58:51,435 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 171 [2018-10-01 00:58:51,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:51,436 INFO L225 Difference]: With dead ends: 271 [2018-10-01 00:58:51,436 INFO L226 Difference]: Without dead ends: 176 [2018-10-01 00:58:51,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:58:51,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-01 00:58:51,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-10-01 00:58:51,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-01 00:58:51,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 221 transitions. [2018-10-01 00:58:51,442 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 221 transitions. Word has length 171 [2018-10-01 00:58:51,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:51,443 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 221 transitions. [2018-10-01 00:58:51,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-01 00:58:51,443 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 221 transitions. [2018-10-01 00:58:51,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-01 00:58:51,444 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:51,444 INFO L375 BasicCegarLoop]: trace histogram [85, 45, 40, 1, 1, 1] [2018-10-01 00:58:51,444 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:51,444 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:51,445 INFO L82 PathProgramCache]: Analyzing trace with hash -858973127, now seen corresponding path program 39 times [2018-10-01 00:58:51,445 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:51,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:51,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:51,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:51,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:52,379 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 3649 proven. 1640 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-01 00:58:52,380 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:52,380 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-01 00:58:52,387 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:58:52,498 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 83 check-sat command(s) [2018-10-01 00:58:52,498 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:52,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 3649 proven. 1640 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-01 00:58:52,691 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:52,691 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-10-01 00:58:52,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-01 00:58:52,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-01 00:58:52,692 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:52,692 INFO L87 Difference]: Start difference. First operand 176 states and 221 transitions. Second operand 43 states. [2018-10-01 00:58:53,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:53,033 INFO L93 Difference]: Finished difference Result 273 states and 364 transitions. [2018-10-01 00:58:53,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-01 00:58:53,033 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 173 [2018-10-01 00:58:53,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:53,034 INFO L225 Difference]: With dead ends: 273 [2018-10-01 00:58:53,034 INFO L226 Difference]: Without dead ends: 178 [2018-10-01 00:58:53,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:58:53,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-01 00:58:53,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-10-01 00:58:53,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-10-01 00:58:53,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 223 transitions. [2018-10-01 00:58:53,039 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 223 transitions. Word has length 173 [2018-10-01 00:58:53,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:53,039 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 223 transitions. [2018-10-01 00:58:53,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-01 00:58:53,039 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 223 transitions. [2018-10-01 00:58:53,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-01 00:58:53,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:53,040 INFO L375 BasicCegarLoop]: trace histogram [86, 45, 41, 1, 1, 1] [2018-10-01 00:58:53,040 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:53,041 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:53,041 INFO L82 PathProgramCache]: Analyzing trace with hash 43812988, now seen corresponding path program 40 times [2018-10-01 00:58:53,041 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:53,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:53,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:53,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:53,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:53,979 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3738 proven. 1722 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-01 00:58:53,980 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:53,980 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-01 00:58:53,987 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:58:54,044 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:58:54,044 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:54,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:54,229 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3738 proven. 1722 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-01 00:58:54,249 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:54,249 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-10-01 00:58:54,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-01 00:58:54,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-01 00:58:54,250 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:54,250 INFO L87 Difference]: Start difference. First operand 178 states and 223 transitions. Second operand 44 states. [2018-10-01 00:58:54,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:54,740 INFO L93 Difference]: Finished difference Result 275 states and 366 transitions. [2018-10-01 00:58:54,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-01 00:58:54,740 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 175 [2018-10-01 00:58:54,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:54,742 INFO L225 Difference]: With dead ends: 275 [2018-10-01 00:58:54,742 INFO L226 Difference]: Without dead ends: 180 [2018-10-01 00:58:54,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:58:54,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-01 00:58:54,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-10-01 00:58:54,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-01 00:58:54,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 225 transitions. [2018-10-01 00:58:54,747 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 225 transitions. Word has length 175 [2018-10-01 00:58:54,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:54,747 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 225 transitions. [2018-10-01 00:58:54,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-01 00:58:54,748 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 225 transitions. [2018-10-01 00:58:54,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-01 00:58:54,748 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:54,749 INFO L375 BasicCegarLoop]: trace histogram [87, 45, 42, 1, 1, 1] [2018-10-01 00:58:54,749 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:54,749 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:54,749 INFO L82 PathProgramCache]: Analyzing trace with hash 37875711, now seen corresponding path program 41 times [2018-10-01 00:58:54,749 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:54,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:54,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:54,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:54,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:55,028 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 3827 proven. 1806 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-01 00:58:55,028 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:55,029 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-01 00:58:55,036 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:58:55,158 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 88 check-sat command(s) [2018-10-01 00:58:55,159 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:55,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:55,332 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 3827 proven. 1806 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-01 00:58:55,352 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:55,353 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-10-01 00:58:55,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-01 00:58:55,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-01 00:58:55,354 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:55,354 INFO L87 Difference]: Start difference. First operand 180 states and 225 transitions. Second operand 45 states. [2018-10-01 00:58:56,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:56,041 INFO L93 Difference]: Finished difference Result 277 states and 368 transitions. [2018-10-01 00:58:56,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-01 00:58:56,042 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 177 [2018-10-01 00:58:56,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:56,043 INFO L225 Difference]: With dead ends: 277 [2018-10-01 00:58:56,043 INFO L226 Difference]: Without dead ends: 182 [2018-10-01 00:58:56,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:58:56,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-01 00:58:56,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-10-01 00:58:56,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-01 00:58:56,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 227 transitions. [2018-10-01 00:58:56,048 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 227 transitions. Word has length 177 [2018-10-01 00:58:56,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:56,048 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 227 transitions. [2018-10-01 00:58:56,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-01 00:58:56,048 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 227 transitions. [2018-10-01 00:58:56,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-01 00:58:56,049 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:56,049 INFO L375 BasicCegarLoop]: trace histogram [88, 45, 43, 1, 1, 1] [2018-10-01 00:58:56,049 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:56,049 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:56,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1372880190, now seen corresponding path program 42 times [2018-10-01 00:58:56,050 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:56,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:56,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:56,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:56,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:56,581 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 3916 proven. 1892 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-01 00:58:56,581 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:56,582 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-01 00:58:56,588 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:58:57,019 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 88 check-sat command(s) [2018-10-01 00:58:57,020 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:57,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:57,566 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 3913 proven. 2025 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2018-10-01 00:58:57,586 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:57,586 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 48] total 92 [2018-10-01 00:58:57,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-01 00:58:57,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-01 00:58:57,588 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:57,588 INFO L87 Difference]: Start difference. First operand 182 states and 227 transitions. Second operand 92 states. [2018-10-01 00:58:59,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:59,593 INFO L93 Difference]: Finished difference Result 282 states and 376 transitions. [2018-10-01 00:58:59,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-01 00:58:59,593 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 179 [2018-10-01 00:58:59,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:59,594 INFO L225 Difference]: With dead ends: 282 [2018-10-01 00:58:59,594 INFO L226 Difference]: Without dead ends: 187 [2018-10-01 00:58:59,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:58:59,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-01 00:58:59,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2018-10-01 00:58:59,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-01 00:58:59,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 232 transitions. [2018-10-01 00:58:59,598 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 232 transitions. Word has length 179 [2018-10-01 00:58:59,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:59,598 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 232 transitions. [2018-10-01 00:58:59,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-01 00:58:59,598 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 232 transitions. [2018-10-01 00:58:59,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-01 00:58:59,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:59,599 INFO L375 BasicCegarLoop]: trace histogram [90, 46, 44, 1, 1, 1] [2018-10-01 00:58:59,599 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:59,599 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:59,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1960747786, now seen corresponding path program 43 times [2018-10-01 00:58:59,600 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:59,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:59,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:59,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:59,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:59,940 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 4095 proven. 1980 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2018-10-01 00:58:59,940 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:59,940 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-01 00:58:59,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:59:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:59:00,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:59:00,376 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 4095 proven. 1980 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2018-10-01 00:59:00,396 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:59:00,396 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-10-01 00:59:00,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-01 00:59:00,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-01 00:59:00,397 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:59:00,397 INFO L87 Difference]: Start difference. First operand 186 states and 232 transitions. Second operand 47 states. [2018-10-01 00:59:00,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:59:00,992 INFO L93 Difference]: Finished difference Result 285 states and 378 transitions. [2018-10-01 00:59:00,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-01 00:59:00,993 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 183 [2018-10-01 00:59:00,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:59:00,994 INFO L225 Difference]: With dead ends: 285 [2018-10-01 00:59:00,994 INFO L226 Difference]: Without dead ends: 188 [2018-10-01 00:59:00,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:59:00,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-01 00:59:00,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-10-01 00:59:00,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-10-01 00:59:00,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 234 transitions. [2018-10-01 00:59:00,998 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 234 transitions. Word has length 183 [2018-10-01 00:59:00,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:59:00,999 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 234 transitions. [2018-10-01 00:59:00,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-01 00:59:00,999 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 234 transitions. [2018-10-01 00:59:01,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-01 00:59:01,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:59:01,000 INFO L375 BasicCegarLoop]: trace histogram [91, 46, 45, 1, 1, 1] [2018-10-01 00:59:01,000 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:59:01,001 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:59:01,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1731319693, now seen corresponding path program 44 times [2018-10-01 00:59:01,001 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:59:01,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:59:01,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:01,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:59:01,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:59:01,698 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 4186 proven. 2070 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2018-10-01 00:59:01,699 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:59:01,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 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-01 00:59:01,708 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:59:01,767 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:59:01,767 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:59:01,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:59:01,964 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 4186 proven. 2070 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2018-10-01 00:59:01,984 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:59:01,984 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-10-01 00:59:01,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-01 00:59:01,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-01 00:59:01,985 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:59:01,985 INFO L87 Difference]: Start difference. First operand 188 states and 234 transitions. Second operand 48 states. [2018-10-01 00:59:02,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:59:02,400 INFO L93 Difference]: Finished difference Result 287 states and 380 transitions. [2018-10-01 00:59:02,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-01 00:59:02,401 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 185 [2018-10-01 00:59:02,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:59:02,402 INFO L225 Difference]: With dead ends: 287 [2018-10-01 00:59:02,402 INFO L226 Difference]: Without dead ends: 190 [2018-10-01 00:59:02,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:59:02,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-01 00:59:02,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-10-01 00:59:02,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-10-01 00:59:02,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 236 transitions. [2018-10-01 00:59:02,408 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 236 transitions. Word has length 185 [2018-10-01 00:59:02,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:59:02,408 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 236 transitions. [2018-10-01 00:59:02,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-01 00:59:02,408 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 236 transitions. [2018-10-01 00:59:02,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-01 00:59:02,409 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:59:02,409 INFO L375 BasicCegarLoop]: trace histogram [92, 46, 46, 1, 1, 1] [2018-10-01 00:59:02,409 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:59:02,409 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:59:02,409 INFO L82 PathProgramCache]: Analyzing trace with hash 294254416, now seen corresponding path program 45 times [2018-10-01 00:59:02,409 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:59:02,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:59:02,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:02,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:59:02,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:59:02,696 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 4277 proven. 2162 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2018-10-01 00:59:02,696 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:59:02,696 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-01 00:59:02,705 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:59:02,836 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2018-10-01 00:59:02,836 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:59:02,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:59:03,364 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:59:03,385 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:59:03,386 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 94] total 94 [2018-10-01 00:59:03,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-01 00:59:03,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-01 00:59:03,387 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:59:03,387 INFO L87 Difference]: Start difference. First operand 190 states and 236 transitions. Second operand 95 states. [2018-10-01 00:59:05,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:59:05,649 INFO L93 Difference]: Finished difference Result 295 states and 391 transitions. [2018-10-01 00:59:05,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-01 00:59:05,649 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 187 [2018-10-01 00:59:05,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:59:05,650 INFO L225 Difference]: With dead ends: 295 [2018-10-01 00:59:05,650 INFO L226 Difference]: Without dead ends: 198 [2018-10-01 00:59:05,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:59:05,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-01 00:59:05,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-10-01 00:59:05,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-10-01 00:59:05,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 244 transitions. [2018-10-01 00:59:05,655 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 244 transitions. Word has length 187 [2018-10-01 00:59:05,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:59:05,655 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 244 transitions. [2018-10-01 00:59:05,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-01 00:59:05,655 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 244 transitions. [2018-10-01 00:59:05,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-01 00:59:05,656 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:59:05,656 INFO L375 BasicCegarLoop]: trace histogram [96, 50, 46, 1, 1, 1] [2018-10-01 00:59:05,656 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:59:05,656 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:59:05,656 INFO L82 PathProgramCache]: Analyzing trace with hash -988584228, now seen corresponding path program 46 times [2018-10-01 00:59:05,656 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:59:05,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:59:05,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:05,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:59:05,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:59:06,354 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 4656 proven. 2304 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-10-01 00:59:06,354 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:59:06,354 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-01 00:59:06,362 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:59:06,424 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:59:06,424 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:59:06,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:59:07,173 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:59:07,194 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:59:07,195 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 98] total 101 [2018-10-01 00:59:07,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-01 00:59:07,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-01 00:59:07,196 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:59:07,196 INFO L87 Difference]: Start difference. First operand 198 states and 244 transitions. Second operand 101 states. [2018-10-01 00:59:09,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:59:09,106 INFO L93 Difference]: Finished difference Result 209 states and 261 transitions. [2018-10-01 00:59:09,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-01 00:59:09,107 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 195 [2018-10-01 00:59:09,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:59:09,108 INFO L225 Difference]: With dead ends: 209 [2018-10-01 00:59:09,108 INFO L226 Difference]: Without dead ends: 205 [2018-10-01 00:59:09,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-10-01 00:59:09,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-01 00:59:09,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2018-10-01 00:59:09,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-01 00:59:09,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 253 transitions. [2018-10-01 00:59:09,112 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 253 transitions. Word has length 195 [2018-10-01 00:59:09,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:59:09,113 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 253 transitions. [2018-10-01 00:59:09,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-01 00:59:09,113 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 253 transitions. [2018-10-01 00:59:09,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-01 00:59:09,114 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:59:09,114 INFO L375 BasicCegarLoop]: trace histogram [99, 50, 49, 1, 1, 1] [2018-10-01 00:59:09,115 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:59:09,115 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:59:09,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1862555477, now seen corresponding path program 47 times [2018-10-01 00:59:09,115 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:59:09,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:59:09,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:09,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:59:09,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:59:10,261 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 4950 proven. 2401 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-10-01 00:59:10,262 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:59:10,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 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-01 00:59:10,269 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:59:10,418 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 100 check-sat command(s) [2018-10-01 00:59:10,418 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:59:10,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:59:10,793 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 4950 proven. 2401 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-10-01 00:59:10,814 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:59:10,814 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-10-01 00:59:10,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-01 00:59:10,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-01 00:59:10,815 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:59:10,815 INFO L87 Difference]: Start difference. First operand 204 states and 253 transitions. Second operand 52 states. [2018-10-01 00:59:11,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:59:11,771 INFO L93 Difference]: Finished difference Result 210 states and 260 transitions. [2018-10-01 00:59:11,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-01 00:59:11,772 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 201 [2018-10-01 00:59:11,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:59:11,773 INFO L225 Difference]: With dead ends: 210 [2018-10-01 00:59:11,773 INFO L226 Difference]: Without dead ends: 206 [2018-10-01 00:59:11,774 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:59:11,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-01 00:59:11,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-10-01 00:59:11,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-01 00:59:11,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 256 transitions. [2018-10-01 00:59:11,779 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 256 transitions. Word has length 201 [2018-10-01 00:59:11,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:59:11,780 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 256 transitions. [2018-10-01 00:59:11,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-01 00:59:11,780 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 256 transitions. [2018-10-01 00:59:11,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-01 00:59:11,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:59:11,781 INFO L375 BasicCegarLoop]: trace histogram [100, 50, 50, 1, 1, 1] [2018-10-01 00:59:11,781 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:59:11,782 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:59:11,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1085307248, now seen corresponding path program 48 times [2018-10-01 00:59:11,782 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:59:11,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:59:11,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:11,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:59:11,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:59:12,487 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 7450 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-10-01 00:59:12,487 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:59:12,487 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2018-10-01 00:59:12,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-01 00:59:12,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-01 00:59:12,488 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:59:12,488 INFO L87 Difference]: Start difference. First operand 206 states and 256 transitions. Second operand 53 states. [2018-10-01 00:59:13,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:59:13,231 INFO L93 Difference]: Finished difference Result 2756 states and 4081 transitions. [2018-10-01 00:59:13,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-01 00:59:13,232 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 203 [2018-10-01 00:59:13,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:59:13,243 INFO L225 Difference]: With dead ends: 2756 [2018-10-01 00:59:13,243 INFO L226 Difference]: Without dead ends: 2755 [2018-10-01 00:59:13,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:59:13,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2018-10-01 00:59:13,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 205. [2018-10-01 00:59:13,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-01 00:59:13,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 255 transitions. [2018-10-01 00:59:13,297 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 255 transitions. Word has length 203 [2018-10-01 00:59:13,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:59:13,297 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 255 transitions. [2018-10-01 00:59:13,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-01 00:59:13,297 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 255 transitions. [2018-10-01 00:59:13,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-01 00:59:13,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:59:13,299 INFO L375 BasicCegarLoop]: trace histogram [100, 50, 50, 1, 1, 1, 1] [2018-10-01 00:59:13,299 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:59:13,299 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:59:13,299 INFO L82 PathProgramCache]: Analyzing trace with hash -715213634, now seen corresponding path program 1 times [2018-10-01 00:59:13,299 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:59:13,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:59:13,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:13,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:59:13,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:59:13,841 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-10-01 00:59:13,842 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:59:13,842 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-01 00:59:13,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:59:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:59:13,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:59:15,091 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-10-01 00:59:15,111 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:59:15,111 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-10-01 00:59:15,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-01 00:59:15,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-01 00:59:15,112 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:59:15,112 INFO L87 Difference]: Start difference. First operand 205 states and 255 transitions. Second operand 53 states. [2018-10-01 00:59:17,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:59:17,661 INFO L93 Difference]: Finished difference Result 2859 states and 4234 transitions. [2018-10-01 00:59:17,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-01 00:59:17,662 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 204 [2018-10-01 00:59:17,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:59:17,675 INFO L225 Difference]: With dead ends: 2859 [2018-10-01 00:59:17,675 INFO L226 Difference]: Without dead ends: 2856 [2018-10-01 00:59:17,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:59:17,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2856 states. [2018-10-01 00:59:17,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2856 to 207. [2018-10-01 00:59:17,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-01 00:59:17,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 258 transitions. [2018-10-01 00:59:17,760 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 258 transitions. Word has length 204 [2018-10-01 00:59:17,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:59:17,761 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 258 transitions. [2018-10-01 00:59:17,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-01 00:59:17,761 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 258 transitions. [2018-10-01 00:59:17,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-01 00:59:17,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:59:17,762 INFO L375 BasicCegarLoop]: trace histogram [101, 51, 50, 1, 1, 1, 1] [2018-10-01 00:59:17,762 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:59:17,763 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:59:17,763 INFO L82 PathProgramCache]: Analyzing trace with hash -133074471, now seen corresponding path program 2 times [2018-10-01 00:59:17,763 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:59:17,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:59:17,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:17,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:59:17,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:59:18,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 7651 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-10-01 00:59:18,741 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:59:18,741 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2018-10-01 00:59:18,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-01 00:59:18,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-01 00:59:18,742 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:59:18,742 INFO L87 Difference]: Start difference. First operand 207 states and 258 transitions. Second operand 52 states. [2018-10-01 00:59:19,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:59:19,383 INFO L93 Difference]: Finished difference Result 306 states and 406 transitions. [2018-10-01 00:59:19,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-01 00:59:19,384 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 206 [2018-10-01 00:59:19,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:59:19,385 INFO L225 Difference]: With dead ends: 306 [2018-10-01 00:59:19,385 INFO L226 Difference]: Without dead ends: 0 [2018-10-01 00:59:19,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:59:19,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-01 00:59:19,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-01 00:59:19,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-01 00:59:19,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-01 00:59:19,387 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 206 [2018-10-01 00:59:19,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:59:19,387 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-01 00:59:19,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-01 00:59:19,388 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-01 00:59:19,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-01 00:59:19,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-01 00:59:36,927 WARN L178 SmtUtils]: Spent 17.52 s on a formula simplification. DAG size of input: 3207 DAG size of output: 3056 [2018-10-01 01:00:42,277 WARN L178 SmtUtils]: Spent 1.09 m on a formula simplification. DAG size of input: 3056 DAG size of output: 407 [2018-10-01 01:00:42,283 INFO L426 ceAbstractionStarter]: For program point mainENTRY(lines 11 26) no Hoare annotation was computed. [2018-10-01 01:00:42,284 INFO L426 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-10-01 01:00:42,284 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 11 26) no Hoare annotation was computed. [2018-10-01 01:00:42,284 INFO L426 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-10-01 01:00:42,284 INFO L426 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONASSERT(line 25) no Hoare annotation was computed. [2018-10-01 01:00:42,284 INFO L426 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 24) no Hoare annotation was computed. [2018-10-01 01:00:42,284 INFO L426 ceAbstractionStarter]: For program point L16(lines 16 21) no Hoare annotation was computed. [2018-10-01 01:00:42,285 INFO L422 ceAbstractionStarter]: At program point L16-2(lines 15 22) the Hoare annotation is: (or (and (<= 83 x) (and (<= y 83) (and (<= x 83) (<= 83 y)))) (and (and (and (<= x 71) (<= 71 y)) (<= y 71)) (<= 71 x)) (and (and (<= y 75) (and (<= x 75) (<= 75 y))) (<= 75 x)) (and (<= 68 x) (and (and (<= 68 y) (<= x 68)) (<= y 68))) (and (<= 82 x) (and (and (<= x 82) (<= 82 y)) (<= y 82))) (and (<= 92 x) (and (<= y 92) (and (<= 92 y) (<= x 92)))) (and (<= 88 x) (and (and (<= x 88) (<= 88 y)) (<= y 88))) (and (<= 57 x) (and (and (<= x 57) (<= 57 y)) (<= y 57))) (and (and (<= y 58) (and (<= 58 y) (<= x 58))) (<= 58 x)) (and (and (<= y 91) (and (<= 91 y) (<= x 91))) (<= 91 x)) (and (<= 74 x) (and (and (<= x 74) (<= 74 y)) (<= y 74))) (and (and (and (<= x 72) (<= 72 y)) (<= y 72)) (<= 72 x)) (and (<= 87 x) (and (<= y 87) (and (<= 87 y) (<= x 87)))) (and (and (and (<= 60 y) (<= x 60)) (<= y 60)) (<= 60 x)) (and (and (and (<= x 76) (<= 76 y)) (<= y 76)) (<= 76 x)) (and (<= 56 x) (and (and (<= x 56) (<= 56 y)) (<= y 56))) (and (<= 100 x) (and (<= 100 y) (<= y 100))) (and (<= 53 x) (and (and (<= 53 y) (<= x 53)) (<= y 53))) (and (<= 86 x) (and (<= y 86) (and (<= 86 y) (<= x 86)))) (and (and (<= y 79) (and (<= 79 y) (<= x 79))) (<= 79 x)) (and (and (and (<= 99 y) (<= x 99)) (<= y 99)) (<= 99 x)) (and (and (<= y 78) (and (<= 78 y) (<= x 78))) (<= 78 x)) (and (and (<= y 63) (and (<= 63 y) (<= x 63))) (<= 63 x)) (and (and (and (<= x 94) (<= 94 y)) (<= y 94)) (<= 94 x)) (and (and (<= y 55) (and (<= x 55) (<= 55 y))) (<= 55 x)) (and (<= 70 x) (and (and (<= 70 y) (<= x 70)) (<= y 70))) (and (<= 85 x) (and (<= y 85) (and (<= 85 y) (<= x 85)))) (and (<= 54 x) (and (and (<= x 54) (<= 54 y)) (<= y 54))) (and (and (and (<= x 89) (<= 89 y)) (<= y 89)) (<= 89 x)) (and (and (and (<= 69 y) (<= x 69)) (<= y 69)) (<= 69 x)) (and (<= 64 x) (and (<= y 64) (and (<= 64 y) (<= x 64)))) (and (and (and (<= x 59) (<= 59 y)) (<= y 59)) (<= 59 x)) (and (and (and (<= 97 y) (<= x 97)) (<= y 97)) (<= 97 x)) (and (<= 52 x) (and (and (<= 52 y) (<= x 52)) (<= y 52))) (and (<= 61 x) (and (<= y 61) (and (<= 61 y) (<= x 61)))) (and (<= 84 x) (and (and (<= x 84) (<= 84 y)) (<= y 84))) (and (<= 80 x) (and (<= y 80) (and (<= x 80) (<= 80 y)))) (and (<= 95 x) (and (<= y 95) (and (<= x 95) (<= 95 y)))) (and (and (<= y 65) (and (<= 65 y) (<= x 65))) (<= 65 x)) (and (and (<= y 77) (and (<= 77 y) (<= x 77))) (<= 77 x)) (and (and (<= y 90) (and (<= x 90) (<= 90 y))) (<= 90 x)) (and (<= 51 x) (and (and (<= x 51) (<= 51 y)) (<= y 51))) (and (<= 73 x) (and (<= y 73) (and (<= x 73) (<= 73 y)))) (and (and (and (<= x 93) (<= 93 y)) (<= y 93)) (<= 93 x)) (and (and (<= y 81) (and (<= x 81) (<= 81 y))) (<= 81 x)) (and (and (and (<= 67 y) (<= x 67)) (<= y 67)) (<= 67 x)) (and (<= 62 x) (and (<= y 62) (and (<= 62 y) (<= x 62)))) (and (<= 98 x) (and (<= y 98) (and (<= x 98) (<= 98 y)))) (and (<= y 50) (and (<= 50 y) (<= x 50))) (and (<= 96 x) (and (<= y 96) (and (<= 96 y) (<= x 96)))) (and (and (and (<= x 66) (<= 66 y)) (<= y 66)) (<= 66 x))) [2018-10-01 01:00:42,286 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 11 26) no Hoare annotation was computed. [2018-10-01 01:00:42,318 INFO L202 PluginConnector]: Adding new model BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 01:00:42 BoogieIcfgContainer [2018-10-01 01:00:42,318 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 01:00:42,319 INFO L168 Benchmark]: Toolchain (without parser) took 157213.06 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 259.8 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-10-01 01:00:42,324 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.26 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-01 01:00:42,324 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.48 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-01 01:00:42,324 INFO L168 Benchmark]: Boogie Preprocessor took 20.00 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-01 01:00:42,325 INFO L168 Benchmark]: RCFGBuilder took 339.74 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-01 01:00:42,326 INFO L168 Benchmark]: TraceAbstraction took 156808.44 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 238.6 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-10-01 01:00:42,332 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.26 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 39.48 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 20.00 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 339.74 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 156808.44 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 238.6 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 24]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((83 <= x && y <= 83 && x <= 83 && 83 <= y) || (((x <= 71 && 71 <= y) && y <= 71) && 71 <= x)) || ((y <= 75 && x <= 75 && 75 <= y) && 75 <= x)) || (68 <= x && (68 <= y && x <= 68) && y <= 68)) || (82 <= x && (x <= 82 && 82 <= y) && y <= 82)) || (92 <= x && y <= 92 && 92 <= y && x <= 92)) || (88 <= x && (x <= 88 && 88 <= y) && y <= 88)) || (57 <= x && (x <= 57 && 57 <= y) && y <= 57)) || ((y <= 58 && 58 <= y && x <= 58) && 58 <= x)) || ((y <= 91 && 91 <= y && x <= 91) && 91 <= x)) || (74 <= x && (x <= 74 && 74 <= y) && y <= 74)) || (((x <= 72 && 72 <= y) && y <= 72) && 72 <= x)) || (87 <= x && y <= 87 && 87 <= y && x <= 87)) || (((60 <= y && x <= 60) && y <= 60) && 60 <= x)) || (((x <= 76 && 76 <= y) && y <= 76) && 76 <= x)) || (56 <= x && (x <= 56 && 56 <= y) && y <= 56)) || (100 <= x && 100 <= y && y <= 100)) || (53 <= x && (53 <= y && x <= 53) && y <= 53)) || (86 <= x && y <= 86 && 86 <= y && x <= 86)) || ((y <= 79 && 79 <= y && x <= 79) && 79 <= x)) || (((99 <= y && x <= 99) && y <= 99) && 99 <= x)) || ((y <= 78 && 78 <= y && x <= 78) && 78 <= x)) || ((y <= 63 && 63 <= y && x <= 63) && 63 <= x)) || (((x <= 94 && 94 <= y) && y <= 94) && 94 <= x)) || ((y <= 55 && x <= 55 && 55 <= y) && 55 <= x)) || (70 <= x && (70 <= y && x <= 70) && y <= 70)) || (85 <= x && y <= 85 && 85 <= y && x <= 85)) || (54 <= x && (x <= 54 && 54 <= y) && y <= 54)) || (((x <= 89 && 89 <= y) && y <= 89) && 89 <= x)) || (((69 <= y && x <= 69) && y <= 69) && 69 <= x)) || (64 <= x && y <= 64 && 64 <= y && x <= 64)) || (((x <= 59 && 59 <= y) && y <= 59) && 59 <= x)) || (((97 <= y && x <= 97) && y <= 97) && 97 <= x)) || (52 <= x && (52 <= y && x <= 52) && y <= 52)) || (61 <= x && y <= 61 && 61 <= y && x <= 61)) || (84 <= x && (x <= 84 && 84 <= y) && y <= 84)) || (80 <= x && y <= 80 && x <= 80 && 80 <= y)) || (95 <= x && y <= 95 && x <= 95 && 95 <= y)) || ((y <= 65 && 65 <= y && x <= 65) && 65 <= x)) || ((y <= 77 && 77 <= y && x <= 77) && 77 <= x)) || ((y <= 90 && x <= 90 && 90 <= y) && 90 <= x)) || (51 <= x && (x <= 51 && 51 <= y) && y <= 51)) || (73 <= x && y <= 73 && x <= 73 && 73 <= y)) || (((x <= 93 && 93 <= y) && y <= 93) && 93 <= x)) || ((y <= 81 && x <= 81 && 81 <= y) && 81 <= x)) || (((67 <= y && x <= 67) && y <= 67) && 67 <= x)) || (62 <= x && y <= 62 && 62 <= y && x <= 62)) || (98 <= x && y <= 98 && x <= 98 && 98 <= y)) || (y <= 50 && 50 <= y && x <= 50)) || (96 <= x && y <= 96 && 96 <= y && x <= 96)) || (((x <= 66 && 66 <= y) && y <= 66) && 66 <= x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 2 error locations. SAFE Result, 156.7s OverallTime, 52 OverallIterations, 101 TraceHistogramMax, 31.5s AutomataDifference, 0.0s DeadEndRemovalTime, 82.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 396 SDtfs, 856 SDslu, 2760 SDs, 0 SdLazy, 5293 SolverSat, 1362 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6977 GetRequests, 5252 SyntacticMatches, 0 SemanticMatches, 1725 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 52 MinimizatonAttempts, 5210 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 102 NumberOfFragments, 758 HoareAnnotationTreeSize, 1 FomulaSimplifications, 669 FormulaSimplificationTreeSizeReduction, 17.5s HoareSimplificationTime, 1 FomulaSimplificationsInter, 334056 FormulaSimplificationTreeSizeReductionInter, 65.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 35.4s InterpolantComputationTime, 11600 NumberOfCodeBlocks, 11528 NumberOfCodeBlocksAsserted, 1390 NumberOfCheckSat, 11499 ConstructedInterpolants, 0 QuantifiedInterpolants, 3507697 SizeOfPredicates, 13 NumberOfNonLiveVariables, 14067 ConjunctsInSsa, 1496 ConjunctsInUnsatCore, 101 InterpolantComputations, 4 PerfectInterpolantSequences, 305786/416427 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_01-00-42-368.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_01-00-42-368.csv Received shutdown request...