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-d19836b [2018-09-26 21:12:16,482 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:12:16,485 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:12:16,503 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:12:16,503 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:12:16,504 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:12:16,506 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:12:16,508 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:12:16,509 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:12:16,512 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:12:16,513 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:12:16,513 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:12:16,514 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:12:16,515 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:12:16,516 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:12:16,517 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:12:16,518 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:12:16,519 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:12:16,521 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:12:16,523 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:12:16,524 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:12:16,525 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:12:16,528 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:12:16,528 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:12:16,528 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:12:16,529 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:12:16,530 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:12:16,531 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:12:16,531 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:12:16,532 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:12:16,533 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:12:16,533 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:12:16,534 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:12:16,534 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:12:16,535 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:12:16,536 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:12:16,536 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-26 21:12:16,551 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:12:16,551 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:12:16,552 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:12:16,552 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:12:16,553 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:12:16,553 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:12:16,553 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:12:16,554 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:12:16,554 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:12:16,554 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:12:16,554 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:12:16,554 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:12:16,555 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:12:16,555 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:12:16,555 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:12:16,555 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:12:16,555 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:12:16,556 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:12:16,556 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:12:16,556 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:12:16,556 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:12:16,556 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:12:16,557 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:12:16,557 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:12:16,557 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:12:16,557 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:12:16,557 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:12:16,558 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:12:16,558 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:12:16,558 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:12:16,618 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:12:16,631 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:12:16,635 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:12:16,637 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:12:16,638 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:12:16,639 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-26 21:12:16,639 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out_Reals.bpl' [2018-09-26 21:12:16,717 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:12:16,724 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:12:16,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:12:16,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:12:16,725 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:12:16,753 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 26.09 09:12:16" (1/1) ... [2018-09-26 21:12:16,770 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 26.09 09:12:16" (1/1) ... [2018-09-26 21:12:16,783 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 21:12:16,784 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 21:12:16,784 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 21:12:16,786 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:12:16,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:12:16,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:12:16,787 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:12:16,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:16" (1/1) ... [2018-09-26 21:12:16,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:16" (1/1) ... [2018-09-26 21:12:16,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:16" (1/1) ... [2018-09-26 21:12:16,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:16" (1/1) ... [2018-09-26 21:12:16,823 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:16" (1/1) ... [2018-09-26 21:12:16,836 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:16" (1/1) ... [2018-09-26 21:12:16,838 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:16" (1/1) ... [2018-09-26 21:12:16,846 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:12:16,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:12:16,847 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:12:16,847 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:12:16,852 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:16" (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-26 21:12:16,921 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-26 21:12:16,921 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-26 21:12:16,921 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-26 21:12:17,666 INFO L343 CfgBuilder]: Using library mode [2018-09-26 21:12:17,666 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:12:17 BoogieIcfgContainer [2018-09-26 21:12:17,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:12:17,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:12:17,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:12:17,671 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:12:17,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:16" (1/2) ... [2018-09-26 21:12:17,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28b941c2 and model type threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:12:17, skipping insertion in model container [2018-09-26 21:12:17,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:12:17" (2/2) ... [2018-09-26 21:12:17,675 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out_Reals.bpl [2018-09-26 21:12:17,685 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:12:17,698 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-09-26 21:12:17,755 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:12:17,756 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:12:17,756 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:12:17,756 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:12:17,756 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:12:17,756 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:12:17,757 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:12:17,757 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:12:17,757 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:12:17,781 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-09-26 21:12:17,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 21:12:17,791 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:17,792 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:17,795 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:17,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:17,802 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-09-26 21:12:17,804 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:17,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:17,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:17,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:17,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:18,104 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-26 21:12:18,108 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:18,109 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:12:18,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 21:12:18,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 21:12:18,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 21:12:18,136 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-09-26 21:12:19,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:19,846 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-09-26 21:12:19,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 21:12:19,848 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-26 21:12:19,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:19,865 INFO L225 Difference]: With dead ends: 163 [2018-09-26 21:12:19,865 INFO L226 Difference]: Without dead ends: 158 [2018-09-26 21:12:19,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-09-26 21:12:19,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-26 21:12:19,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-09-26 21:12:19,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 21:12:19,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-09-26 21:12:19,929 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-09-26 21:12:19,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:19,929 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-09-26 21:12:19,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 21:12:19,930 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-09-26 21:12:19,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 21:12:19,931 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:19,931 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:19,932 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:19,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:19,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-09-26 21:12:19,933 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:19,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:19,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:19,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:19,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:20,061 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-26 21:12:20,062 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:20,062 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:12:20,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 21:12:20,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 21:12:20,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 21:12:20,065 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-09-26 21:12:20,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:20,991 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-09-26 21:12:20,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 21:12:20,992 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-26 21:12:20,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:20,996 INFO L225 Difference]: With dead ends: 188 [2018-09-26 21:12:20,996 INFO L226 Difference]: Without dead ends: 183 [2018-09-26 21:12:20,997 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-26 21:12:20,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-26 21:12:21,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-09-26 21:12:21,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-26 21:12:21,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-09-26 21:12:21,022 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-09-26 21:12:21,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:21,022 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-09-26 21:12:21,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 21:12:21,022 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-09-26 21:12:21,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 21:12:21,024 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:21,024 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:21,025 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:21,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:21,025 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-09-26 21:12:21,025 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:21,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:21,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:21,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:21,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:21,118 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-26 21:12:21,118 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:21,118 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 21:12:21,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:12:21,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:12:21,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 21:12:21,120 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-09-26 21:12:22,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:22,504 INFO L93 Difference]: Finished difference Result 283 states and 637 transitions. [2018-09-26 21:12:22,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 21:12:22,505 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-26 21:12:22,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:22,508 INFO L225 Difference]: With dead ends: 283 [2018-09-26 21:12:22,508 INFO L226 Difference]: Without dead ends: 278 [2018-09-26 21:12:22,509 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-26 21:12:22,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-09-26 21:12:22,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 147. [2018-09-26 21:12:22,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-26 21:12:22,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 323 transitions. [2018-09-26 21:12:22,551 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 323 transitions. Word has length 9 [2018-09-26 21:12:22,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:22,551 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 323 transitions. [2018-09-26 21:12:22,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:12:22,552 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 323 transitions. [2018-09-26 21:12:22,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 21:12:22,553 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:22,553 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:22,554 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:22,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:22,554 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-09-26 21:12:22,557 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:22,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:22,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:22,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:22,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:22,749 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-26 21:12:22,749 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:22,749 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 21:12:22,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:12:22,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:12:22,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 21:12:22,751 INFO L87 Difference]: Start difference. First operand 147 states and 323 transitions. Second operand 7 states. [2018-09-26 21:12:24,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:24,514 INFO L93 Difference]: Finished difference Result 387 states and 869 transitions. [2018-09-26 21:12:24,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 21:12:24,517 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-26 21:12:24,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:24,521 INFO L225 Difference]: With dead ends: 387 [2018-09-26 21:12:24,521 INFO L226 Difference]: Without dead ends: 375 [2018-09-26 21:12:24,522 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-26 21:12:24,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-09-26 21:12:24,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 203. [2018-09-26 21:12:24,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-26 21:12:24,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-09-26 21:12:24,561 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-09-26 21:12:24,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:24,562 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-09-26 21:12:24,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:12:24,562 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-09-26 21:12:24,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:12:24,564 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:24,564 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:24,565 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:24,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:24,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-09-26 21:12:24,566 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:24,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:24,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:24,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:24,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:24,673 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-26 21:12:24,674 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:24,674 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:12:24,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:12:24,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:12:24,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 21:12:24,676 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 9 states. [2018-09-26 21:12:26,132 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-26 21:12:27,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:27,720 INFO L93 Difference]: Finished difference Result 725 states and 1622 transitions. [2018-09-26 21:12:27,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 21:12:27,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 21:12:27,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:27,727 INFO L225 Difference]: With dead ends: 725 [2018-09-26 21:12:27,727 INFO L226 Difference]: Without dead ends: 717 [2018-09-26 21:12:27,728 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-09-26 21:12:27,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-09-26 21:12:27,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 354. [2018-09-26 21:12:27,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-09-26 21:12:27,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 843 transitions. [2018-09-26 21:12:27,792 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 843 transitions. Word has length 12 [2018-09-26 21:12:27,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:27,793 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 843 transitions. [2018-09-26 21:12:27,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:12:27,793 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 843 transitions. [2018-09-26 21:12:27,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:12:27,795 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:27,795 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:27,796 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:27,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:27,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-09-26 21:12:27,796 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:27,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:27,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:27,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:27,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:27,931 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-26 21:12:27,931 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:27,932 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:12:27,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:12:27,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:12:27,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 21:12:27,933 INFO L87 Difference]: Start difference. First operand 354 states and 843 transitions. Second operand 9 states. [2018-09-26 21:12:30,511 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-26 21:12:31,362 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-26 21:12:33,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:33,065 INFO L93 Difference]: Finished difference Result 1008 states and 2278 transitions. [2018-09-26 21:12:33,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 21:12:33,067 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 21:12:33,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:33,073 INFO L225 Difference]: With dead ends: 1008 [2018-09-26 21:12:33,074 INFO L226 Difference]: Without dead ends: 1000 [2018-09-26 21:12:33,075 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-26 21:12:33,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-09-26 21:12:33,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 364. [2018-09-26 21:12:33,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-09-26 21:12:33,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 868 transitions. [2018-09-26 21:12:33,143 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 868 transitions. Word has length 12 [2018-09-26 21:12:33,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:33,143 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 868 transitions. [2018-09-26 21:12:33,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:12:33,144 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 868 transitions. [2018-09-26 21:12:33,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:12:33,145 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:33,145 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:33,146 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:33,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:33,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-09-26 21:12:33,146 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:33,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:33,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:33,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:33,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:33,263 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-26 21:12:33,264 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:33,264 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:12:33,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:12:33,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:12:33,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 21:12:33,265 INFO L87 Difference]: Start difference. First operand 364 states and 868 transitions. Second operand 9 states. [2018-09-26 21:12:35,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:35,788 INFO L93 Difference]: Finished difference Result 924 states and 2097 transitions. [2018-09-26 21:12:35,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 21:12:35,790 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 21:12:35,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:35,797 INFO L225 Difference]: With dead ends: 924 [2018-09-26 21:12:35,797 INFO L226 Difference]: Without dead ends: 916 [2018-09-26 21:12:35,798 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-26 21:12:35,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2018-09-26 21:12:35,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 394. [2018-09-26 21:12:35,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-09-26 21:12:35,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 957 transitions. [2018-09-26 21:12:35,889 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 957 transitions. Word has length 12 [2018-09-26 21:12:35,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:35,890 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 957 transitions. [2018-09-26 21:12:35,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:12:35,890 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 957 transitions. [2018-09-26 21:12:35,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:12:35,891 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:35,891 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:35,892 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:35,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:35,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-09-26 21:12:35,897 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:35,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:35,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:35,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:35,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:36,237 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-26 21:12:36,238 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:36,238 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:12:36,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:12:36,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:12:36,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 21:12:36,239 INFO L87 Difference]: Start difference. First operand 394 states and 957 transitions. Second operand 9 states. [2018-09-26 21:12:38,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:38,243 INFO L93 Difference]: Finished difference Result 791 states and 1795 transitions. [2018-09-26 21:12:38,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 21:12:38,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 21:12:38,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:38,252 INFO L225 Difference]: With dead ends: 791 [2018-09-26 21:12:38,253 INFO L226 Difference]: Without dead ends: 783 [2018-09-26 21:12:38,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-09-26 21:12:38,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-09-26 21:12:38,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 392. [2018-09-26 21:12:38,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-09-26 21:12:38,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 950 transitions. [2018-09-26 21:12:38,342 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 950 transitions. Word has length 12 [2018-09-26 21:12:38,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:38,342 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 950 transitions. [2018-09-26 21:12:38,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:12:38,343 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 950 transitions. [2018-09-26 21:12:38,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:12:38,343 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:38,344 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:38,344 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:38,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:38,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1733624339, now seen corresponding path program 1 times [2018-09-26 21:12:38,345 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:38,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:38,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:38,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:38,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:38,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-26 21:12:38,427 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:38,428 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:12:38,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:12:38,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:12:38,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 21:12:38,428 INFO L87 Difference]: Start difference. First operand 392 states and 950 transitions. Second operand 9 states. [2018-09-26 21:12:40,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:40,621 INFO L93 Difference]: Finished difference Result 1040 states and 2400 transitions. [2018-09-26 21:12:40,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 21:12:40,621 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 21:12:40,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:40,628 INFO L225 Difference]: With dead ends: 1040 [2018-09-26 21:12:40,628 INFO L226 Difference]: Without dead ends: 1032 [2018-09-26 21:12:40,629 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-26 21:12:40,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2018-09-26 21:12:40,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 397. [2018-09-26 21:12:40,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-09-26 21:12:40,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 962 transitions. [2018-09-26 21:12:40,745 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 962 transitions. Word has length 12 [2018-09-26 21:12:40,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:40,746 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 962 transitions. [2018-09-26 21:12:40,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:12:40,746 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 962 transitions. [2018-09-26 21:12:40,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:12:40,747 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:40,747 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:40,747 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:40,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:40,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1736424693, now seen corresponding path program 1 times [2018-09-26 21:12:40,748 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:40,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:40,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:40,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:40,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:40,829 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-26 21:12:40,830 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:40,830 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:12:40,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:12:40,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:12:40,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 21:12:40,831 INFO L87 Difference]: Start difference. First operand 397 states and 962 transitions. Second operand 9 states. [2018-09-26 21:12:43,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:43,696 INFO L93 Difference]: Finished difference Result 1166 states and 2697 transitions. [2018-09-26 21:12:43,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 21:12:43,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 21:12:43,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:43,702 INFO L225 Difference]: With dead ends: 1166 [2018-09-26 21:12:43,703 INFO L226 Difference]: Without dead ends: 1158 [2018-09-26 21:12:43,704 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-26 21:12:43,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2018-09-26 21:12:43,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 427. [2018-09-26 21:12:43,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-09-26 21:12:43,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1051 transitions. [2018-09-26 21:12:43,877 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1051 transitions. Word has length 12 [2018-09-26 21:12:43,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:43,877 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 1051 transitions. [2018-09-26 21:12:43,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:12:43,878 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1051 transitions. [2018-09-26 21:12:43,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:12:43,879 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:43,879 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:43,879 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:43,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:43,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1736322548, now seen corresponding path program 1 times [2018-09-26 21:12:43,880 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:43,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:43,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:43,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:43,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:44,290 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-26 21:12:44,290 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:44,291 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:12:44,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:12:44,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:12:44,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 21:12:44,291 INFO L87 Difference]: Start difference. First operand 427 states and 1051 transitions. Second operand 9 states. [2018-09-26 21:12:46,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:46,967 INFO L93 Difference]: Finished difference Result 1127 states and 2616 transitions. [2018-09-26 21:12:46,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 21:12:46,969 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 21:12:46,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:46,976 INFO L225 Difference]: With dead ends: 1127 [2018-09-26 21:12:46,976 INFO L226 Difference]: Without dead ends: 1119 [2018-09-26 21:12:46,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 21:12:46,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-09-26 21:12:47,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 387. [2018-09-26 21:12:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-09-26 21:12:47,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 937 transitions. [2018-09-26 21:12:47,173 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 937 transitions. Word has length 12 [2018-09-26 21:12:47,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:47,174 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 937 transitions. [2018-09-26 21:12:47,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:12:47,174 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 937 transitions. [2018-09-26 21:12:47,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:12:47,175 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:47,175 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:47,175 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:47,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:47,176 INFO L82 PathProgramCache]: Analyzing trace with hash -608805552, now seen corresponding path program 1 times [2018-09-26 21:12:47,176 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:47,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:47,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:47,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:47,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:47,540 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-26 21:12:47,540 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:47,540 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:12:47,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:12:47,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:12:47,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 21:12:47,541 INFO L87 Difference]: Start difference. First operand 387 states and 937 transitions. Second operand 9 states. [2018-09-26 21:12:49,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:49,876 INFO L93 Difference]: Finished difference Result 975 states and 2260 transitions. [2018-09-26 21:12:49,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 21:12:49,877 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 21:12:49,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:49,883 INFO L225 Difference]: With dead ends: 975 [2018-09-26 21:12:49,883 INFO L226 Difference]: Without dead ends: 967 [2018-09-26 21:12:49,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-09-26 21:12:49,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2018-09-26 21:12:50,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 411. [2018-09-26 21:12:50,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-09-26 21:12:50,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1004 transitions. [2018-09-26 21:12:50,029 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1004 transitions. Word has length 12 [2018-09-26 21:12:50,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:50,030 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 1004 transitions. [2018-09-26 21:12:50,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:12:50,031 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1004 transitions. [2018-09-26 21:12:50,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:12:50,031 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:50,032 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:50,032 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:50,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:50,032 INFO L82 PathProgramCache]: Analyzing trace with hash -608703407, now seen corresponding path program 1 times [2018-09-26 21:12:50,033 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:50,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:50,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:50,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:50,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:50,115 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-26 21:12:50,116 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:50,116 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:12:50,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:12:50,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:12:50,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 21:12:50,117 INFO L87 Difference]: Start difference. First operand 411 states and 1004 transitions. Second operand 9 states. [2018-09-26 21:12:52,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:52,830 INFO L93 Difference]: Finished difference Result 1011 states and 2327 transitions. [2018-09-26 21:12:52,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 21:12:52,830 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 21:12:52,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:52,835 INFO L225 Difference]: With dead ends: 1011 [2018-09-26 21:12:52,835 INFO L226 Difference]: Without dead ends: 1003 [2018-09-26 21:12:52,836 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-26 21:12:52,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-09-26 21:12:53,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 391. [2018-09-26 21:12:53,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-09-26 21:12:53,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 944 transitions. [2018-09-26 21:12:53,094 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 944 transitions. Word has length 12 [2018-09-26 21:12:53,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:53,094 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 944 transitions. [2018-09-26 21:12:53,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:12:53,095 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 944 transitions. [2018-09-26 21:12:53,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:12:53,095 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:53,095 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:53,096 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:53,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:53,096 INFO L82 PathProgramCache]: Analyzing trace with hash -500853260, now seen corresponding path program 1 times [2018-09-26 21:12:53,096 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:53,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:53,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:53,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:53,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:53,191 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-26 21:12:53,192 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:53,192 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:12:53,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:12:53,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:12:53,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 21:12:53,193 INFO L87 Difference]: Start difference. First operand 391 states and 944 transitions. Second operand 9 states. [2018-09-26 21:12:55,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:55,224 INFO L93 Difference]: Finished difference Result 859 states and 1980 transitions. [2018-09-26 21:12:55,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 21:12:55,224 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 21:12:55,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:55,228 INFO L225 Difference]: With dead ends: 859 [2018-09-26 21:12:55,228 INFO L226 Difference]: Without dead ends: 851 [2018-09-26 21:12:55,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2018-09-26 21:12:55,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-09-26 21:12:55,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 381. [2018-09-26 21:12:55,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-26 21:12:55,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-09-26 21:12:55,418 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-09-26 21:12:55,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:55,418 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-09-26 21:12:55,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:12:55,418 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-09-26 21:12:55,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:12:55,419 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:55,419 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:55,419 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:55,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:55,420 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-09-26 21:12:55,420 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:55,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:55,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:55,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:55,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:55,509 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-26 21:12:55,509 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:55,509 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:12:55,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:12:55,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:12:55,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:12:55,511 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-09-26 21:12:57,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:57,786 INFO L93 Difference]: Finished difference Result 962 states and 2175 transitions. [2018-09-26 21:12:57,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 21:12:57,787 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:12:57,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:57,791 INFO L225 Difference]: With dead ends: 962 [2018-09-26 21:12:57,791 INFO L226 Difference]: Without dead ends: 954 [2018-09-26 21:12:57,792 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-09-26 21:12:57,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-09-26 21:12:58,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 504. [2018-09-26 21:12:58,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-09-26 21:12:58,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1236 transitions. [2018-09-26 21:12:58,057 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1236 transitions. Word has length 12 [2018-09-26 21:12:58,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:58,057 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 1236 transitions. [2018-09-26 21:12:58,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:12:58,058 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1236 transitions. [2018-09-26 21:12:58,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:12:58,059 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:58,059 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:58,059 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:58,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:58,059 INFO L82 PathProgramCache]: Analyzing trace with hash 192721184, now seen corresponding path program 1 times [2018-09-26 21:12:58,060 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:58,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:58,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:58,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:58,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:58,145 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-26 21:12:58,145 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:58,145 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:12:58,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:12:58,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:12:58,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:12:58,146 INFO L87 Difference]: Start difference. First operand 504 states and 1236 transitions. Second operand 8 states. [2018-09-26 21:13:00,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:00,645 INFO L93 Difference]: Finished difference Result 1064 states and 2409 transitions. [2018-09-26 21:13:00,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 21:13:00,646 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:13:00,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:00,652 INFO L225 Difference]: With dead ends: 1064 [2018-09-26 21:13:00,652 INFO L226 Difference]: Without dead ends: 1056 [2018-09-26 21:13:00,653 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-26 21:13:00,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2018-09-26 21:13:00,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 522. [2018-09-26 21:13:00,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-09-26 21:13:00,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1279 transitions. [2018-09-26 21:13:00,938 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1279 transitions. Word has length 12 [2018-09-26 21:13:00,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:00,938 INFO L480 AbstractCegarLoop]: Abstraction has 522 states and 1279 transitions. [2018-09-26 21:13:00,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:13:00,938 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1279 transitions. [2018-09-26 21:13:00,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:13:00,939 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:00,939 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:00,939 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:00,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:00,940 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-09-26 21:13:00,940 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:00,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:00,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:00,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:00,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:01,024 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-26 21:13:01,024 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:13:01,024 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:13:01,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:13:01,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:13:01,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:13:01,025 INFO L87 Difference]: Start difference. First operand 522 states and 1279 transitions. Second operand 8 states. [2018-09-26 21:13:04,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:04,254 INFO L93 Difference]: Finished difference Result 1241 states and 2843 transitions. [2018-09-26 21:13:04,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 21:13:04,255 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:13:04,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:04,260 INFO L225 Difference]: With dead ends: 1241 [2018-09-26 21:13:04,260 INFO L226 Difference]: Without dead ends: 1233 [2018-09-26 21:13:04,261 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-26 21:13:04,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2018-09-26 21:13:04,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 570. [2018-09-26 21:13:04,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-09-26 21:13:04,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1411 transitions. [2018-09-26 21:13:04,618 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1411 transitions. Word has length 12 [2018-09-26 21:13:04,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:04,618 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1411 transitions. [2018-09-26 21:13:04,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:13:04,619 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1411 transitions. [2018-09-26 21:13:04,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:13:04,619 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:04,620 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:04,620 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:04,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:04,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1424310915, now seen corresponding path program 1 times [2018-09-26 21:13:04,621 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:04,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:04,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:04,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:04,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:04,699 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-26 21:13:04,699 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:13:04,699 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:13:04,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:13:04,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:13:04,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:13:04,700 INFO L87 Difference]: Start difference. First operand 570 states and 1411 transitions. Second operand 8 states. [2018-09-26 21:13:06,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:07,000 INFO L93 Difference]: Finished difference Result 1139 states and 2639 transitions. [2018-09-26 21:13:07,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 21:13:07,000 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:13:07,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:07,006 INFO L225 Difference]: With dead ends: 1139 [2018-09-26 21:13:07,006 INFO L226 Difference]: Without dead ends: 1131 [2018-09-26 21:13:07,007 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-26 21:13:07,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-09-26 21:13:07,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 588. [2018-09-26 21:13:07,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-09-26 21:13:07,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1454 transitions. [2018-09-26 21:13:07,295 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1454 transitions. Word has length 12 [2018-09-26 21:13:07,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:07,295 INFO L480 AbstractCegarLoop]: Abstraction has 588 states and 1454 transitions. [2018-09-26 21:13:07,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:13:07,295 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1454 transitions. [2018-09-26 21:13:07,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:13:07,296 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:07,296 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:07,297 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:07,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:07,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1424311194, now seen corresponding path program 1 times [2018-09-26 21:13:07,297 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:07,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:07,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:07,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:07,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:07,386 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-26 21:13:07,386 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:13:07,387 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:13:07,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:13:07,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:13:07,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:13:07,388 INFO L87 Difference]: Start difference. First operand 588 states and 1454 transitions. Second operand 8 states. [2018-09-26 21:13:10,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:10,337 INFO L93 Difference]: Finished difference Result 1325 states and 3082 transitions. [2018-09-26 21:13:10,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 21:13:10,338 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:13:10,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:10,343 INFO L225 Difference]: With dead ends: 1325 [2018-09-26 21:13:10,343 INFO L226 Difference]: Without dead ends: 1317 [2018-09-26 21:13:10,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-09-26 21:13:10,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2018-09-26 21:13:10,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 573. [2018-09-26 21:13:10,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-09-26 21:13:10,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1417 transitions. [2018-09-26 21:13:10,666 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1417 transitions. Word has length 12 [2018-09-26 21:13:10,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:10,666 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 1417 transitions. [2018-09-26 21:13:10,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:13:10,667 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1417 transitions. [2018-09-26 21:13:10,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:13:10,667 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:10,667 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:10,668 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:10,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:10,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-09-26 21:13:10,668 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:10,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:10,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:10,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:10,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:10,737 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-26 21:13:10,737 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:13:10,737 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:13:10,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:13:10,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:13:10,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:13:10,738 INFO L87 Difference]: Start difference. First operand 573 states and 1417 transitions. Second operand 8 states. [2018-09-26 21:13:14,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:14,187 INFO L93 Difference]: Finished difference Result 1334 states and 3099 transitions. [2018-09-26 21:13:14,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 21:13:14,187 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:13:14,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:14,192 INFO L225 Difference]: With dead ends: 1334 [2018-09-26 21:13:14,192 INFO L226 Difference]: Without dead ends: 1326 [2018-09-26 21:13:14,193 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-26 21:13:14,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2018-09-26 21:13:14,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 579. [2018-09-26 21:13:14,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-09-26 21:13:14,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1431 transitions. [2018-09-26 21:13:14,519 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1431 transitions. Word has length 12 [2018-09-26 21:13:14,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:14,519 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 1431 transitions. [2018-09-26 21:13:14,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:13:14,519 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1431 transitions. [2018-09-26 21:13:14,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:13:14,520 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:14,520 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:14,521 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:14,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:14,521 INFO L82 PathProgramCache]: Analyzing trace with hash 725999160, now seen corresponding path program 1 times [2018-09-26 21:13:14,521 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:14,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:14,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:14,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:14,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:14,599 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-26 21:13:14,599 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:13:14,600 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:13:14,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:13:14,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:13:14,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:13:14,600 INFO L87 Difference]: Start difference. First operand 579 states and 1431 transitions. Second operand 8 states. [2018-09-26 21:13:16,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:16,588 INFO L93 Difference]: Finished difference Result 919 states and 2156 transitions. [2018-09-26 21:13:16,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 21:13:16,589 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:13:16,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:16,593 INFO L225 Difference]: With dead ends: 919 [2018-09-26 21:13:16,594 INFO L226 Difference]: Without dead ends: 911 [2018-09-26 21:13:16,594 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-26 21:13:16,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-09-26 21:13:16,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 570. [2018-09-26 21:13:16,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-09-26 21:13:16,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1404 transitions. [2018-09-26 21:13:16,937 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1404 transitions. Word has length 12 [2018-09-26 21:13:16,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:16,938 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 1404 transitions. [2018-09-26 21:13:16,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:13:16,938 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1404 transitions. [2018-09-26 21:13:16,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:13:16,938 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:16,939 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:16,939 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:16,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:16,939 INFO L82 PathProgramCache]: Analyzing trace with hash 725999439, now seen corresponding path program 1 times [2018-09-26 21:13:16,939 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:16,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:16,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:16,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:16,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:17,027 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-26 21:13:17,027 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:13:17,027 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:13:17,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:13:17,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:13:17,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:13:17,028 INFO L87 Difference]: Start difference. First operand 570 states and 1404 transitions. Second operand 8 states. [2018-09-26 21:13:19,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:19,703 INFO L93 Difference]: Finished difference Result 1095 states and 2579 transitions. [2018-09-26 21:13:19,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 21:13:19,705 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:13:19,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:19,709 INFO L225 Difference]: With dead ends: 1095 [2018-09-26 21:13:19,709 INFO L226 Difference]: Without dead ends: 1087 [2018-09-26 21:13:19,710 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-26 21:13:19,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2018-09-26 21:13:20,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 555. [2018-09-26 21:13:20,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-09-26 21:13:20,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1367 transitions. [2018-09-26 21:13:20,069 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1367 transitions. Word has length 12 [2018-09-26 21:13:20,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:20,070 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 1367 transitions. [2018-09-26 21:13:20,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:13:20,070 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1367 transitions. [2018-09-26 21:13:20,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:13:20,070 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:20,071 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:20,071 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:20,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:20,071 INFO L82 PathProgramCache]: Analyzing trace with hash 729878996, now seen corresponding path program 1 times [2018-09-26 21:13:20,072 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:20,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:20,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:20,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:20,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:20,144 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-26 21:13:20,145 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:13:20,145 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:13:20,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:13:20,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:13:20,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:13:20,146 INFO L87 Difference]: Start difference. First operand 555 states and 1367 transitions. Second operand 8 states. [2018-09-26 21:13:23,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:23,990 INFO L93 Difference]: Finished difference Result 1304 states and 3052 transitions. [2018-09-26 21:13:23,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 21:13:23,990 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:13:23,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:23,994 INFO L225 Difference]: With dead ends: 1304 [2018-09-26 21:13:23,994 INFO L226 Difference]: Without dead ends: 1296 [2018-09-26 21:13:23,995 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-26 21:13:23,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-09-26 21:13:24,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 552. [2018-09-26 21:13:24,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-09-26 21:13:24,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1361 transitions. [2018-09-26 21:13:24,349 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1361 transitions. Word has length 12 [2018-09-26 21:13:24,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:24,349 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 1361 transitions. [2018-09-26 21:13:24,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:13:24,350 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1361 transitions. [2018-09-26 21:13:24,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:13:24,350 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:24,350 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:24,351 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:24,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:24,351 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-09-26 21:13:24,351 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:24,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:24,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:24,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:24,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:24,422 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-26 21:13:24,422 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:13:24,422 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:13:24,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:13:24,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:13:24,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:13:24,424 INFO L87 Difference]: Start difference. First operand 552 states and 1361 transitions. Second operand 8 states. [2018-09-26 21:13:27,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:27,712 INFO L93 Difference]: Finished difference Result 1192 states and 2790 transitions. [2018-09-26 21:13:27,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 21:13:27,713 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:13:27,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:27,715 INFO L225 Difference]: With dead ends: 1192 [2018-09-26 21:13:27,715 INFO L226 Difference]: Without dead ends: 1184 [2018-09-26 21:13:27,716 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-26 21:13:27,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2018-09-26 21:13:28,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 602. [2018-09-26 21:13:28,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-09-26 21:13:28,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-09-26 21:13:28,174 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-09-26 21:13:28,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:28,175 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-09-26 21:13:28,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:13:28,175 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-09-26 21:13:28,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 21:13:28,175 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:28,175 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:28,176 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:28,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:28,176 INFO L82 PathProgramCache]: Analyzing trace with hash 308305537, now seen corresponding path program 1 times [2018-09-26 21:13:28,176 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:28,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:28,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:28,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:28,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:28,226 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-26 21:13:28,226 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:13:28,226 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:13:28,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:13:28,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:13:28,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 21:13:28,227 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-09-26 21:13:29,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:29,005 INFO L93 Difference]: Finished difference Result 1139 states and 2816 transitions. [2018-09-26 21:13:29,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:13:29,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-26 21:13:29,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:29,007 INFO L225 Difference]: With dead ends: 1139 [2018-09-26 21:13:29,007 INFO L226 Difference]: Without dead ends: 625 [2018-09-26 21:13:29,009 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-26 21:13:29,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-09-26 21:13:29,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 602. [2018-09-26 21:13:29,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-09-26 21:13:29,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1415 transitions. [2018-09-26 21:13:29,492 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1415 transitions. Word has length 13 [2018-09-26 21:13:29,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:29,492 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1415 transitions. [2018-09-26 21:13:29,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:13:29,492 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1415 transitions. [2018-09-26 21:13:29,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 21:13:29,493 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:29,493 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:29,493 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:29,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:29,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1757679849, now seen corresponding path program 1 times [2018-09-26 21:13:29,493 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:29,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:29,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:29,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:29,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:29,670 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-26 21:13:29,670 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:13:29,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 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-26 21:13:29,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:29,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:13:30,648 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-26 21:13:30,670 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:13:30,671 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-26 21:13:30,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 21:13:30,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 21:13:30,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-09-26 21:13:30,671 INFO L87 Difference]: Start difference. First operand 602 states and 1415 transitions. Second operand 16 states. [2018-09-26 21:13:34,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:34,268 INFO L93 Difference]: Finished difference Result 794 states and 1860 transitions. [2018-09-26 21:13:34,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 21:13:34,269 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-09-26 21:13:34,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:34,270 INFO L225 Difference]: With dead ends: 794 [2018-09-26 21:13:34,270 INFO L226 Difference]: Without dead ends: 789 [2018-09-26 21:13:34,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-09-26 21:13:34,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-09-26 21:13:34,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 664. [2018-09-26 21:13:34,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-09-26 21:13:34,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1563 transitions. [2018-09-26 21:13:34,939 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1563 transitions. Word has length 13 [2018-09-26 21:13:34,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:34,939 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 1563 transitions. [2018-09-26 21:13:34,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 21:13:34,939 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1563 transitions. [2018-09-26 21:13:34,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 21:13:34,940 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:34,940 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:34,940 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:34,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:34,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1161218619, now seen corresponding path program 1 times [2018-09-26 21:13:34,940 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:34,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:34,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:34,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:34,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:34,988 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-26 21:13:34,988 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:13:34,988 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:13:34,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:13:34,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:13:34,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 21:13:34,989 INFO L87 Difference]: Start difference. First operand 664 states and 1563 transitions. Second operand 5 states. [2018-09-26 21:13:36,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:36,373 INFO L93 Difference]: Finished difference Result 1317 states and 3113 transitions. [2018-09-26 21:13:36,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:13:36,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-26 21:13:36,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:36,374 INFO L225 Difference]: With dead ends: 1317 [2018-09-26 21:13:36,374 INFO L226 Difference]: Without dead ends: 729 [2018-09-26 21:13:36,375 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-26 21:13:36,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-09-26 21:13:37,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 690. [2018-09-26 21:13:37,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-09-26 21:13:37,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-09-26 21:13:37,197 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-09-26 21:13:37,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:37,197 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-09-26 21:13:37,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:13:37,198 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-09-26 21:13:37,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:13:37,198 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:37,198 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:37,199 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:37,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:37,199 INFO L82 PathProgramCache]: Analyzing trace with hash -942981820, now seen corresponding path program 1 times [2018-09-26 21:13:37,199 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:37,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:37,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:37,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:37,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:37,438 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-26 21:13:37,438 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:13:37,438 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:13:37,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:13:37,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:13:37,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:13:37,439 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 8 states. [2018-09-26 21:13:40,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:40,869 INFO L93 Difference]: Finished difference Result 1435 states and 3122 transitions. [2018-09-26 21:13:40,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 21:13:40,879 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 21:13:40,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:40,882 INFO L225 Difference]: With dead ends: 1435 [2018-09-26 21:13:40,882 INFO L226 Difference]: Without dead ends: 1427 [2018-09-26 21:13:40,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-09-26 21:13:40,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2018-09-26 21:13:41,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 789. [2018-09-26 21:13:41,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2018-09-26 21:13:41,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1779 transitions. [2018-09-26 21:13:41,681 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1779 transitions. Word has length 16 [2018-09-26 21:13:41,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:41,681 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 1779 transitions. [2018-09-26 21:13:41,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:13:41,681 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1779 transitions. [2018-09-26 21:13:41,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:13:41,682 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:41,682 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:41,682 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:41,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:41,683 INFO L82 PathProgramCache]: Analyzing trace with hash -945782174, now seen corresponding path program 1 times [2018-09-26 21:13:41,683 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:41,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:41,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:41,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:41,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:41,854 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-26 21:13:41,854 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:13:41,854 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:13:41,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:13:41,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:13:41,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:13:41,855 INFO L87 Difference]: Start difference. First operand 789 states and 1779 transitions. Second operand 8 states. [2018-09-26 21:13:45,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:45,591 INFO L93 Difference]: Finished difference Result 1599 states and 3473 transitions. [2018-09-26 21:13:45,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 21:13:45,592 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 21:13:45,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:45,596 INFO L225 Difference]: With dead ends: 1599 [2018-09-26 21:13:45,596 INFO L226 Difference]: Without dead ends: 1591 [2018-09-26 21:13:45,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-09-26 21:13:45,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-09-26 21:13:46,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 821. [2018-09-26 21:13:46,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-09-26 21:13:46,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1853 transitions. [2018-09-26 21:13:46,337 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1853 transitions. Word has length 16 [2018-09-26 21:13:46,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:46,338 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1853 transitions. [2018-09-26 21:13:46,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:13:46,338 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1853 transitions. [2018-09-26 21:13:46,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:13:46,338 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:46,338 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:46,339 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:46,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:46,339 INFO L82 PathProgramCache]: Analyzing trace with hash -945680029, now seen corresponding path program 1 times [2018-09-26 21:13:46,339 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:46,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:46,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:46,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:46,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:46,418 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-26 21:13:46,418 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:13:46,418 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:13:46,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:13:46,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:13:46,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:13:46,419 INFO L87 Difference]: Start difference. First operand 821 states and 1853 transitions. Second operand 8 states. [2018-09-26 21:13:49,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:49,690 INFO L93 Difference]: Finished difference Result 1411 states and 3060 transitions. [2018-09-26 21:13:49,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 21:13:49,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 21:13:49,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:49,694 INFO L225 Difference]: With dead ends: 1411 [2018-09-26 21:13:49,694 INFO L226 Difference]: Without dead ends: 1403 [2018-09-26 21:13:49,695 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-26 21:13:49,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2018-09-26 21:13:50,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 823. [2018-09-26 21:13:50,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-09-26 21:13:50,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1851 transitions. [2018-09-26 21:13:50,497 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1851 transitions. Word has length 16 [2018-09-26 21:13:50,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:50,498 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1851 transitions. [2018-09-26 21:13:50,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:13:50,498 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1851 transitions. [2018-09-26 21:13:50,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:13:50,498 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:50,499 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:50,499 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:50,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:50,499 INFO L82 PathProgramCache]: Analyzing trace with hash -648408412, now seen corresponding path program 1 times [2018-09-26 21:13:50,500 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:50,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:50,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:50,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:50,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:51,087 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-26 21:13:51,087 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:13:51,087 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:13:51,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:13:51,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:13:51,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:13:51,088 INFO L87 Difference]: Start difference. First operand 823 states and 1851 transitions. Second operand 8 states. [2018-09-26 21:13:54,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:54,625 INFO L93 Difference]: Finished difference Result 1490 states and 3255 transitions. [2018-09-26 21:13:54,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 21:13:54,626 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 21:13:54,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:54,630 INFO L225 Difference]: With dead ends: 1490 [2018-09-26 21:13:54,630 INFO L226 Difference]: Without dead ends: 1482 [2018-09-26 21:13:54,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-09-26 21:13:54,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2018-09-26 21:13:55,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 943. [2018-09-26 21:13:55,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2018-09-26 21:13:55,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 2141 transitions. [2018-09-26 21:13:55,666 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 2141 transitions. Word has length 16 [2018-09-26 21:13:55,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:55,667 INFO L480 AbstractCegarLoop]: Abstraction has 943 states and 2141 transitions. [2018-09-26 21:13:55,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:13:55,667 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 2141 transitions. [2018-09-26 21:13:55,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:13:55,667 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:55,668 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:55,668 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:55,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:55,668 INFO L82 PathProgramCache]: Analyzing trace with hash -648306267, now seen corresponding path program 1 times [2018-09-26 21:13:55,668 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:55,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:55,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:55,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:55,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:55,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:55,738 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:13:55,738 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:13:55,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:13:55,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:13:55,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:13:55,739 INFO L87 Difference]: Start difference. First operand 943 states and 2141 transitions. Second operand 8 states. [2018-09-26 21:13:59,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:59,134 INFO L93 Difference]: Finished difference Result 1427 states and 3102 transitions. [2018-09-26 21:13:59,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 21:13:59,135 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 21:13:59,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:59,138 INFO L225 Difference]: With dead ends: 1427 [2018-09-26 21:13:59,138 INFO L226 Difference]: Without dead ends: 1419 [2018-09-26 21:13:59,139 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-26 21:13:59,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2018-09-26 21:14:00,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 927. [2018-09-26 21:14:00,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-09-26 21:14:00,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2109 transitions. [2018-09-26 21:14:00,078 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2109 transitions. Word has length 16 [2018-09-26 21:14:00,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:14:00,078 INFO L480 AbstractCegarLoop]: Abstraction has 927 states and 2109 transitions. [2018-09-26 21:14:00,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:14:00,079 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2109 transitions. [2018-09-26 21:14:00,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:14:00,079 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:14:00,079 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:14:00,080 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:14:00,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:14:00,080 INFO L82 PathProgramCache]: Analyzing trace with hash -639392031, now seen corresponding path program 1 times [2018-09-26 21:14:00,080 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:14:00,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:14:00,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:00,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:14:00,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:00,146 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-26 21:14:00,147 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:14:00,147 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:14:00,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:14:00,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:14:00,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:14:00,148 INFO L87 Difference]: Start difference. First operand 927 states and 2109 transitions. Second operand 8 states. [2018-09-26 21:14:03,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:14:03,296 INFO L93 Difference]: Finished difference Result 1306 states and 2848 transitions. [2018-09-26 21:14:03,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 21:14:03,297 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 21:14:03,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:14:03,298 INFO L225 Difference]: With dead ends: 1306 [2018-09-26 21:14:03,298 INFO L226 Difference]: Without dead ends: 1298 [2018-09-26 21:14:03,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-09-26 21:14:03,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2018-09-26 21:14:04,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 986. [2018-09-26 21:14:04,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-09-26 21:14:04,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2232 transitions. [2018-09-26 21:14:04,320 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2232 transitions. Word has length 16 [2018-09-26 21:14:04,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:14:04,320 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2232 transitions. [2018-09-26 21:14:04,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:14:04,321 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2232 transitions. [2018-09-26 21:14:04,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:14:04,321 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:14:04,321 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:14:04,322 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:14:04,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:14:04,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1639330009, now seen corresponding path program 1 times [2018-09-26 21:14:04,322 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:14:04,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:14:04,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:04,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:14:04,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:04,453 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-26 21:14:04,453 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:14:04,454 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-26 21:14:04,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:14:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:04,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:14:04,474 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-26 21:14:04,503 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:14:04,504 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-26 21:14:04,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:14:04,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:14:04,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:14:04,504 INFO L87 Difference]: Start difference. First operand 986 states and 2232 transitions. Second operand 8 states. [2018-09-26 21:14:07,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:14:07,530 INFO L93 Difference]: Finished difference Result 1285 states and 2841 transitions. [2018-09-26 21:14:07,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 21:14:07,530 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 21:14:07,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:14:07,532 INFO L225 Difference]: With dead ends: 1285 [2018-09-26 21:14:07,533 INFO L226 Difference]: Without dead ends: 1277 [2018-09-26 21:14:07,533 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-26 21:14:07,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2018-09-26 21:14:08,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 986. [2018-09-26 21:14:08,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-09-26 21:14:08,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2231 transitions. [2018-09-26 21:14:08,524 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2231 transitions. Word has length 16 [2018-09-26 21:14:08,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:14:08,525 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 2231 transitions. [2018-09-26 21:14:08,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:14:08,525 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2231 transitions. [2018-09-26 21:14:08,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:14:08,525 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:14:08,525 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:14:08,526 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:14:08,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:14:08,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1609777337, now seen corresponding path program 1 times [2018-09-26 21:14:08,526 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:14:08,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:14:08,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:08,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:14:08,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:08,613 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-26 21:14:08,613 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:14:08,613 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-26 21:14:08,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:14:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:08,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:14:08,639 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-26 21:14:08,667 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:14:08,667 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-26 21:14:08,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:14:08,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:14:08,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:14:08,668 INFO L87 Difference]: Start difference. First operand 986 states and 2231 transitions. Second operand 8 states. [2018-09-26 21:14:12,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:14:12,352 INFO L93 Difference]: Finished difference Result 1518 states and 3315 transitions. [2018-09-26 21:14:12,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 21:14:12,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 21:14:12,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:14:12,354 INFO L225 Difference]: With dead ends: 1518 [2018-09-26 21:14:12,355 INFO L226 Difference]: Without dead ends: 1510 [2018-09-26 21:14:12,356 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-26 21:14:12,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2018-09-26 21:14:13,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 977. [2018-09-26 21:14:13,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2018-09-26 21:14:13,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 2210 transitions. [2018-09-26 21:14:13,329 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 2210 transitions. Word has length 16 [2018-09-26 21:14:13,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:14:13,330 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 2210 transitions. [2018-09-26 21:14:13,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:14:13,330 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 2210 transitions. [2018-09-26 21:14:13,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:14:13,330 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:14:13,330 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:14:13,331 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:14:13,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:14:13,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1612577691, now seen corresponding path program 1 times [2018-09-26 21:14:13,331 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:14:13,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:14:13,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:13,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:14:13,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:13,520 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-26 21:14:13,520 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:14:13,520 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-26 21:14:13,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:14:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:13,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:14:13,549 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-26 21:14:13,571 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:14:13,571 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-26 21:14:13,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:14:13,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:14:13,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:14:13,572 INFO L87 Difference]: Start difference. First operand 977 states and 2210 transitions. Second operand 8 states. [2018-09-26 21:14:17,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:14:17,221 INFO L93 Difference]: Finished difference Result 1448 states and 3170 transitions. [2018-09-26 21:14:17,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 21:14:17,221 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 21:14:17,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:14:17,223 INFO L225 Difference]: With dead ends: 1448 [2018-09-26 21:14:17,223 INFO L226 Difference]: Without dead ends: 1440 [2018-09-26 21:14:17,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2018-09-26 21:14:17,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2018-09-26 21:14:18,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 941. [2018-09-26 21:14:18,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-09-26 21:14:18,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 2120 transitions. [2018-09-26 21:14:18,177 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 2120 transitions. Word has length 16 [2018-09-26 21:14:18,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:14:18,177 INFO L480 AbstractCegarLoop]: Abstraction has 941 states and 2120 transitions. [2018-09-26 21:14:18,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:14:18,177 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 2120 transitions. [2018-09-26 21:14:18,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:14:18,178 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:14:18,178 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:14:18,178 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:14:18,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:14:18,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1612475546, now seen corresponding path program 1 times [2018-09-26 21:14:18,179 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:14:18,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:14:18,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:18,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:14:18,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:18,802 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-26 21:14:18,803 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:14:18,803 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-26 21:14:18,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:14:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:18,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:14:18,844 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-26 21:14:18,875 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:14:18,875 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-26 21:14:18,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:14:18,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:14:18,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:14:18,876 INFO L87 Difference]: Start difference. First operand 941 states and 2120 transitions. Second operand 8 states. [2018-09-26 21:14:22,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:14:22,042 INFO L93 Difference]: Finished difference Result 1254 states and 2743 transitions. [2018-09-26 21:14:22,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 21:14:22,043 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 21:14:22,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:14:22,044 INFO L225 Difference]: With dead ends: 1254 [2018-09-26 21:14:22,044 INFO L226 Difference]: Without dead ends: 1246 [2018-09-26 21:14:22,045 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-26 21:14:22,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2018-09-26 21:14:23,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 896. [2018-09-26 21:14:23,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2018-09-26 21:14:23,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 2017 transitions. [2018-09-26 21:14:23,013 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 2017 transitions. Word has length 16 [2018-09-26 21:14:23,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:14:23,013 INFO L480 AbstractCegarLoop]: Abstraction has 896 states and 2017 transitions. [2018-09-26 21:14:23,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:14:23,014 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 2017 transitions. [2018-09-26 21:14:23,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:14:23,014 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:14:23,015 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:14:23,015 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:14:23,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:14:23,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1200558936, now seen corresponding path program 1 times [2018-09-26 21:14:23,015 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:14:23,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:14:23,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:23,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:14:23,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:23,126 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-26 21:14:23,126 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:14:23,126 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-26 21:14:23,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:14:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:23,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:14:23,614 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-26 21:14:23,635 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:14:23,635 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-26 21:14:23,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 21:14:23,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 21:14:23,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-09-26 21:14:23,636 INFO L87 Difference]: Start difference. First operand 896 states and 2017 transitions. Second operand 17 states. [2018-09-26 21:14:29,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:14:29,545 INFO L93 Difference]: Finished difference Result 1278 states and 2792 transitions. [2018-09-26 21:14:29,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 21:14:29,546 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-26 21:14:29,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:14:29,547 INFO L225 Difference]: With dead ends: 1278 [2018-09-26 21:14:29,548 INFO L226 Difference]: Without dead ends: 1270 [2018-09-26 21:14:29,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=519, Invalid=2133, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 21:14:29,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2018-09-26 21:14:30,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 970. [2018-09-26 21:14:30,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2018-09-26 21:14:30,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 2200 transitions. [2018-09-26 21:14:30,580 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 2200 transitions. Word has length 16 [2018-09-26 21:14:30,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:14:30,580 INFO L480 AbstractCegarLoop]: Abstraction has 970 states and 2200 transitions. [2018-09-26 21:14:30,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 21:14:30,580 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 2200 transitions. [2018-09-26 21:14:30,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:14:30,581 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:14:30,581 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:14:30,581 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:14:30,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:14:30,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257424, now seen corresponding path program 1 times [2018-09-26 21:14:30,581 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:14:30,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:14:30,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:30,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:14:30,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:30,662 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-26 21:14:30,662 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:14:30,662 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-26 21:14:30,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:14:30,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:14:30,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-26 21:14:30,663 INFO L87 Difference]: Start difference. First operand 970 states and 2200 transitions. Second operand 9 states. [2018-09-26 21:14:34,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:14:34,012 INFO L93 Difference]: Finished difference Result 1180 states and 2573 transitions. [2018-09-26 21:14:34,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 21:14:34,012 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-26 21:14:34,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:14:34,014 INFO L225 Difference]: With dead ends: 1180 [2018-09-26 21:14:34,014 INFO L226 Difference]: Without dead ends: 1172 [2018-09-26 21:14:34,015 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-26 21:14:34,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2018-09-26 21:14:35,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 948. [2018-09-26 21:14:35,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2018-09-26 21:14:35,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 2144 transitions. [2018-09-26 21:14:35,124 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 2144 transitions. Word has length 16 [2018-09-26 21:14:35,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:14:35,124 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 2144 transitions. [2018-09-26 21:14:35,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:14:35,124 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 2144 transitions. [2018-09-26 21:14:35,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:14:35,125 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:14:35,125 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:14:35,125 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:14:35,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:14:35,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1203257145, now seen corresponding path program 1 times [2018-09-26 21:14:35,126 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:14:35,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:14:35,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:35,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:14:35,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:35,239 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-26 21:14:35,239 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:14:35,239 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-26 21:14:35,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:14:35,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:14:35,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-26 21:14:35,240 INFO L87 Difference]: Start difference. First operand 948 states and 2144 transitions. Second operand 9 states. [2018-09-26 21:14:38,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:14:38,911 INFO L93 Difference]: Finished difference Result 1233 states and 2705 transitions. [2018-09-26 21:14:38,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 21:14:38,912 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-26 21:14:38,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:14:38,913 INFO L225 Difference]: With dead ends: 1233 [2018-09-26 21:14:38,913 INFO L226 Difference]: Without dead ends: 1225 [2018-09-26 21:14:38,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2018-09-26 21:14:38,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2018-09-26 21:14:40,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 966. [2018-09-26 21:14:40,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-09-26 21:14:40,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 2192 transitions. [2018-09-26 21:14:40,019 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 2192 transitions. Word has length 16 [2018-09-26 21:14:40,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:14:40,020 INFO L480 AbstractCegarLoop]: Abstraction has 966 states and 2192 transitions. [2018-09-26 21:14:40,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:14:40,020 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 2192 transitions. [2018-09-26 21:14:40,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:14:40,021 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:14:40,021 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:14:40,021 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:14:40,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:14:40,021 INFO L82 PathProgramCache]: Analyzing trace with hash -2004746308, now seen corresponding path program 1 times [2018-09-26 21:14:40,021 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:14:40,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:14:40,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:40,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:14:40,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:40,090 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-26 21:14:40,090 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:14:40,090 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-26 21:14:40,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:14:40,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:14:40,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-26 21:14:40,091 INFO L87 Difference]: Start difference. First operand 966 states and 2192 transitions. Second operand 9 states. [2018-09-26 21:14:44,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:14:44,442 INFO L93 Difference]: Finished difference Result 1537 states and 3410 transitions. [2018-09-26 21:14:44,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 21:14:44,442 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-26 21:14:44,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:14:44,444 INFO L225 Difference]: With dead ends: 1537 [2018-09-26 21:14:44,444 INFO L226 Difference]: Without dead ends: 1529 [2018-09-26 21:14:44,444 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-26 21:14:44,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2018-09-26 21:14:45,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1013. [2018-09-26 21:14:45,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2018-09-26 21:14:45,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 2297 transitions. [2018-09-26 21:14:45,640 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 2297 transitions. Word has length 16 [2018-09-26 21:14:45,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:14:45,641 INFO L480 AbstractCegarLoop]: Abstraction has 1013 states and 2297 transitions. [2018-09-26 21:14:45,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:14:45,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 2297 transitions. [2018-09-26 21:14:45,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:14:45,641 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:14:45,641 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:14:45,642 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:14:45,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:14:45,642 INFO L82 PathProgramCache]: Analyzing trace with hash -35185992, now seen corresponding path program 1 times [2018-09-26 21:14:45,642 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:14:45,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:14:45,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:45,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:14:45,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:45,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:14:45,738 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:14:45,738 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-26 21:14:45,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:14:45,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:14:45,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-26 21:14:45,739 INFO L87 Difference]: Start difference. First operand 1013 states and 2297 transitions. Second operand 9 states. [2018-09-26 21:14:50,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:14:50,394 INFO L93 Difference]: Finished difference Result 1590 states and 3484 transitions. [2018-09-26 21:14:50,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 21:14:50,395 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-26 21:14:50,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:14:50,397 INFO L225 Difference]: With dead ends: 1590 [2018-09-26 21:14:50,397 INFO L226 Difference]: Without dead ends: 1582 [2018-09-26 21:14:50,397 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-26 21:14:50,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2018-09-26 21:14:51,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1020. [2018-09-26 21:14:51,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2018-09-26 21:14:51,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 2311 transitions. [2018-09-26 21:14:51,552 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 2311 transitions. Word has length 16 [2018-09-26 21:14:51,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:14:51,553 INFO L480 AbstractCegarLoop]: Abstraction has 1020 states and 2311 transitions. [2018-09-26 21:14:51,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:14:51,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 2311 transitions. [2018-09-26 21:14:51,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:14:51,553 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:14:51,553 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:14:51,553 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:14:51,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:14:51,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1174622531, now seen corresponding path program 1 times [2018-09-26 21:14:51,554 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:14:51,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:14:51,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:51,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:14:51,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:51,622 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-26 21:14:51,622 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:14:51,622 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-26 21:14:51,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:14:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:51,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:14:51,748 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-26 21:14:51,769 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:14:51,769 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-26 21:14:51,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 21:14:51,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 21:14:51,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-26 21:14:51,770 INFO L87 Difference]: Start difference. First operand 1020 states and 2311 transitions. Second operand 17 states. [2018-09-26 21:15:01,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:15:01,538 INFO L93 Difference]: Finished difference Result 1949 states and 4288 transitions. [2018-09-26 21:15:01,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 21:15:01,539 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-26 21:15:01,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:15:01,541 INFO L225 Difference]: With dead ends: 1949 [2018-09-26 21:15:01,541 INFO L226 Difference]: Without dead ends: 1941 [2018-09-26 21:15:01,544 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-26 21:15:01,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2018-09-26 21:15:02,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1031. [2018-09-26 21:15:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2018-09-26 21:15:02,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 2337 transitions. [2018-09-26 21:15:02,800 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 2337 transitions. Word has length 16 [2018-09-26 21:15:02,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:15:02,800 INFO L480 AbstractCegarLoop]: Abstraction has 1031 states and 2337 transitions. [2018-09-26 21:15:02,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 21:15:02,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 2337 transitions. [2018-09-26 21:15:02,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:15:02,801 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:15:02,801 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:15:02,802 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:15:02,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:15:02,802 INFO L82 PathProgramCache]: Analyzing trace with hash 913888237, now seen corresponding path program 1 times [2018-09-26 21:15:02,802 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:15:02,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:15:02,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:02,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:15:02,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:02,870 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-26 21:15:02,870 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:15:02,870 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-26 21:15:02,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:15:02,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:15:02,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-26 21:15:02,871 INFO L87 Difference]: Start difference. First operand 1031 states and 2337 transitions. Second operand 9 states. [2018-09-26 21:15:07,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:15:07,162 INFO L93 Difference]: Finished difference Result 1420 states and 3128 transitions. [2018-09-26 21:15:07,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 21:15:07,163 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-26 21:15:07,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:15:07,165 INFO L225 Difference]: With dead ends: 1420 [2018-09-26 21:15:07,165 INFO L226 Difference]: Without dead ends: 1412 [2018-09-26 21:15:07,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2018-09-26 21:15:07,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2018-09-26 21:15:08,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 963. [2018-09-26 21:15:08,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2018-09-26 21:15:08,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 2173 transitions. [2018-09-26 21:15:08,369 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 2173 transitions. Word has length 16 [2018-09-26 21:15:08,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:15:08,369 INFO L480 AbstractCegarLoop]: Abstraction has 963 states and 2173 transitions. [2018-09-26 21:15:08,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:15:08,369 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 2173 transitions. [2018-09-26 21:15:08,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:15:08,369 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:15:08,370 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:15:08,370 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:15:08,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:15:08,370 INFO L82 PathProgramCache]: Analyzing trace with hash 2123696760, now seen corresponding path program 1 times [2018-09-26 21:15:08,370 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:15:08,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:15:08,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:08,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:15:08,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:08,449 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-26 21:15:08,449 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:15:08,449 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-26 21:15:08,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:15:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:08,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:15:08,593 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-26 21:15:08,614 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:15:08,615 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-26 21:15:08,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 21:15:08,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 21:15:08,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-26 21:15:08,615 INFO L87 Difference]: Start difference. First operand 963 states and 2173 transitions. Second operand 17 states. [2018-09-26 21:15:21,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:15:21,890 INFO L93 Difference]: Finished difference Result 2767 states and 6075 transitions. [2018-09-26 21:15:21,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-09-26 21:15:21,890 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-26 21:15:21,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:15:21,893 INFO L225 Difference]: With dead ends: 2767 [2018-09-26 21:15:21,893 INFO L226 Difference]: Without dead ends: 2759 [2018-09-26 21:15:21,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6116 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2425, Invalid=14867, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 21:15:21,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2018-09-26 21:15:23,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 1094. [2018-09-26 21:15:23,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2018-09-26 21:15:23,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 2474 transitions. [2018-09-26 21:15:23,335 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 2474 transitions. Word has length 16 [2018-09-26 21:15:23,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:15:23,335 INFO L480 AbstractCegarLoop]: Abstraction has 1094 states and 2474 transitions. [2018-09-26 21:15:23,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 21:15:23,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 2474 transitions. [2018-09-26 21:15:23,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:15:23,336 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:15:23,337 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:15:23,337 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:15:23,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:15:23,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1400694311, now seen corresponding path program 1 times [2018-09-26 21:15:23,337 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:15:23,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:15:23,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:23,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:15:23,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:23,442 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-26 21:15:23,442 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:15:23,442 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-26 21:15:23,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:15:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:23,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:15:23,568 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-26 21:15:23,589 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:15:23,589 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-26 21:15:23,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 21:15:23,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 21:15:23,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-26 21:15:23,590 INFO L87 Difference]: Start difference. First operand 1094 states and 2474 transitions. Second operand 17 states. [2018-09-26 21:15:37,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:15:37,348 INFO L93 Difference]: Finished difference Result 2361 states and 5206 transitions. [2018-09-26 21:15:37,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-26 21:15:37,349 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-26 21:15:37,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:15:37,351 INFO L225 Difference]: With dead ends: 2361 [2018-09-26 21:15:37,351 INFO L226 Difference]: Without dead ends: 2353 [2018-09-26 21:15:37,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9524 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3069, Invalid=22371, Unknown=0, NotChecked=0, Total=25440 [2018-09-26 21:15:37,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2018-09-26 21:15:38,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 1155. [2018-09-26 21:15:38,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1155 states. [2018-09-26 21:15:38,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 2607 transitions. [2018-09-26 21:15:38,847 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 2607 transitions. Word has length 16 [2018-09-26 21:15:38,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:15:38,847 INFO L480 AbstractCegarLoop]: Abstraction has 1155 states and 2607 transitions. [2018-09-26 21:15:38,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 21:15:38,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 2607 transitions. [2018-09-26 21:15:38,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 21:15:38,848 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:15:38,848 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:15:38,849 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:15:38,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:15:38,849 INFO L82 PathProgramCache]: Analyzing trace with hash 417107387, now seen corresponding path program 1 times [2018-09-26 21:15:38,849 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:15:38,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:15:38,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:38,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:15:38,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:38,965 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-26 21:15:38,965 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:15:38,965 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-26 21:15:38,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:15:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:38,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:15:39,068 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-26 21:15:39,089 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:15:39,089 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-09-26 21:15:39,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:15:39,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:15:39,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-09-26 21:15:39,090 INFO L87 Difference]: Start difference. First operand 1155 states and 2607 transitions. Second operand 14 states. [2018-09-26 21:15:41,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:15:41,905 INFO L93 Difference]: Finished difference Result 1507 states and 3367 transitions. [2018-09-26 21:15:41,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 21:15:41,906 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2018-09-26 21:15:41,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:15:41,907 INFO L225 Difference]: With dead ends: 1507 [2018-09-26 21:15:41,907 INFO L226 Difference]: Without dead ends: 1502 [2018-09-26 21:15:41,908 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-26 21:15:41,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2018-09-26 21:15:43,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1339. [2018-09-26 21:15:43,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2018-09-26 21:15:43,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2995 transitions. [2018-09-26 21:15:43,751 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2995 transitions. Word has length 17 [2018-09-26 21:15:43,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:15:43,752 INFO L480 AbstractCegarLoop]: Abstraction has 1339 states and 2995 transitions. [2018-09-26 21:15:43,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:15:43,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2995 transitions. [2018-09-26 21:15:43,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 21:15:43,753 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:15:43,753 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:15:43,753 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:15:43,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:15:43,753 INFO L82 PathProgramCache]: Analyzing trace with hash 524852653, now seen corresponding path program 1 times [2018-09-26 21:15:43,754 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:15:43,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:15:43,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:43,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:15:43,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:43,885 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-26 21:15:43,885 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:15:43,886 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-26 21:15:43,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:15:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:43,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:15:44,475 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-26 21:15:44,496 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:15:44,497 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 18 [2018-09-26 21:15:44,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 21:15:44,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 21:15:44,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-09-26 21:15:44,497 INFO L87 Difference]: Start difference. First operand 1339 states and 2995 transitions. Second operand 19 states. [2018-09-26 21:15:45,047 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-09-26 21:15:55,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:15:55,064 INFO L93 Difference]: Finished difference Result 3654 states and 8066 transitions. [2018-09-26 21:15:55,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 21:15:55,065 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2018-09-26 21:15:55,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:15:55,068 INFO L225 Difference]: With dead ends: 3654 [2018-09-26 21:15:55,069 INFO L226 Difference]: Without dead ends: 3646 [2018-09-26 21:15:55,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1127, Invalid=3703, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 21:15:55,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3646 states. [2018-09-26 21:15:57,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3646 to 2136. [2018-09-26 21:15:57,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2136 states. [2018-09-26 21:15:57,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 4855 transitions. [2018-09-26 21:15:57,857 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 4855 transitions. Word has length 17 [2018-09-26 21:15:57,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:15:57,857 INFO L480 AbstractCegarLoop]: Abstraction has 2136 states and 4855 transitions. [2018-09-26 21:15:57,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 21:15:57,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 4855 transitions. [2018-09-26 21:15:57,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 21:15:57,858 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:15:57,858 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:15:57,859 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:15:57,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:15:57,859 INFO L82 PathProgramCache]: Analyzing trace with hash -405945350, now seen corresponding path program 1 times [2018-09-26 21:15:57,859 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:15:57,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:15:57,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:57,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:15:57,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:57,945 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-26 21:15:57,945 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:15:57,945 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-26 21:15:57,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:15:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:57,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:15:57,994 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-26 21:15:58,014 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:15:58,014 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-26 21:15:58,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 21:15:58,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 21:15:58,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-26 21:15:58,015 INFO L87 Difference]: Start difference. First operand 2136 states and 4855 transitions. Second operand 11 states. [2018-09-26 21:16:03,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:16:03,638 INFO L93 Difference]: Finished difference Result 2767 states and 6209 transitions. [2018-09-26 21:16:03,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 21:16:03,638 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-26 21:16:03,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:16:03,641 INFO L225 Difference]: With dead ends: 2767 [2018-09-26 21:16:03,641 INFO L226 Difference]: Without dead ends: 2759 [2018-09-26 21:16:03,642 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-26 21:16:03,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2018-09-26 21:16:06,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 2216. [2018-09-26 21:16:06,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2018-09-26 21:16:06,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 5027 transitions. [2018-09-26 21:16:06,500 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 5027 transitions. Word has length 20 [2018-09-26 21:16:06,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:16:06,500 INFO L480 AbstractCegarLoop]: Abstraction has 2216 states and 5027 transitions. [2018-09-26 21:16:06,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 21:16:06,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 5027 transitions. [2018-09-26 21:16:06,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 21:16:06,501 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:16:06,501 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:16:06,501 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:16:06,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:16:06,501 INFO L82 PathProgramCache]: Analyzing trace with hash -408745704, now seen corresponding path program 1 times [2018-09-26 21:16:06,501 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:16:06,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:16:06,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:16:06,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:16:06,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:16:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:16:06,923 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-26 21:16:06,923 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:16:06,924 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-26 21:16:06,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:16:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:16:06,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:16:06,982 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-26 21:16:07,003 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:16:07,003 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-26 21:16:07,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 21:16:07,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 21:16:07,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-26 21:16:07,003 INFO L87 Difference]: Start difference. First operand 2216 states and 5027 transitions. Second operand 11 states. [2018-09-26 21:16:13,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:16:13,349 INFO L93 Difference]: Finished difference Result 3146 states and 7011 transitions. [2018-09-26 21:16:13,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 21:16:13,349 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-26 21:16:13,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:16:13,352 INFO L225 Difference]: With dead ends: 3146 [2018-09-26 21:16:13,353 INFO L226 Difference]: Without dead ends: 3138 [2018-09-26 21:16:13,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2018-09-26 21:16:13,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2018-09-26 21:16:16,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2248. [2018-09-26 21:16:16,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2248 states. [2018-09-26 21:16:16,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 5091 transitions. [2018-09-26 21:16:16,264 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 5091 transitions. Word has length 20 [2018-09-26 21:16:16,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:16:16,264 INFO L480 AbstractCegarLoop]: Abstraction has 2248 states and 5091 transitions. [2018-09-26 21:16:16,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 21:16:16,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 5091 transitions. [2018-09-26 21:16:16,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 21:16:16,265 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:16:16,266 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:16:16,266 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:16:16,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:16:16,266 INFO L82 PathProgramCache]: Analyzing trace with hash -408643559, now seen corresponding path program 1 times [2018-09-26 21:16:16,266 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:16:16,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:16:16,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:16:16,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:16:16,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:16:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:16:16,392 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-26 21:16:16,393 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:16:16,393 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-26 21:16:16,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:16:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:16:16,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:16:16,466 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-26 21:16:16,487 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:16:16,487 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-26 21:16:16,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 21:16:16,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 21:16:16,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-26 21:16:16,487 INFO L87 Difference]: Start difference. First operand 2248 states and 5091 transitions. Second operand 11 states. [2018-09-26 21:16:23,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:16:23,325 INFO L93 Difference]: Finished difference Result 3089 states and 6919 transitions. [2018-09-26 21:16:23,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 21:16:23,325 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-26 21:16:23,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:16:23,329 INFO L225 Difference]: With dead ends: 3089 [2018-09-26 21:16:23,330 INFO L226 Difference]: Without dead ends: 3081 [2018-09-26 21:16:23,330 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-26 21:16:23,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2018-09-26 21:16:26,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 2246. [2018-09-26 21:16:26,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2018-09-26 21:16:26,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 5087 transitions. [2018-09-26 21:16:26,321 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 5087 transitions. Word has length 20 [2018-09-26 21:16:26,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:16:26,321 INFO L480 AbstractCegarLoop]: Abstraction has 2246 states and 5087 transitions. [2018-09-26 21:16:26,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 21:16:26,321 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 5087 transitions. [2018-09-26 21:16:26,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 21:16:26,323 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:16:26,323 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-26 21:16:26,323 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:16:26,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:16:26,323 INFO L82 PathProgramCache]: Analyzing trace with hash 718873437, now seen corresponding path program 1 times [2018-09-26 21:16:26,323 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:16:26,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:16:26,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:16:26,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:16:26,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:16:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:16:26,449 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-26 21:16:26,449 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:16:26,450 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-26 21:16:26,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:16:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:16:26,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:16:26,520 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-26 21:16:26,540 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:16:26,540 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-26 21:16:26,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 21:16:26,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 21:16:26,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-26 21:16:26,541 INFO L87 Difference]: Start difference. First operand 2246 states and 5087 transitions. Second operand 11 states. [2018-09-26 21:16:33,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:16:33,161 INFO L93 Difference]: Finished difference Result 3266 states and 7250 transitions. [2018-09-26 21:16:33,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 21:16:33,161 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-26 21:16:33,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:16:33,165 INFO L225 Difference]: With dead ends: 3266 [2018-09-26 21:16:33,165 INFO L226 Difference]: Without dead ends: 3258 [2018-09-26 21:16:33,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2018-09-26 21:16:33,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3258 states. [2018-09-26 21:16:36,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3258 to 2328. [2018-09-26 21:16:36,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2328 states. [2018-09-26 21:16:36,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 2328 states and 5263 transitions. [2018-09-26 21:16:36,180 INFO L78 Accepts]: Start accepts. Automaton has 2328 states and 5263 transitions. Word has length 20 [2018-09-26 21:16:36,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:16:36,181 INFO L480 AbstractCegarLoop]: Abstraction has 2328 states and 5263 transitions. [2018-09-26 21:16:36,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 21:16:36,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 5263 transitions. [2018-09-26 21:16:36,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 21:16:36,182 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:16:36,182 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-26 21:16:36,182 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:16:36,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:16:36,182 INFO L82 PathProgramCache]: Analyzing trace with hash 718975582, now seen corresponding path program 1 times [2018-09-26 21:16:36,182 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:16:36,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:16:36,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:16:36,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:16:36,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:16:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:16:36,286 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-26 21:16:36,287 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:16:36,287 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:16:36,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:16:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:16:36,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:16:36,344 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-26 21:16:36,365 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:16:36,365 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-09-26 21:16:36,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 21:16:36,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 21:16:36,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-09-26 21:16:36,366 INFO L87 Difference]: Start difference. First operand 2328 states and 5263 transitions. Second operand 11 states. Received shutdown request... [2018-09-26 21:16:37,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 21:16:37,005 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 21:16:37,011 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 21:16:37,011 INFO L202 PluginConnector]: Adding new model threadpooling_out_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:16:37 BoogieIcfgContainer [2018-09-26 21:16:37,011 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:16:37,012 INFO L168 Benchmark]: Toolchain (without parser) took 260294.10 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 864.6 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -184.4 MB). Peak memory consumption was 680.2 MB. Max. memory is 7.1 GB. [2018-09-26 21:16:37,012 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 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-26 21:16:37,013 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.14 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-26 21:16:37,013 INFO L168 Benchmark]: Boogie Preprocessor took 58.79 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-26 21:16:37,013 INFO L168 Benchmark]: RCFGBuilder took 820.27 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-26 21:16:37,014 INFO L168 Benchmark]: TraceAbstraction took 259343.21 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 864.6 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -216.1 MB). Peak memory consumption was 648.4 MB. Max. memory is 7.1 GB. [2018-09-26 21:16:37,017 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.24 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 62.14 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.79 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 820.27 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 259343.21 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 864.6 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -216.1 MB). Peak memory consumption was 648.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 222]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 222). Cancelled while BasicCegarLoop was constructing difference of abstraction (2328states) and FLOYD_HOARE automaton (currently 7 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (65 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 (2328states) and FLOYD_HOARE automaton (currently 7 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (65 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 (2328states) and FLOYD_HOARE automaton (currently 7 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (65 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 (2328states) and FLOYD_HOARE automaton (currently 7 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (65 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 284]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 284). Cancelled while BasicCegarLoop was constructing difference of abstraction (2328states) and FLOYD_HOARE automaton (currently 7 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (65 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 (2328states) and FLOYD_HOARE automaton (currently 7 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (65 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 (2328states) and FLOYD_HOARE automaton (currently 7 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (65 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 (2328states) and FLOYD_HOARE automaton (currently 7 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (65 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 (2328states) and FLOYD_HOARE automaton (currently 7 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (65 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 (2328states) and FLOYD_HOARE automaton (currently 7 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (65 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 (2328states) and FLOYD_HOARE automaton (currently 7 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (65 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 (2328states) and FLOYD_HOARE automaton (currently 7 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (65 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 (2328states) and FLOYD_HOARE automaton (currently 7 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (65 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 (2328states) and FLOYD_HOARE automaton (currently 7 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (65 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 259.2s OverallTime, 53 OverallIterations, 2 TraceHistogramMax, 204.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13664 SDtfs, 45718 SDslu, 47097 SDs, 0 SdLazy, 96126 SolverSat, 10006 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 90.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1870 GetRequests, 344 SyntacticMatches, 5 SemanticMatches, 1521 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25599 ImplicationChecksByTransitivity, 29.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2328occurred in iteration=52, 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: 43.4s AutomataMinimizationTime, 52 MinimizatonAttempts, 28106 StatesRemovedByMinimization, 52 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 1024 NumberOfCodeBlocks, 1024 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 955 ConstructedInterpolants, 0 QuantifiedInterpolants, 50298 SizeOfPredicates, 82 NumberOfNonLiveVariables, 695 ConjunctsInSsa, 156 ConjunctsInUnsatCore, 69 InterpolantComputations, 37 PerfectInterpolantSequences, 45/117 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-26_21-16-37-027.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-26_21-16-37-027.csv Completed graceful shutdown