java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-4eac566 [2018-09-23 19:31:08,492 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-23 19:31:08,495 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-23 19:31:08,513 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-23 19:31:08,514 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-23 19:31:08,515 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-23 19:31:08,517 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-23 19:31:08,519 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-23 19:31:08,527 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-23 19:31:08,531 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-23 19:31:08,532 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-23 19:31:08,533 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-23 19:31:08,534 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-23 19:31:08,535 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-23 19:31:08,538 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-23 19:31:08,539 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-23 19:31:08,540 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-23 19:31:08,541 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-23 19:31:08,547 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-23 19:31:08,548 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-23 19:31:08,552 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-23 19:31:08,553 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-23 19:31:08,556 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-23 19:31:08,556 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-23 19:31:08,556 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-23 19:31:08,560 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-23 19:31:08,561 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-23 19:31:08,563 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-23 19:31:08,564 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-23 19:31:08,565 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-23 19:31:08,565 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-23 19:31:08,566 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-23 19:31:08,567 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-23 19:31:08,568 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-23 19:31:08,569 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-23 19:31:08,569 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-23 19:31:08,570 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-23 19:31:08,584 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-23 19:31:08,585 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-23 19:31:08,587 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-23 19:31:08,588 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-23 19:31:08,588 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-23 19:31:08,589 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-23 19:31:08,589 INFO L133 SettingsManager]: * Use SBE=true [2018-09-23 19:31:08,589 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-23 19:31:08,589 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-23 19:31:08,589 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-23 19:31:08,590 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-23 19:31:08,590 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-23 19:31:08,590 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-23 19:31:08,590 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-23 19:31:08,595 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-23 19:31:08,596 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-23 19:31:08,596 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-23 19:31:08,596 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-23 19:31:08,596 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-23 19:31:08,596 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-23 19:31:08,597 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-23 19:31:08,597 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-23 19:31:08,597 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 19:31:08,597 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-23 19:31:08,597 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-23 19:31:08,598 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-23 19:31:08,598 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-23 19:31:08,598 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-23 19:31:08,598 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-23 19:31:08,598 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-23 19:31:08,660 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-23 19:31:08,673 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-23 19:31:08,677 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-23 19:31:08,678 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-23 19:31:08,679 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-23 19:31:08,680 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl [2018-09-23 19:31:08,680 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl' [2018-09-23 19:31:08,770 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-23 19:31:08,776 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-23 19:31:08,777 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-23 19:31:08,777 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-23 19:31:08,777 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-23 19:31:08,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:31:08" (1/1) ... [2018-09-23 19:31:08,816 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:31:08" (1/1) ... [2018-09-23 19:31:08,821 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-23 19:31:08,821 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-23 19:31:08,822 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-23 19:31:08,824 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-23 19:31:08,825 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-23 19:31:08,825 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-23 19:31:08,825 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-23 19:31:08,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:31:08" (1/1) ... [2018-09-23 19:31:08,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:31:08" (1/1) ... [2018-09-23 19:31:08,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:31:08" (1/1) ... [2018-09-23 19:31:08,848 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:31:08" (1/1) ... [2018-09-23 19:31:08,863 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:31:08" (1/1) ... [2018-09-23 19:31:08,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:31:08" (1/1) ... [2018-09-23 19:31:08,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:31:08" (1/1) ... [2018-09-23 19:31:08,879 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-23 19:31:08,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-23 19:31:08,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-23 19:31:08,883 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-23 19:31:08,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:31:08" (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-09-23 19:31:08,973 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-23 19:31:08,974 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-23 19:31:08,974 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-23 19:31:09,699 INFO L351 CfgBuilder]: Using library mode [2018-09-23 19:31:09,700 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 07:31:09 BoogieIcfgContainer [2018-09-23 19:31:09,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-23 19:31:09,701 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-23 19:31:09,701 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-23 19:31:09,704 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-23 19:31:09,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:31:08" (1/2) ... [2018-09-23 19:31:09,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b118496 and model type threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.09 07:31:09, skipping insertion in model container [2018-09-23 19:31:09,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 07:31:09" (2/2) ... [2018-09-23 19:31:09,708 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out_Reals.bpl [2018-09-23 19:31:09,717 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-23 19:31:09,727 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-09-23 19:31:09,778 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-23 19:31:09,779 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-23 19:31:09,779 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-23 19:31:09,779 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-23 19:31:09,779 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-23 19:31:09,780 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-23 19:31:09,780 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-23 19:31:09,780 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-23 19:31:09,780 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-23 19:31:09,797 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-09-23 19:31:09,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-23 19:31:09,805 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:09,806 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:09,807 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:09,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:09,814 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-09-23 19:31:09,816 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:09,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:09,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:09,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:09,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:10,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:10,111 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:10,111 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-23 19:31:10,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-23 19:31:10,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-23 19:31:10,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-23 19:31:10,135 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-09-23 19:31:11,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:11,940 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-09-23 19:31:11,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-23 19:31:11,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-23 19:31:11,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:11,960 INFO L225 Difference]: With dead ends: 163 [2018-09-23 19:31:11,961 INFO L226 Difference]: Without dead ends: 158 [2018-09-23 19:31:11,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:31:11,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-23 19:31:12,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-09-23 19:31:12,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-23 19:31:12,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-09-23 19:31:12,024 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-09-23 19:31:12,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:12,025 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-09-23 19:31:12,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-23 19:31:12,025 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-09-23 19:31:12,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-23 19:31:12,026 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:12,027 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:12,028 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:12,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:12,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-09-23 19:31:12,029 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:12,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:12,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:12,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:12,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:12,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:12,130 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:12,130 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-23 19:31:12,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-23 19:31:12,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-23 19:31:12,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-23 19:31:12,133 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-09-23 19:31:13,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:13,061 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-09-23 19:31:13,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-23 19:31:13,062 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-23 19:31:13,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:13,066 INFO L225 Difference]: With dead ends: 188 [2018-09-23 19:31:13,066 INFO L226 Difference]: Without dead ends: 183 [2018-09-23 19:31:13,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:31:13,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-23 19:31:13,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-09-23 19:31:13,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-23 19:31:13,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-09-23 19:31:13,092 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-09-23 19:31:13,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:13,093 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-09-23 19:31:13,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-23 19:31:13,093 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-09-23 19:31:13,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 19:31:13,094 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:13,094 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:13,095 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:13,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:13,096 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-09-23 19:31:13,096 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:13,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:13,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:13,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:13,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:13,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:13,201 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:13,201 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-23 19:31:13,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 19:31:13,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 19:31:13,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-23 19:31:13,202 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-09-23 19:31:14,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:14,618 INFO L93 Difference]: Finished difference Result 283 states and 637 transitions. [2018-09-23 19:31:14,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-23 19:31:14,619 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-23 19:31:14,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:14,622 INFO L225 Difference]: With dead ends: 283 [2018-09-23 19:31:14,623 INFO L226 Difference]: Without dead ends: 278 [2018-09-23 19:31:14,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-09-23 19:31:14,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-09-23 19:31:14,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 147. [2018-09-23 19:31:14,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-23 19:31:14,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 323 transitions. [2018-09-23 19:31:14,655 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 323 transitions. Word has length 9 [2018-09-23 19:31:14,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:14,655 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 323 transitions. [2018-09-23 19:31:14,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 19:31:14,655 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 323 transitions. [2018-09-23 19:31:14,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 19:31:14,657 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:14,657 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:14,657 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:14,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:14,658 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-09-23 19:31:14,658 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:14,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:14,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:14,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:14,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:14,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:14,842 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:14,842 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-23 19:31:14,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 19:31:14,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 19:31:14,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-23 19:31:14,843 INFO L87 Difference]: Start difference. First operand 147 states and 323 transitions. Second operand 7 states. [2018-09-23 19:31:16,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:16,757 INFO L93 Difference]: Finished difference Result 387 states and 869 transitions. [2018-09-23 19:31:16,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 19:31:16,760 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-23 19:31:16,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:16,763 INFO L225 Difference]: With dead ends: 387 [2018-09-23 19:31:16,764 INFO L226 Difference]: Without dead ends: 375 [2018-09-23 19:31:16,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-09-23 19:31:16,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-09-23 19:31:16,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 203. [2018-09-23 19:31:16,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-23 19:31:16,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-09-23 19:31:16,808 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-09-23 19:31:16,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:16,808 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-09-23 19:31:16,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 19:31:16,809 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-09-23 19:31:16,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:16,811 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:16,811 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:16,812 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:16,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:16,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-09-23 19:31:16,813 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:16,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:16,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:16,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:16,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:17,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:17,155 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:17,155 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:17,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:31:17,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:31:17,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:31:17,159 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 9 states. [2018-09-23 19:31:18,252 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-23 19:31:20,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:20,547 INFO L93 Difference]: Finished difference Result 725 states and 1622 transitions. [2018-09-23 19:31:20,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-23 19:31:20,548 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-23 19:31:20,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:20,554 INFO L225 Difference]: With dead ends: 725 [2018-09-23 19:31:20,554 INFO L226 Difference]: Without dead ends: 717 [2018-09-23 19:31:20,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-09-23 19:31:20,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-09-23 19:31:20,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 354. [2018-09-23 19:31:20,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-09-23 19:31:20,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 843 transitions. [2018-09-23 19:31:20,617 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 843 transitions. Word has length 12 [2018-09-23 19:31:20,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:20,618 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 843 transitions. [2018-09-23 19:31:20,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:31:20,618 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 843 transitions. [2018-09-23 19:31:20,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:20,620 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:20,620 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:20,621 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:20,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:20,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-09-23 19:31:20,621 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:20,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:20,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:20,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:20,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:20,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:20,716 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:20,716 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:20,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:31:20,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:31:20,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:31:20,717 INFO L87 Difference]: Start difference. First operand 354 states and 843 transitions. Second operand 9 states. [2018-09-23 19:31:23,461 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-23 19:31:24,413 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-23 19:31:26,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:26,162 INFO L93 Difference]: Finished difference Result 1008 states and 2278 transitions. [2018-09-23 19:31:26,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-23 19:31:26,164 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-23 19:31:26,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:26,174 INFO L225 Difference]: With dead ends: 1008 [2018-09-23 19:31:26,174 INFO L226 Difference]: Without dead ends: 1000 [2018-09-23 19:31:26,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870 [2018-09-23 19:31:26,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-09-23 19:31:26,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 364. [2018-09-23 19:31:26,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-09-23 19:31:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 868 transitions. [2018-09-23 19:31:26,289 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 868 transitions. Word has length 12 [2018-09-23 19:31:26,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:26,289 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 868 transitions. [2018-09-23 19:31:26,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:31:26,290 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 868 transitions. [2018-09-23 19:31:26,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:26,294 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:26,294 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:26,295 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:26,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:26,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-09-23 19:31:26,295 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:26,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:26,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:26,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:26,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:26,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:26,430 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:26,430 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:26,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:31:26,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:31:26,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:31:26,432 INFO L87 Difference]: Start difference. First operand 364 states and 868 transitions. Second operand 9 states. [2018-09-23 19:31:28,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:28,962 INFO L93 Difference]: Finished difference Result 924 states and 2097 transitions. [2018-09-23 19:31:28,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-23 19:31:28,964 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-23 19:31:28,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:28,970 INFO L225 Difference]: With dead ends: 924 [2018-09-23 19:31:28,970 INFO L226 Difference]: Without dead ends: 916 [2018-09-23 19:31:28,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2018-09-23 19:31:28,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2018-09-23 19:31:29,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 394. [2018-09-23 19:31:29,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-09-23 19:31:29,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 957 transitions. [2018-09-23 19:31:29,060 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 957 transitions. Word has length 12 [2018-09-23 19:31:29,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:29,061 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 957 transitions. [2018-09-23 19:31:29,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:31:29,061 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 957 transitions. [2018-09-23 19:31:29,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:29,062 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:29,062 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:29,063 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:29,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:29,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-09-23 19:31:29,064 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:29,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:29,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:29,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:29,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:29,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:29,287 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:29,288 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:29,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:31:29,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:31:29,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:31:29,289 INFO L87 Difference]: Start difference. First operand 394 states and 957 transitions. Second operand 9 states. [2018-09-23 19:31:31,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:31,325 INFO L93 Difference]: Finished difference Result 791 states and 1795 transitions. [2018-09-23 19:31:31,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-23 19:31:31,326 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-23 19:31:31,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:31,331 INFO L225 Difference]: With dead ends: 791 [2018-09-23 19:31:31,331 INFO L226 Difference]: Without dead ends: 783 [2018-09-23 19:31:31,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-09-23 19:31:31,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-09-23 19:31:31,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 392. [2018-09-23 19:31:31,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-09-23 19:31:31,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 950 transitions. [2018-09-23 19:31:31,417 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 950 transitions. Word has length 12 [2018-09-23 19:31:31,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:31,417 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 950 transitions. [2018-09-23 19:31:31,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:31:31,417 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 950 transitions. [2018-09-23 19:31:31,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:31,418 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:31,418 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:31,419 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:31,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:31,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1733624339, now seen corresponding path program 1 times [2018-09-23 19:31:31,420 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:31,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:31,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:31,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:31,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:31,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:31,502 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:31,502 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:31,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:31:31,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:31:31,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:31:31,503 INFO L87 Difference]: Start difference. First operand 392 states and 950 transitions. Second operand 9 states. [2018-09-23 19:31:33,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:33,743 INFO L93 Difference]: Finished difference Result 1040 states and 2400 transitions. [2018-09-23 19:31:33,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-23 19:31:33,744 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-23 19:31:33,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:33,751 INFO L225 Difference]: With dead ends: 1040 [2018-09-23 19:31:33,751 INFO L226 Difference]: Without dead ends: 1032 [2018-09-23 19:31:33,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-09-23 19:31:33,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2018-09-23 19:31:33,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 397. [2018-09-23 19:31:33,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-09-23 19:31:33,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 962 transitions. [2018-09-23 19:31:33,877 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 962 transitions. Word has length 12 [2018-09-23 19:31:33,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:33,877 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 962 transitions. [2018-09-23 19:31:33,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:31:33,878 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 962 transitions. [2018-09-23 19:31:33,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:33,879 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:33,879 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:33,879 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:33,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:33,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1736424693, now seen corresponding path program 1 times [2018-09-23 19:31:33,880 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:33,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:33,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:33,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:33,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:34,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:34,029 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:34,029 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:34,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:31:34,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:31:34,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:31:34,030 INFO L87 Difference]: Start difference. First operand 397 states and 962 transitions. Second operand 9 states. [2018-09-23 19:31:36,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:36,878 INFO L93 Difference]: Finished difference Result 1166 states and 2697 transitions. [2018-09-23 19:31:36,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-23 19:31:36,878 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-23 19:31:36,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:36,886 INFO L225 Difference]: With dead ends: 1166 [2018-09-23 19:31:36,886 INFO L226 Difference]: Without dead ends: 1158 [2018-09-23 19:31:36,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=365, Invalid=967, Unknown=0, NotChecked=0, Total=1332 [2018-09-23 19:31:36,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2018-09-23 19:31:37,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 427. [2018-09-23 19:31:37,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-09-23 19:31:37,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1051 transitions. [2018-09-23 19:31:37,022 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1051 transitions. Word has length 12 [2018-09-23 19:31:37,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:37,022 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 1051 transitions. [2018-09-23 19:31:37,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:31:37,023 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1051 transitions. [2018-09-23 19:31:37,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:37,023 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:37,023 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:37,024 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:37,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:37,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1736322548, now seen corresponding path program 1 times [2018-09-23 19:31:37,024 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:37,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:37,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:37,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:37,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:37,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:37,135 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:37,135 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:37,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:31:37,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:31:37,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:31:37,136 INFO L87 Difference]: Start difference. First operand 427 states and 1051 transitions. Second operand 9 states. [2018-09-23 19:31:39,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:39,706 INFO L93 Difference]: Finished difference Result 1127 states and 2616 transitions. [2018-09-23 19:31:39,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-23 19:31:39,709 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-23 19:31:39,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:39,715 INFO L225 Difference]: With dead ends: 1127 [2018-09-23 19:31:39,715 INFO L226 Difference]: Without dead ends: 1119 [2018-09-23 19:31:39,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-09-23 19:31:39,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-09-23 19:31:39,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 387. [2018-09-23 19:31:39,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-09-23 19:31:39,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 937 transitions. [2018-09-23 19:31:39,861 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 937 transitions. Word has length 12 [2018-09-23 19:31:39,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:39,861 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 937 transitions. [2018-09-23 19:31:39,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:31:39,862 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 937 transitions. [2018-09-23 19:31:39,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:39,862 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:39,863 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:39,863 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:39,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:39,864 INFO L82 PathProgramCache]: Analyzing trace with hash -608805552, now seen corresponding path program 1 times [2018-09-23 19:31:39,864 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:39,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:39,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:39,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:39,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:40,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:40,023 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:40,023 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:40,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:31:40,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:31:40,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:31:40,024 INFO L87 Difference]: Start difference. First operand 387 states and 937 transitions. Second operand 9 states. [2018-09-23 19:31:42,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:42,511 INFO L93 Difference]: Finished difference Result 975 states and 2260 transitions. [2018-09-23 19:31:42,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-23 19:31:42,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-23 19:31:42,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:42,517 INFO L225 Difference]: With dead ends: 975 [2018-09-23 19:31:42,517 INFO L226 Difference]: Without dead ends: 967 [2018-09-23 19:31:42,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-09-23 19:31:42,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2018-09-23 19:31:42,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 411. [2018-09-23 19:31:42,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-09-23 19:31:42,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1004 transitions. [2018-09-23 19:31:42,732 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1004 transitions. Word has length 12 [2018-09-23 19:31:42,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:42,733 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 1004 transitions. [2018-09-23 19:31:42,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:31:42,734 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1004 transitions. [2018-09-23 19:31:42,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:42,735 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:42,735 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:42,735 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:42,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:42,736 INFO L82 PathProgramCache]: Analyzing trace with hash -608703407, now seen corresponding path program 1 times [2018-09-23 19:31:42,736 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:42,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:42,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:42,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:42,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:42,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:42,846 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:42,846 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:42,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:31:42,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:31:42,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:31:42,847 INFO L87 Difference]: Start difference. First operand 411 states and 1004 transitions. Second operand 9 states. [2018-09-23 19:31:45,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:45,330 INFO L93 Difference]: Finished difference Result 1011 states and 2327 transitions. [2018-09-23 19:31:45,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-23 19:31:45,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-23 19:31:45,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:45,335 INFO L225 Difference]: With dead ends: 1011 [2018-09-23 19:31:45,335 INFO L226 Difference]: Without dead ends: 1003 [2018-09-23 19:31:45,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-09-23 19:31:45,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-09-23 19:31:45,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 391. [2018-09-23 19:31:45,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-09-23 19:31:45,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 944 transitions. [2018-09-23 19:31:45,516 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 944 transitions. Word has length 12 [2018-09-23 19:31:45,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:45,516 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 944 transitions. [2018-09-23 19:31:45,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:31:45,517 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 944 transitions. [2018-09-23 19:31:45,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:45,517 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:45,518 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:45,518 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:45,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:45,519 INFO L82 PathProgramCache]: Analyzing trace with hash -500853260, now seen corresponding path program 1 times [2018-09-23 19:31:45,519 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:45,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:45,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:45,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:45,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:45,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:45,656 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:45,656 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:45,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:31:45,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:31:45,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:31:45,658 INFO L87 Difference]: Start difference. First operand 391 states and 944 transitions. Second operand 9 states. [2018-09-23 19:31:47,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:47,834 INFO L93 Difference]: Finished difference Result 859 states and 1980 transitions. [2018-09-23 19:31:47,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-23 19:31:47,835 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-23 19:31:47,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:47,840 INFO L225 Difference]: With dead ends: 859 [2018-09-23 19:31:47,840 INFO L226 Difference]: Without dead ends: 851 [2018-09-23 19:31:47,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2018-09-23 19:31:47,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-09-23 19:31:48,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 381. [2018-09-23 19:31:48,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-23 19:31:48,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-09-23 19:31:48,012 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-09-23 19:31:48,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:48,012 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-09-23 19:31:48,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:31:48,012 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-09-23 19:31:48,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:48,013 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:48,013 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:48,013 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:48,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:48,014 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-09-23 19:31:48,014 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:48,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:48,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:48,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:48,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:48,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:48,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:48,087 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:48,087 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:48,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:31:48,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:31:48,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:31:48,088 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-09-23 19:31:50,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:50,368 INFO L93 Difference]: Finished difference Result 962 states and 2175 transitions. [2018-09-23 19:31:50,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-23 19:31:50,368 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 19:31:50,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:50,373 INFO L225 Difference]: With dead ends: 962 [2018-09-23 19:31:50,373 INFO L226 Difference]: Without dead ends: 954 [2018-09-23 19:31:50,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-09-23 19:31:50,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-09-23 19:31:50,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 504. [2018-09-23 19:31:50,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-09-23 19:31:50,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1236 transitions. [2018-09-23 19:31:50,593 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1236 transitions. Word has length 12 [2018-09-23 19:31:50,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:50,594 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 1236 transitions. [2018-09-23 19:31:50,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:31:50,594 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1236 transitions. [2018-09-23 19:31:50,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:50,595 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:50,595 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:50,596 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:50,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:50,596 INFO L82 PathProgramCache]: Analyzing trace with hash 192721184, now seen corresponding path program 1 times [2018-09-23 19:31:50,596 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:50,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:50,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:50,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:50,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:50,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:50,716 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:50,717 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:50,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:31:50,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:31:50,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:31:50,718 INFO L87 Difference]: Start difference. First operand 504 states and 1236 transitions. Second operand 8 states. [2018-09-23 19:31:53,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:53,395 INFO L93 Difference]: Finished difference Result 1064 states and 2409 transitions. [2018-09-23 19:31:53,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-23 19:31:53,395 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 19:31:53,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:53,401 INFO L225 Difference]: With dead ends: 1064 [2018-09-23 19:31:53,401 INFO L226 Difference]: Without dead ends: 1056 [2018-09-23 19:31:53,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2018-09-23 19:31:53,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2018-09-23 19:31:53,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 522. [2018-09-23 19:31:53,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-09-23 19:31:53,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1279 transitions. [2018-09-23 19:31:53,713 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1279 transitions. Word has length 12 [2018-09-23 19:31:53,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:53,713 INFO L480 AbstractCegarLoop]: Abstraction has 522 states and 1279 transitions. [2018-09-23 19:31:53,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:31:53,714 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1279 transitions. [2018-09-23 19:31:53,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:53,714 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:53,715 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:53,715 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:53,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:53,715 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-09-23 19:31:53,716 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:53,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:53,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:53,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:53,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:53,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:53,802 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:53,802 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:53,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:31:53,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:31:53,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:31:53,804 INFO L87 Difference]: Start difference. First operand 522 states and 1279 transitions. Second operand 8 states. [2018-09-23 19:31:56,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:56,995 INFO L93 Difference]: Finished difference Result 1241 states and 2843 transitions. [2018-09-23 19:31:56,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-23 19:31:56,996 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 19:31:56,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:57,001 INFO L225 Difference]: With dead ends: 1241 [2018-09-23 19:31:57,001 INFO L226 Difference]: Without dead ends: 1233 [2018-09-23 19:31:57,002 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-09-23 19:31:57,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2018-09-23 19:31:57,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 570. [2018-09-23 19:31:57,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-09-23 19:31:57,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1411 transitions. [2018-09-23 19:31:57,350 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1411 transitions. Word has length 12 [2018-09-23 19:31:57,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:31:57,351 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1411 transitions. [2018-09-23 19:31:57,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:31:57,351 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1411 transitions. [2018-09-23 19:31:57,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:31:57,352 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:31:57,352 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:31:57,352 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:31:57,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:31:57,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1424310915, now seen corresponding path program 1 times [2018-09-23 19:31:57,353 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:31:57,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:31:57,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:57,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:31:57,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:31:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:31:57,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:31:57,427 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:31:57,427 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:31:57,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:31:57,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:31:57,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:31:57,428 INFO L87 Difference]: Start difference. First operand 570 states and 1411 transitions. Second operand 8 states. [2018-09-23 19:31:59,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:31:59,768 INFO L93 Difference]: Finished difference Result 1139 states and 2639 transitions. [2018-09-23 19:31:59,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-23 19:31:59,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 19:31:59,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:31:59,775 INFO L225 Difference]: With dead ends: 1139 [2018-09-23 19:31:59,775 INFO L226 Difference]: Without dead ends: 1131 [2018-09-23 19:31:59,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-09-23 19:31:59,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-09-23 19:32:00,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 588. [2018-09-23 19:32:00,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-09-23 19:32:00,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1454 transitions. [2018-09-23 19:32:00,087 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1454 transitions. Word has length 12 [2018-09-23 19:32:00,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:00,087 INFO L480 AbstractCegarLoop]: Abstraction has 588 states and 1454 transitions. [2018-09-23 19:32:00,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:32:00,087 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1454 transitions. [2018-09-23 19:32:00,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:32:00,088 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:00,088 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:00,089 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:00,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:00,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1424311194, now seen corresponding path program 1 times [2018-09-23 19:32:00,089 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:00,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:00,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:00,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:00,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:00,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:00,391 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:00,392 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:32:00,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:32:00,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:32:00,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:32:00,393 INFO L87 Difference]: Start difference. First operand 588 states and 1454 transitions. Second operand 8 states. [2018-09-23 19:32:03,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:03,535 INFO L93 Difference]: Finished difference Result 1325 states and 3082 transitions. [2018-09-23 19:32:03,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-23 19:32:03,535 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 19:32:03,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:03,541 INFO L225 Difference]: With dead ends: 1325 [2018-09-23 19:32:03,541 INFO L226 Difference]: Without dead ends: 1317 [2018-09-23 19:32:03,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-09-23 19:32:03,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2018-09-23 19:32:03,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 573. [2018-09-23 19:32:03,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-09-23 19:32:03,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1417 transitions. [2018-09-23 19:32:03,871 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1417 transitions. Word has length 12 [2018-09-23 19:32:03,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:03,871 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 1417 transitions. [2018-09-23 19:32:03,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:32:03,871 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1417 transitions. [2018-09-23 19:32:03,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:32:03,872 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:03,872 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:03,873 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:03,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:03,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-09-23 19:32:03,873 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:03,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:03,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:03,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:03,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:03,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:03,948 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:03,948 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:32:03,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:32:03,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:32:03,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:32:03,949 INFO L87 Difference]: Start difference. First operand 573 states and 1417 transitions. Second operand 8 states. [2018-09-23 19:32:07,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:07,347 INFO L93 Difference]: Finished difference Result 1334 states and 3099 transitions. [2018-09-23 19:32:07,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-23 19:32:07,347 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 19:32:07,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:07,352 INFO L225 Difference]: With dead ends: 1334 [2018-09-23 19:32:07,353 INFO L226 Difference]: Without dead ends: 1326 [2018-09-23 19:32:07,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2018-09-23 19:32:07,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2018-09-23 19:32:07,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 579. [2018-09-23 19:32:07,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-09-23 19:32:07,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1431 transitions. [2018-09-23 19:32:07,700 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1431 transitions. Word has length 12 [2018-09-23 19:32:07,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:07,700 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 1431 transitions. [2018-09-23 19:32:07,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:32:07,700 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1431 transitions. [2018-09-23 19:32:07,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:32:07,701 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:07,701 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:07,701 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:07,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:07,702 INFO L82 PathProgramCache]: Analyzing trace with hash 725999160, now seen corresponding path program 1 times [2018-09-23 19:32:07,702 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:07,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:07,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:07,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:07,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:07,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:07,776 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:07,776 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:32:07,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:32:07,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:32:07,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:32:07,777 INFO L87 Difference]: Start difference. First operand 579 states and 1431 transitions. Second operand 8 states. [2018-09-23 19:32:09,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:09,757 INFO L93 Difference]: Finished difference Result 919 states and 2156 transitions. [2018-09-23 19:32:09,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-23 19:32:09,757 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 19:32:09,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:09,762 INFO L225 Difference]: With dead ends: 919 [2018-09-23 19:32:09,762 INFO L226 Difference]: Without dead ends: 911 [2018-09-23 19:32:09,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-09-23 19:32:09,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-09-23 19:32:10,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 570. [2018-09-23 19:32:10,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-09-23 19:32:10,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1404 transitions. [2018-09-23 19:32:10,120 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1404 transitions. Word has length 12 [2018-09-23 19:32:10,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:10,120 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1404 transitions. [2018-09-23 19:32:10,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:32:10,121 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1404 transitions. [2018-09-23 19:32:10,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:32:10,121 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:10,121 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:10,122 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:10,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:10,122 INFO L82 PathProgramCache]: Analyzing trace with hash 725999439, now seen corresponding path program 1 times [2018-09-23 19:32:10,122 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:10,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:10,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:10,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:10,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:10,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:10,206 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:10,206 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:32:10,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:32:10,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:32:10,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:32:10,207 INFO L87 Difference]: Start difference. First operand 570 states and 1404 transitions. Second operand 8 states. [2018-09-23 19:32:12,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:12,952 INFO L93 Difference]: Finished difference Result 1095 states and 2579 transitions. [2018-09-23 19:32:12,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-23 19:32:12,954 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 19:32:12,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:12,959 INFO L225 Difference]: With dead ends: 1095 [2018-09-23 19:32:12,959 INFO L226 Difference]: Without dead ends: 1087 [2018-09-23 19:32:12,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-09-23 19:32:12,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2018-09-23 19:32:13,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 555. [2018-09-23 19:32:13,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-09-23 19:32:13,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1367 transitions. [2018-09-23 19:32:13,333 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1367 transitions. Word has length 12 [2018-09-23 19:32:13,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:13,333 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 1367 transitions. [2018-09-23 19:32:13,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:32:13,333 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1367 transitions. [2018-09-23 19:32:13,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:32:13,334 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:13,334 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:13,334 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:13,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:13,335 INFO L82 PathProgramCache]: Analyzing trace with hash 729878996, now seen corresponding path program 1 times [2018-09-23 19:32:13,335 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:13,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:13,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:13,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:13,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:13,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:13,403 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:13,404 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:32:13,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:32:13,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:32:13,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:32:13,405 INFO L87 Difference]: Start difference. First operand 555 states and 1367 transitions. Second operand 8 states. [2018-09-23 19:32:17,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:17,164 INFO L93 Difference]: Finished difference Result 1304 states and 3052 transitions. [2018-09-23 19:32:17,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-23 19:32:17,165 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 19:32:17,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:17,169 INFO L225 Difference]: With dead ends: 1304 [2018-09-23 19:32:17,169 INFO L226 Difference]: Without dead ends: 1296 [2018-09-23 19:32:17,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-09-23 19:32:17,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-09-23 19:32:17,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 552. [2018-09-23 19:32:17,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-09-23 19:32:17,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1361 transitions. [2018-09-23 19:32:17,553 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1361 transitions. Word has length 12 [2018-09-23 19:32:17,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:17,553 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 1361 transitions. [2018-09-23 19:32:17,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:32:17,553 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1361 transitions. [2018-09-23 19:32:17,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:32:17,554 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:17,554 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:17,555 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:17,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:17,555 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-09-23 19:32:17,555 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:17,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:17,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:17,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:17,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:17,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:17,630 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:17,631 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:32:17,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:32:17,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:32:17,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:32:17,631 INFO L87 Difference]: Start difference. First operand 552 states and 1361 transitions. Second operand 8 states. [2018-09-23 19:32:20,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:20,915 INFO L93 Difference]: Finished difference Result 1192 states and 2790 transitions. [2018-09-23 19:32:20,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-23 19:32:20,915 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 19:32:20,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:20,918 INFO L225 Difference]: With dead ends: 1192 [2018-09-23 19:32:20,918 INFO L226 Difference]: Without dead ends: 1184 [2018-09-23 19:32:20,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2018-09-23 19:32:20,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2018-09-23 19:32:21,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 602. [2018-09-23 19:32:21,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-09-23 19:32:21,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-09-23 19:32:21,398 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-09-23 19:32:21,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:21,398 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-09-23 19:32:21,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:32:21,398 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-09-23 19:32:21,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-23 19:32:21,399 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:21,399 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:21,399 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:21,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:21,400 INFO L82 PathProgramCache]: Analyzing trace with hash 308305537, now seen corresponding path program 1 times [2018-09-23 19:32:21,400 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:21,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:21,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:21,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:21,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:21,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:21,448 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:21,448 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-23 19:32:21,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-23 19:32:21,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-23 19:32:21,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-23 19:32:21,449 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-09-23 19:32:22,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:22,274 INFO L93 Difference]: Finished difference Result 1139 states and 2816 transitions. [2018-09-23 19:32:22,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-23 19:32:22,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-23 19:32:22,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:22,276 INFO L225 Difference]: With dead ends: 1139 [2018-09-23 19:32:22,276 INFO L226 Difference]: Without dead ends: 625 [2018-09-23 19:32:22,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-23 19:32:22,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-09-23 19:32:22,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 602. [2018-09-23 19:32:22,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-09-23 19:32:22,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1415 transitions. [2018-09-23 19:32:22,757 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1415 transitions. Word has length 13 [2018-09-23 19:32:22,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:22,757 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1415 transitions. [2018-09-23 19:32:22,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-23 19:32:22,758 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1415 transitions. [2018-09-23 19:32:22,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-23 19:32:22,758 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:22,758 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:22,759 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:22,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:22,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1757679849, now seen corresponding path program 1 times [2018-09-23 19:32:22,759 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:22,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:22,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:22,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:22,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:22,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:22,859 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:32:22,859 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-09-23 19:32:22,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:22,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:32:23,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:23,828 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:32:23,828 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-23 19:32:23,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-23 19:32:23,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-23 19:32:23,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-09-23 19:32:23,829 INFO L87 Difference]: Start difference. First operand 602 states and 1415 transitions. Second operand 16 states. [2018-09-23 19:32:27,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:27,163 INFO L93 Difference]: Finished difference Result 794 states and 1860 transitions. [2018-09-23 19:32:27,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-23 19:32:27,163 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-09-23 19:32:27,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:27,165 INFO L225 Difference]: With dead ends: 794 [2018-09-23 19:32:27,165 INFO L226 Difference]: Without dead ends: 789 [2018-09-23 19:32:27,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-09-23 19:32:27,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-09-23 19:32:27,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 664. [2018-09-23 19:32:27,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-09-23 19:32:27,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1563 transitions. [2018-09-23 19:32:27,878 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1563 transitions. Word has length 13 [2018-09-23 19:32:27,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:27,878 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 1563 transitions. [2018-09-23 19:32:27,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-23 19:32:27,878 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1563 transitions. [2018-09-23 19:32:27,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-23 19:32:27,878 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:27,879 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:27,879 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:27,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:27,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1161218619, now seen corresponding path program 1 times [2018-09-23 19:32:27,879 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:27,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:27,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:27,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:27,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:27,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:27,924 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:27,924 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-23 19:32:27,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-23 19:32:27,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-23 19:32:27,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-23 19:32:27,925 INFO L87 Difference]: Start difference. First operand 664 states and 1563 transitions. Second operand 5 states. [2018-09-23 19:32:29,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:29,420 INFO L93 Difference]: Finished difference Result 1317 states and 3113 transitions. [2018-09-23 19:32:29,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-23 19:32:29,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-23 19:32:29,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:29,422 INFO L225 Difference]: With dead ends: 1317 [2018-09-23 19:32:29,422 INFO L226 Difference]: Without dead ends: 729 [2018-09-23 19:32:29,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-23 19:32:29,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-09-23 19:32:30,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 690. [2018-09-23 19:32:30,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-09-23 19:32:30,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-09-23 19:32:30,145 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-09-23 19:32:30,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:30,145 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-09-23 19:32:30,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-23 19:32:30,146 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-09-23 19:32:30,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:32:30,146 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:30,146 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:30,147 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:30,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:30,147 INFO L82 PathProgramCache]: Analyzing trace with hash -942981820, now seen corresponding path program 1 times [2018-09-23 19:32:30,147 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:30,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:30,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:30,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:30,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:30,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:30,223 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:30,223 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:32:30,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:32:30,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:32:30,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:32:30,224 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 8 states. [2018-09-23 19:32:33,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:33,678 INFO L93 Difference]: Finished difference Result 1435 states and 3122 transitions. [2018-09-23 19:32:33,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-23 19:32:33,678 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-23 19:32:33,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:33,681 INFO L225 Difference]: With dead ends: 1435 [2018-09-23 19:32:33,682 INFO L226 Difference]: Without dead ends: 1427 [2018-09-23 19:32:33,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-09-23 19:32:33,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2018-09-23 19:32:34,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 789. [2018-09-23 19:32:34,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-09-23 19:32:34,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1779 transitions. [2018-09-23 19:32:34,608 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1779 transitions. Word has length 16 [2018-09-23 19:32:34,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:34,608 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 1779 transitions. [2018-09-23 19:32:34,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:32:34,608 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1779 transitions. [2018-09-23 19:32:34,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:32:34,609 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:34,609 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:34,610 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:34,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:34,610 INFO L82 PathProgramCache]: Analyzing trace with hash -945782174, now seen corresponding path program 1 times [2018-09-23 19:32:34,610 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:34,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:34,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:34,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:34,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:34,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:34,863 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:34,863 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:32:34,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:32:34,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:32:34,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:32:34,864 INFO L87 Difference]: Start difference. First operand 789 states and 1779 transitions. Second operand 8 states. [2018-09-23 19:32:38,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:38,621 INFO L93 Difference]: Finished difference Result 1599 states and 3473 transitions. [2018-09-23 19:32:38,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-23 19:32:38,621 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-23 19:32:38,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:38,626 INFO L225 Difference]: With dead ends: 1599 [2018-09-23 19:32:38,626 INFO L226 Difference]: Without dead ends: 1591 [2018-09-23 19:32:38,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-09-23 19:32:38,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-09-23 19:32:39,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 821. [2018-09-23 19:32:39,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-09-23 19:32:39,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1853 transitions. [2018-09-23 19:32:39,568 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1853 transitions. Word has length 16 [2018-09-23 19:32:39,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:39,568 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1853 transitions. [2018-09-23 19:32:39,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:32:39,568 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1853 transitions. [2018-09-23 19:32:39,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:32:39,569 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:39,569 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:39,569 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:39,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:39,570 INFO L82 PathProgramCache]: Analyzing trace with hash -945680029, now seen corresponding path program 1 times [2018-09-23 19:32:39,570 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:39,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:39,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:39,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:39,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:39,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:39,648 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:39,649 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:32:39,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:32:39,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:32:39,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:32:39,649 INFO L87 Difference]: Start difference. First operand 821 states and 1853 transitions. Second operand 8 states. [2018-09-23 19:32:42,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:42,816 INFO L93 Difference]: Finished difference Result 1411 states and 3060 transitions. [2018-09-23 19:32:42,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-23 19:32:42,816 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-23 19:32:42,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:42,820 INFO L225 Difference]: With dead ends: 1411 [2018-09-23 19:32:42,820 INFO L226 Difference]: Without dead ends: 1403 [2018-09-23 19:32:42,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-09-23 19:32:42,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2018-09-23 19:32:43,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 823. [2018-09-23 19:32:43,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-09-23 19:32:43,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1851 transitions. [2018-09-23 19:32:43,632 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1851 transitions. Word has length 16 [2018-09-23 19:32:43,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:43,632 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1851 transitions. [2018-09-23 19:32:43,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:32:43,632 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1851 transitions. [2018-09-23 19:32:43,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:32:43,633 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:43,633 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:43,633 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:43,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:43,634 INFO L82 PathProgramCache]: Analyzing trace with hash -648408412, now seen corresponding path program 1 times [2018-09-23 19:32:43,634 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:43,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:43,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:43,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:43,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:43,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:43,773 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:43,774 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:32:43,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:32:43,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:32:43,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:32:43,774 INFO L87 Difference]: Start difference. First operand 823 states and 1851 transitions. Second operand 8 states. [2018-09-23 19:32:47,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:47,311 INFO L93 Difference]: Finished difference Result 1490 states and 3255 transitions. [2018-09-23 19:32:47,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-23 19:32:47,311 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-23 19:32:47,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:47,315 INFO L225 Difference]: With dead ends: 1490 [2018-09-23 19:32:47,315 INFO L226 Difference]: Without dead ends: 1482 [2018-09-23 19:32:47,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-09-23 19:32:47,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2018-09-23 19:32:48,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 943. [2018-09-23 19:32:48,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2018-09-23 19:32:48,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 2141 transitions. [2018-09-23 19:32:48,382 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 2141 transitions. Word has length 16 [2018-09-23 19:32:48,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:48,382 INFO L480 AbstractCegarLoop]: Abstraction has 943 states and 2141 transitions. [2018-09-23 19:32:48,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:32:48,382 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 2141 transitions. [2018-09-23 19:32:48,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:32:48,382 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:48,383 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:48,383 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:48,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:48,383 INFO L82 PathProgramCache]: Analyzing trace with hash -648306267, now seen corresponding path program 1 times [2018-09-23 19:32:48,384 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:48,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:48,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:48,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:48,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:48,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:48,465 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:48,465 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:32:48,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:32:48,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:32:48,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:32:48,466 INFO L87 Difference]: Start difference. First operand 943 states and 2141 transitions. Second operand 8 states. [2018-09-23 19:32:51,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:51,872 INFO L93 Difference]: Finished difference Result 1427 states and 3102 transitions. [2018-09-23 19:32:51,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-23 19:32:51,873 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-23 19:32:51,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:51,875 INFO L225 Difference]: With dead ends: 1427 [2018-09-23 19:32:51,875 INFO L226 Difference]: Without dead ends: 1419 [2018-09-23 19:32:51,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-09-23 19:32:51,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2018-09-23 19:32:52,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 927. [2018-09-23 19:32:52,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-09-23 19:32:52,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2109 transitions. [2018-09-23 19:32:52,748 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2109 transitions. Word has length 16 [2018-09-23 19:32:52,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:52,748 INFO L480 AbstractCegarLoop]: Abstraction has 927 states and 2109 transitions. [2018-09-23 19:32:52,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:32:52,748 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2109 transitions. [2018-09-23 19:32:52,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:32:52,749 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:52,749 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:52,750 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:52,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:52,750 INFO L82 PathProgramCache]: Analyzing trace with hash -639392031, now seen corresponding path program 1 times [2018-09-23 19:32:52,750 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:52,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:52,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:52,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:52,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:32:52,828 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:32:52,829 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 19:32:52,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:32:52,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:32:52,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:32:52,829 INFO L87 Difference]: Start difference. First operand 927 states and 2109 transitions. Second operand 8 states. [2018-09-23 19:32:56,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:32:56,098 INFO L93 Difference]: Finished difference Result 1306 states and 2848 transitions. [2018-09-23 19:32:56,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-23 19:32:56,098 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-23 19:32:56,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:32:56,100 INFO L225 Difference]: With dead ends: 1306 [2018-09-23 19:32:56,101 INFO L226 Difference]: Without dead ends: 1298 [2018-09-23 19:32:56,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-09-23 19:32:56,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2018-09-23 19:32:57,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 986. [2018-09-23 19:32:57,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-09-23 19:32:57,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2232 transitions. [2018-09-23 19:32:57,107 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2232 transitions. Word has length 16 [2018-09-23 19:32:57,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:32:57,107 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2232 transitions. [2018-09-23 19:32:57,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:32:57,107 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2232 transitions. [2018-09-23 19:32:57,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:32:57,108 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:32:57,108 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:32:57,108 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:32:57,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:32:57,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1639330009, now seen corresponding path program 1 times [2018-09-23 19:32:57,109 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:32:57,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:32:57,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:57,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:57,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:32:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:57,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 19:32:57,171 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:32:57,171 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-09-23 19:32:57,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:32:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:32:57,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:32:57,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 19:32:57,222 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:32:57,222 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-23 19:32:57,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:32:57,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:32:57,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:32:57,223 INFO L87 Difference]: Start difference. First operand 986 states and 2232 transitions. Second operand 8 states. [2018-09-23 19:33:00,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:33:00,403 INFO L93 Difference]: Finished difference Result 1285 states and 2841 transitions. [2018-09-23 19:33:00,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-23 19:33:00,403 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-23 19:33:00,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:33:00,405 INFO L225 Difference]: With dead ends: 1285 [2018-09-23 19:33:00,406 INFO L226 Difference]: Without dead ends: 1277 [2018-09-23 19:33:00,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2018-09-23 19:33:00,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2018-09-23 19:33:01,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 986. [2018-09-23 19:33:01,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-09-23 19:33:01,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2231 transitions. [2018-09-23 19:33:01,421 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2231 transitions. Word has length 16 [2018-09-23 19:33:01,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:33:01,421 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2231 transitions. [2018-09-23 19:33:01,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:33:01,421 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2231 transitions. [2018-09-23 19:33:01,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:33:01,422 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:33:01,422 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:33:01,422 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:33:01,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:33:01,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1609777337, now seen corresponding path program 1 times [2018-09-23 19:33:01,423 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:33:01,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:33:01,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:01,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:01,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:01,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 19:33:01,500 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:33:01,500 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-09-23 19:33:01,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:01,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:33:01,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 19:33:01,551 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:33:01,551 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-23 19:33:01,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:33:01,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:33:01,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:33:01,552 INFO L87 Difference]: Start difference. First operand 986 states and 2231 transitions. Second operand 8 states. [2018-09-23 19:33:05,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:33:05,309 INFO L93 Difference]: Finished difference Result 1518 states and 3315 transitions. [2018-09-23 19:33:05,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-23 19:33:05,309 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-23 19:33:05,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:33:05,311 INFO L225 Difference]: With dead ends: 1518 [2018-09-23 19:33:05,311 INFO L226 Difference]: Without dead ends: 1510 [2018-09-23 19:33:05,312 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2018-09-23 19:33:05,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-09-23 19:33:06,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 977. [2018-09-23 19:33:06,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2018-09-23 19:33:06,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 2210 transitions. [2018-09-23 19:33:06,409 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 2210 transitions. Word has length 16 [2018-09-23 19:33:06,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:33:06,409 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 2210 transitions. [2018-09-23 19:33:06,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:33:06,409 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 2210 transitions. [2018-09-23 19:33:06,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:33:06,410 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:33:06,410 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:33:06,410 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:33:06,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:33:06,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1612577691, now seen corresponding path program 1 times [2018-09-23 19:33:06,411 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:33:06,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:33:06,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:06,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:06,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:06,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 19:33:06,670 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:33:06,670 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-09-23 19:33:06,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:06,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:33:06,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 19:33:06,728 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:33:06,728 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-23 19:33:06,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:33:06,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:33:06,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:33:06,729 INFO L87 Difference]: Start difference. First operand 977 states and 2210 transitions. Second operand 8 states. [2018-09-23 19:33:10,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:33:10,497 INFO L93 Difference]: Finished difference Result 1448 states and 3170 transitions. [2018-09-23 19:33:10,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-23 19:33:10,497 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-23 19:33:10,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:33:10,499 INFO L225 Difference]: With dead ends: 1448 [2018-09-23 19:33:10,499 INFO L226 Difference]: Without dead ends: 1440 [2018-09-23 19:33:10,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2018-09-23 19:33:10,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2018-09-23 19:33:11,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 941. [2018-09-23 19:33:11,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-09-23 19:33:11,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 2120 transitions. [2018-09-23 19:33:11,573 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 2120 transitions. Word has length 16 [2018-09-23 19:33:11,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:33:11,573 INFO L480 AbstractCegarLoop]: Abstraction has 941 states and 2120 transitions. [2018-09-23 19:33:11,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:33:11,573 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 2120 transitions. [2018-09-23 19:33:11,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:33:11,574 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:33:11,574 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:33:11,575 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:33:11,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:33:11,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1612475546, now seen corresponding path program 1 times [2018-09-23 19:33:11,575 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:33:11,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:33:11,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:11,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:11,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:12,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 19:33:12,210 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:33:12,211 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-09-23 19:33:12,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:12,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:33:12,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 19:33:12,259 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:33:12,259 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-23 19:33:12,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 19:33:12,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 19:33:12,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:33:12,260 INFO L87 Difference]: Start difference. First operand 941 states and 2120 transitions. Second operand 8 states. [2018-09-23 19:33:15,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:33:15,447 INFO L93 Difference]: Finished difference Result 1254 states and 2743 transitions. [2018-09-23 19:33:15,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-23 19:33:15,447 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-23 19:33:15,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:33:15,449 INFO L225 Difference]: With dead ends: 1254 [2018-09-23 19:33:15,449 INFO L226 Difference]: Without dead ends: 1246 [2018-09-23 19:33:15,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-09-23 19:33:15,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2018-09-23 19:33:16,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 896. [2018-09-23 19:33:16,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-09-23 19:33:16,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 2017 transitions. [2018-09-23 19:33:16,358 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 2017 transitions. Word has length 16 [2018-09-23 19:33:16,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:33:16,359 INFO L480 AbstractCegarLoop]: Abstraction has 896 states and 2017 transitions. [2018-09-23 19:33:16,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 19:33:16,359 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 2017 transitions. [2018-09-23 19:33:16,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:33:16,360 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:33:16,360 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:33:16,360 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:33:16,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:33:16,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1200558936, now seen corresponding path program 1 times [2018-09-23 19:33:16,361 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:33:16,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:33:16,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:16,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:16,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:16,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:16,455 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:33:16,455 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-23 19:33:16,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:16,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:33:16,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:16,819 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:33:16,819 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-23 19:33:16,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-23 19:33:16,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-23 19:33:16,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-09-23 19:33:16,820 INFO L87 Difference]: Start difference. First operand 896 states and 2017 transitions. Second operand 17 states. [2018-09-23 19:33:21,235 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-23 19:33:22,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:33:22,912 INFO L93 Difference]: Finished difference Result 1278 states and 2792 transitions. [2018-09-23 19:33:22,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-23 19:33:22,912 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-23 19:33:22,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:33:22,914 INFO L225 Difference]: With dead ends: 1278 [2018-09-23 19:33:22,914 INFO L226 Difference]: Without dead ends: 1270 [2018-09-23 19:33:22,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=519, Invalid=2133, Unknown=0, NotChecked=0, Total=2652 [2018-09-23 19:33:22,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2018-09-23 19:33:23,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 970. [2018-09-23 19:33:23,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2018-09-23 19:33:23,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 2200 transitions. [2018-09-23 19:33:23,956 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 2200 transitions. Word has length 16 [2018-09-23 19:33:23,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:33:23,956 INFO L480 AbstractCegarLoop]: Abstraction has 970 states and 2200 transitions. [2018-09-23 19:33:23,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-23 19:33:23,956 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 2200 transitions. [2018-09-23 19:33:23,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:33:23,957 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:33:23,957 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:33:23,957 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:33:23,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:33:23,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257424, now seen corresponding path program 1 times [2018-09-23 19:33:23,957 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:33:23,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:33:23,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:23,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:23,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:24,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:24,033 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:33:24,033 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-23 19:33:24,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:33:24,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:33:24,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:33:24,034 INFO L87 Difference]: Start difference. First operand 970 states and 2200 transitions. Second operand 9 states. [2018-09-23 19:33:27,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:33:27,362 INFO L93 Difference]: Finished difference Result 1180 states and 2573 transitions. [2018-09-23 19:33:27,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-23 19:33:27,362 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-23 19:33:27,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:33:27,364 INFO L225 Difference]: With dead ends: 1180 [2018-09-23 19:33:27,364 INFO L226 Difference]: Without dead ends: 1172 [2018-09-23 19:33:27,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2018-09-23 19:33:27,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2018-09-23 19:33:28,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 948. [2018-09-23 19:33:28,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2018-09-23 19:33:28,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 2144 transitions. [2018-09-23 19:33:28,475 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 2144 transitions. Word has length 16 [2018-09-23 19:33:28,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:33:28,475 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 2144 transitions. [2018-09-23 19:33:28,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:33:28,475 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 2144 transitions. [2018-09-23 19:33:28,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:33:28,476 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:33:28,476 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:33:28,476 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:33:28,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:33:28,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257145, now seen corresponding path program 1 times [2018-09-23 19:33:28,476 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:33:28,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:33:28,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:28,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:28,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:28,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:28,996 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:33:28,996 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-23 19:33:28,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:33:28,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:33:28,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:33:28,997 INFO L87 Difference]: Start difference. First operand 948 states and 2144 transitions. Second operand 9 states. [2018-09-23 19:33:32,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:33:32,715 INFO L93 Difference]: Finished difference Result 1233 states and 2705 transitions. [2018-09-23 19:33:32,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-23 19:33:32,716 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-23 19:33:32,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:33:32,717 INFO L225 Difference]: With dead ends: 1233 [2018-09-23 19:33:32,717 INFO L226 Difference]: Without dead ends: 1225 [2018-09-23 19:33:32,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2018-09-23 19:33:32,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2018-09-23 19:33:33,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 966. [2018-09-23 19:33:33,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-09-23 19:33:33,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 2192 transitions. [2018-09-23 19:33:33,882 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 2192 transitions. Word has length 16 [2018-09-23 19:33:33,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:33:33,883 INFO L480 AbstractCegarLoop]: Abstraction has 966 states and 2192 transitions. [2018-09-23 19:33:33,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:33:33,883 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 2192 transitions. [2018-09-23 19:33:33,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:33:33,883 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:33:33,884 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:33:33,884 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:33:33,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:33:33,884 INFO L82 PathProgramCache]: Analyzing trace with hash -2004746308, now seen corresponding path program 1 times [2018-09-23 19:33:33,884 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:33:33,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:33:33,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:33,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:33,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:33,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:33,958 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:33:33,958 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-23 19:33:33,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:33:33,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:33:33,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:33:33,959 INFO L87 Difference]: Start difference. First operand 966 states and 2192 transitions. Second operand 9 states. [2018-09-23 19:33:38,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:33:38,269 INFO L93 Difference]: Finished difference Result 1537 states and 3410 transitions. [2018-09-23 19:33:38,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-23 19:33:38,270 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-23 19:33:38,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:33:38,271 INFO L225 Difference]: With dead ends: 1537 [2018-09-23 19:33:38,271 INFO L226 Difference]: Without dead ends: 1529 [2018-09-23 19:33:38,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=824, Unknown=0, NotChecked=0, Total=1056 [2018-09-23 19:33:38,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2018-09-23 19:33:39,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1013. [2018-09-23 19:33:39,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2018-09-23 19:33:39,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 2297 transitions. [2018-09-23 19:33:39,408 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 2297 transitions. Word has length 16 [2018-09-23 19:33:39,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:33:39,409 INFO L480 AbstractCegarLoop]: Abstraction has 1013 states and 2297 transitions. [2018-09-23 19:33:39,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:33:39,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 2297 transitions. [2018-09-23 19:33:39,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:33:39,409 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:33:39,409 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:33:39,410 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:33:39,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:33:39,410 INFO L82 PathProgramCache]: Analyzing trace with hash -35185992, now seen corresponding path program 1 times [2018-09-23 19:33:39,410 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:33:39,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:33:39,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:39,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:39,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:39,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:39,505 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:33:39,505 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-23 19:33:39,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:33:39,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:33:39,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:33:39,506 INFO L87 Difference]: Start difference. First operand 1013 states and 2297 transitions. Second operand 9 states. [2018-09-23 19:33:44,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:33:44,193 INFO L93 Difference]: Finished difference Result 1590 states and 3484 transitions. [2018-09-23 19:33:44,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-23 19:33:44,194 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-23 19:33:44,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:33:44,196 INFO L225 Difference]: With dead ends: 1590 [2018-09-23 19:33:44,196 INFO L226 Difference]: Without dead ends: 1582 [2018-09-23 19:33:44,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=730, Unknown=0, NotChecked=0, Total=930 [2018-09-23 19:33:44,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2018-09-23 19:33:45,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1020. [2018-09-23 19:33:45,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2018-09-23 19:33:45,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 2311 transitions. [2018-09-23 19:33:45,466 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 2311 transitions. Word has length 16 [2018-09-23 19:33:45,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:33:45,467 INFO L480 AbstractCegarLoop]: Abstraction has 1020 states and 2311 transitions. [2018-09-23 19:33:45,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:33:45,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 2311 transitions. [2018-09-23 19:33:45,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:33:45,467 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:33:45,467 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:33:45,468 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:33:45,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:33:45,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1174622531, now seen corresponding path program 1 times [2018-09-23 19:33:45,468 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:33:45,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:33:45,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:45,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:45,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:45,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:45,544 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:33:45,544 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-09-23 19:33:45,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:45,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:33:45,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:45,692 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:33:45,692 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-23 19:33:45,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-23 19:33:45,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-23 19:33:45,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-23 19:33:45,693 INFO L87 Difference]: Start difference. First operand 1020 states and 2311 transitions. Second operand 17 states. [2018-09-23 19:33:55,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:33:55,479 INFO L93 Difference]: Finished difference Result 1949 states and 4288 transitions. [2018-09-23 19:33:55,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-23 19:33:55,479 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-23 19:33:55,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:33:55,481 INFO L225 Difference]: With dead ends: 1949 [2018-09-23 19:33:55,481 INFO L226 Difference]: Without dead ends: 1941 [2018-09-23 19:33:55,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2996 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1453, Invalid=7667, Unknown=0, NotChecked=0, Total=9120 [2018-09-23 19:33:55,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2018-09-23 19:33:56,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1031. [2018-09-23 19:33:56,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2018-09-23 19:33:56,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 2337 transitions. [2018-09-23 19:33:56,766 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 2337 transitions. Word has length 16 [2018-09-23 19:33:56,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:33:56,766 INFO L480 AbstractCegarLoop]: Abstraction has 1031 states and 2337 transitions. [2018-09-23 19:33:56,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-23 19:33:56,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 2337 transitions. [2018-09-23 19:33:56,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:33:56,767 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:33:56,767 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:33:56,768 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:33:56,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:33:56,768 INFO L82 PathProgramCache]: Analyzing trace with hash 913888237, now seen corresponding path program 1 times [2018-09-23 19:33:56,768 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:33:56,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:33:56,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:56,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:33:56,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:33:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:33:57,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:33:57,143 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:33:57,143 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-23 19:33:57,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 19:33:57,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 19:33:57,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-23 19:33:57,144 INFO L87 Difference]: Start difference. First operand 1031 states and 2337 transitions. Second operand 9 states. [2018-09-23 19:34:01,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:34:01,507 INFO L93 Difference]: Finished difference Result 1420 states and 3128 transitions. [2018-09-23 19:34:01,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-23 19:34:01,507 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-23 19:34:01,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:34:01,509 INFO L225 Difference]: With dead ends: 1420 [2018-09-23 19:34:01,509 INFO L226 Difference]: Without dead ends: 1412 [2018-09-23 19:34:01,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2018-09-23 19:34:01,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2018-09-23 19:34:02,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 963. [2018-09-23 19:34:02,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2018-09-23 19:34:02,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 2173 transitions. [2018-09-23 19:34:02,798 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 2173 transitions. Word has length 16 [2018-09-23 19:34:02,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:34:02,798 INFO L480 AbstractCegarLoop]: Abstraction has 963 states and 2173 transitions. [2018-09-23 19:34:02,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 19:34:02,798 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 2173 transitions. [2018-09-23 19:34:02,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:34:02,798 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:34:02,799 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:34:02,799 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:34:02,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:34:02,799 INFO L82 PathProgramCache]: Analyzing trace with hash 2123696760, now seen corresponding path program 1 times [2018-09-23 19:34:02,799 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:34:02,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:34:02,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:02,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:34:02,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:02,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:34:02,872 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:34:02,872 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-09-23 19:34:02,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:34:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:02,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:34:03,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:34:03,030 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:34:03,031 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-23 19:34:03,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-23 19:34:03,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-23 19:34:03,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-23 19:34:03,032 INFO L87 Difference]: Start difference. First operand 963 states and 2173 transitions. Second operand 17 states. [2018-09-23 19:34:16,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:34:16,331 INFO L93 Difference]: Finished difference Result 2767 states and 6075 transitions. [2018-09-23 19:34:16,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-09-23 19:34:16,331 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-23 19:34:16,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:34:16,334 INFO L225 Difference]: With dead ends: 2767 [2018-09-23 19:34:16,334 INFO L226 Difference]: Without dead ends: 2759 [2018-09-23 19:34:16,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6116 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2425, Invalid=14867, Unknown=0, NotChecked=0, Total=17292 [2018-09-23 19:34:16,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2018-09-23 19:34:17,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 1094. [2018-09-23 19:34:17,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2018-09-23 19:34:17,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 2474 transitions. [2018-09-23 19:34:17,877 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 2474 transitions. Word has length 16 [2018-09-23 19:34:17,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:34:17,878 INFO L480 AbstractCegarLoop]: Abstraction has 1094 states and 2474 transitions. [2018-09-23 19:34:17,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-23 19:34:17,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 2474 transitions. [2018-09-23 19:34:17,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 19:34:17,879 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:34:17,879 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:34:17,879 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:34:17,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:34:17,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1400694311, now seen corresponding path program 1 times [2018-09-23 19:34:17,880 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:34:17,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:34:17,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:17,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:34:17,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:34:17,981 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:34:17,982 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-09-23 19:34:17,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:34:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:17,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:34:18,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:34:18,173 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:34:18,174 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-23 19:34:18,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-23 19:34:18,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-23 19:34:18,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-23 19:34:18,174 INFO L87 Difference]: Start difference. First operand 1094 states and 2474 transitions. Second operand 17 states. [2018-09-23 19:34:31,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:34:31,999 INFO L93 Difference]: Finished difference Result 2361 states and 5206 transitions. [2018-09-23 19:34:32,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-23 19:34:32,000 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-23 19:34:32,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:34:32,002 INFO L225 Difference]: With dead ends: 2361 [2018-09-23 19:34:32,002 INFO L226 Difference]: Without dead ends: 2353 [2018-09-23 19:34:32,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9524 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3069, Invalid=22371, Unknown=0, NotChecked=0, Total=25440 [2018-09-23 19:34:32,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2018-09-23 19:34:33,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 1155. [2018-09-23 19:34:33,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1155 states. [2018-09-23 19:34:33,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 2607 transitions. [2018-09-23 19:34:33,672 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 2607 transitions. Word has length 16 [2018-09-23 19:34:33,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:34:33,673 INFO L480 AbstractCegarLoop]: Abstraction has 1155 states and 2607 transitions. [2018-09-23 19:34:33,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-23 19:34:33,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 2607 transitions. [2018-09-23 19:34:33,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-23 19:34:33,673 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:34:33,673 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:34:33,674 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:34:33,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:34:33,674 INFO L82 PathProgramCache]: Analyzing trace with hash 417107387, now seen corresponding path program 1 times [2018-09-23 19:34:33,674 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:34:33,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:34:33,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:33,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:34:33,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:33,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:34:33,830 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:34:33,831 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-09-23 19:34:33,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:34:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:33,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:34:33,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:34:33,943 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:34:33,943 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-09-23 19:34:33,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-23 19:34:33,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-23 19:34:33,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-09-23 19:34:33,944 INFO L87 Difference]: Start difference. First operand 1155 states and 2607 transitions. Second operand 14 states. [2018-09-23 19:34:36,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:34:36,872 INFO L93 Difference]: Finished difference Result 1507 states and 3367 transitions. [2018-09-23 19:34:36,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-23 19:34:36,872 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2018-09-23 19:34:36,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:34:36,874 INFO L225 Difference]: With dead ends: 1507 [2018-09-23 19:34:36,874 INFO L226 Difference]: Without dead ends: 1502 [2018-09-23 19:34:36,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-09-23 19:34:36,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2018-09-23 19:34:38,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1339. [2018-09-23 19:34:38,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2018-09-23 19:34:38,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2995 transitions. [2018-09-23 19:34:38,775 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2995 transitions. Word has length 17 [2018-09-23 19:34:38,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:34:38,775 INFO L480 AbstractCegarLoop]: Abstraction has 1339 states and 2995 transitions. [2018-09-23 19:34:38,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-23 19:34:38,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2995 transitions. [2018-09-23 19:34:38,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-23 19:34:38,776 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:34:38,776 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:34:38,777 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:34:38,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:34:38,777 INFO L82 PathProgramCache]: Analyzing trace with hash 524852653, now seen corresponding path program 1 times [2018-09-23 19:34:38,777 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:34:38,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:34:38,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:38,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:34:38,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:38,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:34:38,895 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:34:38,895 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-09-23 19:34:38,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:34:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:38,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:34:39,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:34:39,578 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:34:39,578 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 18 [2018-09-23 19:34:39,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-23 19:34:39,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-23 19:34:39,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-09-23 19:34:39,579 INFO L87 Difference]: Start difference. First operand 1339 states and 2995 transitions. Second operand 19 states. [2018-09-23 19:34:40,183 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-09-23 19:34:50,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:34:50,420 INFO L93 Difference]: Finished difference Result 3654 states and 8066 transitions. [2018-09-23 19:34:50,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-23 19:34:50,420 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2018-09-23 19:34:50,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:34:50,424 INFO L225 Difference]: With dead ends: 3654 [2018-09-23 19:34:50,424 INFO L226 Difference]: Without dead ends: 3646 [2018-09-23 19:34:50,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1127, Invalid=3703, Unknown=0, NotChecked=0, Total=4830 [2018-09-23 19:34:50,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3646 states. [2018-09-23 19:34:53,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3646 to 2136. [2018-09-23 19:34:53,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2136 states. [2018-09-23 19:34:53,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 4855 transitions. [2018-09-23 19:34:53,558 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 4855 transitions. Word has length 17 [2018-09-23 19:34:53,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:34:53,559 INFO L480 AbstractCegarLoop]: Abstraction has 2136 states and 4855 transitions. [2018-09-23 19:34:53,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-23 19:34:53,559 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 4855 transitions. [2018-09-23 19:34:53,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-23 19:34:53,560 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:34:53,560 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:34:53,560 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:34:53,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:34:53,560 INFO L82 PathProgramCache]: Analyzing trace with hash -405945350, now seen corresponding path program 1 times [2018-09-23 19:34:53,560 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:34:53,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:34:53,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:53,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:34:53,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:34:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:53,645 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 19:34:53,646 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:34:53,646 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-09-23 19:34:53,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:34:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:34:53,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:34:53,708 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 19:34:53,729 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:34:53,729 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-23 19:34:53,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-23 19:34:53,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-23 19:34:53,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-23 19:34:53,730 INFO L87 Difference]: Start difference. First operand 2136 states and 4855 transitions. Second operand 11 states. [2018-09-23 19:34:59,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:34:59,467 INFO L93 Difference]: Finished difference Result 2767 states and 6209 transitions. [2018-09-23 19:34:59,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-23 19:34:59,468 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-23 19:34:59,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:34:59,471 INFO L225 Difference]: With dead ends: 2767 [2018-09-23 19:34:59,471 INFO L226 Difference]: Without dead ends: 2759 [2018-09-23 19:34:59,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2018-09-23 19:34:59,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2018-09-23 19:35:02,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 2216. [2018-09-23 19:35:02,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2018-09-23 19:35:02,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 5027 transitions. [2018-09-23 19:35:02,391 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 5027 transitions. Word has length 20 [2018-09-23 19:35:02,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:35:02,391 INFO L480 AbstractCegarLoop]: Abstraction has 2216 states and 5027 transitions. [2018-09-23 19:35:02,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-23 19:35:02,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 5027 transitions. [2018-09-23 19:35:02,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-23 19:35:02,392 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:35:02,392 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:35:02,392 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:35:02,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:35:02,392 INFO L82 PathProgramCache]: Analyzing trace with hash -408745704, now seen corresponding path program 1 times [2018-09-23 19:35:02,392 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:35:02,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:35:02,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:35:02,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:35:02,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:35:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:35:02,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 19:35:02,481 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:35:02,481 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-09-23 19:35:02,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:35:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:35:02,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:35:02,715 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 19:35:02,735 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:35:02,736 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-23 19:35:02,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-23 19:35:02,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-23 19:35:02,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-23 19:35:02,736 INFO L87 Difference]: Start difference. First operand 2216 states and 5027 transitions. Second operand 11 states. [2018-09-23 19:35:09,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:35:09,201 INFO L93 Difference]: Finished difference Result 3146 states and 7011 transitions. [2018-09-23 19:35:09,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 19:35:09,201 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-23 19:35:09,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:35:09,205 INFO L225 Difference]: With dead ends: 3146 [2018-09-23 19:35:09,205 INFO L226 Difference]: Without dead ends: 3138 [2018-09-23 19:35:09,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2018-09-23 19:35:09,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2018-09-23 19:35:12,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2248. [2018-09-23 19:35:12,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2248 states. [2018-09-23 19:35:12,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 5091 transitions. [2018-09-23 19:35:12,165 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 5091 transitions. Word has length 20 [2018-09-23 19:35:12,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:35:12,165 INFO L480 AbstractCegarLoop]: Abstraction has 2248 states and 5091 transitions. [2018-09-23 19:35:12,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-23 19:35:12,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 5091 transitions. [2018-09-23 19:35:12,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-23 19:35:12,166 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:35:12,166 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:35:12,166 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:35:12,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:35:12,167 INFO L82 PathProgramCache]: Analyzing trace with hash -408643559, now seen corresponding path program 1 times [2018-09-23 19:35:12,167 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:35:12,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:35:12,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:35:12,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:35:12,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:35:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:35:12,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 19:35:12,277 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:35:12,277 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-09-23 19:35:12,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:35:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:35:12,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:35:12,337 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 19:35:12,358 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:35:12,358 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-23 19:35:12,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-23 19:35:12,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-23 19:35:12,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-23 19:35:12,359 INFO L87 Difference]: Start difference. First operand 2248 states and 5091 transitions. Second operand 11 states. [2018-09-23 19:35:19,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:35:19,268 INFO L93 Difference]: Finished difference Result 3089 states and 6919 transitions. [2018-09-23 19:35:19,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-23 19:35:19,268 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-23 19:35:19,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:35:19,272 INFO L225 Difference]: With dead ends: 3089 [2018-09-23 19:35:19,272 INFO L226 Difference]: Without dead ends: 3081 [2018-09-23 19:35:19,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2018-09-23 19:35:19,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2018-09-23 19:35:22,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 2246. [2018-09-23 19:35:22,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2018-09-23 19:35:22,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 5087 transitions. [2018-09-23 19:35:22,549 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 5087 transitions. Word has length 20 [2018-09-23 19:35:22,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:35:22,550 INFO L480 AbstractCegarLoop]: Abstraction has 2246 states and 5087 transitions. [2018-09-23 19:35:22,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-23 19:35:22,550 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 5087 transitions. [2018-09-23 19:35:22,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-23 19:35:22,551 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:35:22,551 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 19:35:22,552 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr10ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:35:22,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:35:22,552 INFO L82 PathProgramCache]: Analyzing trace with hash 718873437, now seen corresponding path program 1 times [2018-09-23 19:35:22,552 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:35:22,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:35:22,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:35:22,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:35:22,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:35:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:35:22,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 19:35:22,641 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:35:22,642 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-09-23 19:35:22,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:35:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:35:22,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:35:22,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 19:35:22,722 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:35:22,722 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-23 19:35:22,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-23 19:35:22,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-23 19:35:22,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-23 19:35:22,723 INFO L87 Difference]: Start difference. First operand 2246 states and 5087 transitions. Second operand 11 states. Received shutdown request... [2018-09-23 19:35:27,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-23 19:35:27,979 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-23 19:35:27,985 WARN L206 ceAbstractionStarter]: Timeout [2018-09-23 19:35:27,985 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.09 07:35:27 BoogieIcfgContainer [2018-09-23 19:35:27,985 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-23 19:35:27,986 INFO L168 Benchmark]: Toolchain (without parser) took 259215.11 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 641.2 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 247.0 MB). Peak memory consumption was 888.2 MB. Max. memory is 7.1 GB. [2018-09-23 19:35:27,987 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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-09-23 19:35:27,987 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.20 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-09-23 19:35:27,988 INFO L168 Benchmark]: Boogie Preprocessor took 58.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-09-23 19:35:27,988 INFO L168 Benchmark]: RCFGBuilder took 817.22 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-23 19:35:27,989 INFO L168 Benchmark]: TraceAbstraction took 258284.24 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 641.2 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 215.2 MB). Peak memory consumption was 856.5 MB. Max. memory is 7.1 GB. [2018-09-23 19:35:27,991 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.20 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 58.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 817.22 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 258284.24 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 641.2 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 215.2 MB). Peak memory consumption was 856.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 284]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 284). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (1842 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 277]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 277). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (1842 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 332]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 332). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (1842 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 154). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (1842 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 229]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 229). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (1842 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 264]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 264). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (1842 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 364]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 364). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (1842 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 294]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 294). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (1842 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 205]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 205). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (1842 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 247]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 247). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (1842 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 250]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 250). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (1842 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 240]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 240). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (1842 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 54). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (1842 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 222]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 222). Cancelled while BasicCegarLoop was constructing difference of abstraction (2246states) and FLOYD_HOARE automaton (currently 17 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (1842 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 258.2s OverallTime, 52 OverallIterations, 2 TraceHistogramMax, 205.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13603 SDtfs, 45625 SDslu, 46869 SDs, 0 SdLazy, 95810 SolverSat, 9986 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 90.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1840 GetRequests, 327 SyntacticMatches, 4 SemanticMatches, 1509 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25597 ImplicationChecksByTransitivity, 29.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2248occurred in iteration=50, 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: 42.2s AutomataMinimizationTime, 51 MinimizatonAttempts, 27176 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 984 NumberOfCodeBlocks, 984 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 917 ConstructedInterpolants, 0 QuantifiedInterpolants, 47980 SizeOfPredicates, 77 NumberOfNonLiveVariables, 645 ConjunctsInSsa, 146 ConjunctsInUnsatCore, 67 InterpolantComputations, 37 PerfectInterpolantSequences, 43/111 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out_Reals.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-23_19-35-28-002.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out_Reals.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-23_19-35-28-002.csv Completed graceful shutdown