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.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-bd42740 [2018-09-23 21:17:25,504 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-23 21:17:25,507 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-23 21:17:25,526 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-23 21:17:25,527 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-23 21:17:25,529 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-23 21:17:25,530 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-23 21:17:25,533 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-23 21:17:25,536 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-23 21:17:25,537 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-23 21:17:25,538 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-23 21:17:25,538 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-23 21:17:25,539 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-23 21:17:25,540 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-23 21:17:25,541 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-23 21:17:25,542 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-23 21:17:25,543 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-23 21:17:25,545 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-23 21:17:25,547 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-23 21:17:25,549 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-23 21:17:25,550 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-23 21:17:25,553 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-23 21:17:25,558 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-23 21:17:25,558 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-23 21:17:25,558 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-23 21:17:25,562 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-23 21:17:25,565 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-23 21:17:25,566 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-23 21:17:25,569 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-23 21:17:25,570 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-23 21:17:25,570 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-23 21:17:25,571 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-23 21:17:25,571 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-23 21:17:25,573 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-23 21:17:25,576 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-23 21:17:25,577 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-23 21:17:25,577 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-23 21:17:25,606 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-23 21:17:25,607 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-23 21:17:25,611 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-23 21:17:25,611 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-23 21:17:25,612 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-23 21:17:25,612 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-23 21:17:25,612 INFO L133 SettingsManager]: * Use SBE=true [2018-09-23 21:17:25,613 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-23 21:17:25,613 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-23 21:17:25,613 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-23 21:17:25,615 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-23 21:17:25,615 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-23 21:17:25,615 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-23 21:17:25,616 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-23 21:17:25,616 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-23 21:17:25,616 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-23 21:17:25,616 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-23 21:17:25,618 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-23 21:17:25,618 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-23 21:17:25,618 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-23 21:17:25,618 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-23 21:17:25,619 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-23 21:17:25,619 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 21:17:25,619 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-23 21:17:25,619 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-23 21:17:25,620 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-23 21:17:25,620 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-23 21:17:25,620 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-23 21:17:25,620 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-23 21:17:25,620 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-23 21:17:25,700 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-23 21:17:25,715 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-23 21:17:25,720 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-23 21:17:25,722 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-23 21:17:25,723 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-23 21:17:25,724 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl [2018-09-23 21:17:25,724 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl' [2018-09-23 21:17:25,803 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-23 21:17:25,810 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-23 21:17:25,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-23 21:17:25,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-23 21:17:25,811 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-23 21:17:25,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:25" (1/1) ... [2018-09-23 21:17:25,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:25" (1/1) ... [2018-09-23 21:17:25,869 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-23 21:17:25,872 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-23 21:17:25,872 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-23 21:17:25,874 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-23 21:17:25,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-23 21:17:25,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-23 21:17:25,878 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-23 21:17:25,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:25" (1/1) ... [2018-09-23 21:17:25,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:25" (1/1) ... [2018-09-23 21:17:25,895 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:25" (1/1) ... [2018-09-23 21:17:25,896 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:25" (1/1) ... [2018-09-23 21:17:25,912 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:25" (1/1) ... [2018-09-23 21:17:25,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:25" (1/1) ... [2018-09-23 21:17:25,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:25" (1/1) ... [2018-09-23 21:17:25,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-23 21:17:25,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-23 21:17:25,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-23 21:17:25,940 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-23 21:17:25,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 21:17:26,022 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-23 21:17:26,023 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-23 21:17:26,023 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-23 21:17:26,835 INFO L351 CfgBuilder]: Using library mode [2018-09-23 21:17:26,836 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 09:17:26 BoogieIcfgContainer [2018-09-23 21:17:26,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-23 21:17:26,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-23 21:17:26,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-23 21:17:26,840 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-23 21:17:26,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:17:25" (1/2) ... [2018-09-23 21:17:26,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7955234b and model type threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.09 09:17:26, skipping insertion in model container [2018-09-23 21:17:26,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 09:17:26" (2/2) ... [2018-09-23 21:17:26,843 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out.bpl [2018-09-23 21:17:26,853 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-23 21:17:26,861 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-09-23 21:17:26,912 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-23 21:17:26,913 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-23 21:17:26,913 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-23 21:17:26,913 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-23 21:17:26,913 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-23 21:17:26,913 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-23 21:17:26,914 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-23 21:17:26,914 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-23 21:17:26,914 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-23 21:17:26,933 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-09-23 21:17:26,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-23 21:17:26,940 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:26,941 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:26,943 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:26,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:26,950 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-09-23 21:17:26,952 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:26,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:27,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:27,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:27,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:27,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:17:27,267 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:27,268 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-23 21:17:27,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-23 21:17:27,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-23 21:17:27,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-23 21:17:27,293 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-09-23 21:17:29,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:29,240 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-09-23 21:17:29,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-23 21:17:29,242 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-23 21:17:29,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:29,260 INFO L225 Difference]: With dead ends: 163 [2018-09-23 21:17:29,261 INFO L226 Difference]: Without dead ends: 158 [2018-09-23 21:17:29,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-09-23 21:17:29,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-23 21:17:29,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-09-23 21:17:29,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-23 21:17:29,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-09-23 21:17:29,341 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-09-23 21:17:29,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:29,341 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-09-23 21:17:29,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-23 21:17:29,342 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-09-23 21:17:29,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-23 21:17:29,343 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:29,343 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:29,344 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:29,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:29,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-09-23 21:17:29,345 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:29,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:29,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:29,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:29,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:29,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:17:29,452 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:29,452 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-23 21:17:29,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-23 21:17:29,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-23 21:17:29,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-23 21:17:29,454 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-09-23 21:17:30,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:30,326 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-09-23 21:17:30,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-23 21:17:30,327 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-23 21:17:30,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:30,330 INFO L225 Difference]: With dead ends: 188 [2018-09-23 21:17:30,331 INFO L226 Difference]: Without dead ends: 183 [2018-09-23 21:17:30,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-09-23 21:17:30,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-23 21:17:30,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-09-23 21:17:30,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-23 21:17:30,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-09-23 21:17:30,355 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-09-23 21:17:30,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:30,356 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-09-23 21:17:30,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-23 21:17:30,356 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-09-23 21:17:30,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 21:17:30,357 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:30,358 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:30,358 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:30,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:30,359 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-09-23 21:17:30,359 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:30,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:30,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:30,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:30,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:30,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:17:30,468 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:30,468 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-23 21:17:30,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 21:17:30,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 21:17:30,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-23 21:17:30,470 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-09-23 21:17:32,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:32,154 INFO L93 Difference]: Finished difference Result 361 states and 808 transitions. [2018-09-23 21:17:32,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 21:17:32,155 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-23 21:17:32,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:32,160 INFO L225 Difference]: With dead ends: 361 [2018-09-23 21:17:32,160 INFO L226 Difference]: Without dead ends: 349 [2018-09-23 21:17:32,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-09-23 21:17:32,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-09-23 21:17:32,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 174. [2018-09-23 21:17:32,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-09-23 21:17:32,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 387 transitions. [2018-09-23 21:17:32,201 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 387 transitions. Word has length 9 [2018-09-23 21:17:32,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:32,202 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 387 transitions. [2018-09-23 21:17:32,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 21:17:32,202 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 387 transitions. [2018-09-23 21:17:32,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 21:17:32,204 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:32,204 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:32,205 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:32,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:32,205 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-09-23 21:17:32,205 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:32,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:32,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:32,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:32,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:32,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:17:32,318 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:32,319 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-23 21:17:32,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 21:17:32,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 21:17:32,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-23 21:17:32,320 INFO L87 Difference]: Start difference. First operand 174 states and 387 transitions. Second operand 7 states. [2018-09-23 21:17:33,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:33,539 INFO L93 Difference]: Finished difference Result 307 states and 694 transitions. [2018-09-23 21:17:33,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-23 21:17:33,543 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-23 21:17:33,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:33,546 INFO L225 Difference]: With dead ends: 307 [2018-09-23 21:17:33,547 INFO L226 Difference]: Without dead ends: 302 [2018-09-23 21:17:33,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-09-23 21:17:33,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-09-23 21:17:33,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 203. [2018-09-23 21:17:33,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-23 21:17:33,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-09-23 21:17:33,589 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-09-23 21:17:33,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:33,589 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-09-23 21:17:33,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 21:17:33,590 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-09-23 21:17:33,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 21:17:33,592 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:33,592 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:33,593 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:33,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:33,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-09-23 21:17:33,594 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:33,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:33,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:33,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:33,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:33,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:17:33,877 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:33,877 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 21:17:33,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:17:33,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:17:33,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:17:33,879 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 8 states. [2018-09-23 21:17:38,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:38,974 INFO L93 Difference]: Finished difference Result 741 states and 1656 transitions. [2018-09-23 21:17:38,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-23 21:17:38,974 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 21:17:38,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:38,981 INFO L225 Difference]: With dead ends: 741 [2018-09-23 21:17:38,982 INFO L226 Difference]: Without dead ends: 733 [2018-09-23 21:17:38,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2018-09-23 21:17:38,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-09-23 21:17:39,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 315. [2018-09-23 21:17:39,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-09-23 21:17:39,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 743 transitions. [2018-09-23 21:17:39,039 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 743 transitions. Word has length 12 [2018-09-23 21:17:39,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:39,039 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 743 transitions. [2018-09-23 21:17:39,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:17:39,039 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 743 transitions. [2018-09-23 21:17:39,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 21:17:39,041 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:39,042 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:39,042 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:39,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:39,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-09-23 21:17:39,043 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:39,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:39,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:39,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:39,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:39,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-23 21:17:39,147 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:39,147 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 21:17:39,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:17:39,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:17:39,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:17:39,148 INFO L87 Difference]: Start difference. First operand 315 states and 743 transitions. Second operand 8 states. [2018-09-23 21:17:45,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:45,154 INFO L93 Difference]: Finished difference Result 797 states and 1784 transitions. [2018-09-23 21:17:45,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-23 21:17:45,155 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 21:17:45,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:45,161 INFO L225 Difference]: With dead ends: 797 [2018-09-23 21:17:45,162 INFO L226 Difference]: Without dead ends: 789 [2018-09-23 21:17:45,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-09-23 21:17:45,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-09-23 21:17:45,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 319. [2018-09-23 21:17:45,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-09-23 21:17:45,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 751 transitions. [2018-09-23 21:17:45,227 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 751 transitions. Word has length 12 [2018-09-23 21:17:45,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:45,228 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 751 transitions. [2018-09-23 21:17:45,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:17:45,228 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 751 transitions. [2018-09-23 21:17:45,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 21:17:45,229 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:45,230 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:45,230 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:45,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:45,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-09-23 21:17:45,231 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:45,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:45,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:45,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:45,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:45,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:17:45,339 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:45,339 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 21:17:45,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:17:45,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:17:45,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:17:45,340 INFO L87 Difference]: Start difference. First operand 319 states and 751 transitions. Second operand 8 states. [2018-09-23 21:17:47,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:47,237 INFO L93 Difference]: Finished difference Result 684 states and 1538 transitions. [2018-09-23 21:17:47,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-23 21:17:47,238 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 21:17:47,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:47,244 INFO L225 Difference]: With dead ends: 684 [2018-09-23 21:17:47,245 INFO L226 Difference]: Without dead ends: 676 [2018-09-23 21:17:47,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-09-23 21:17:47,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-09-23 21:17:47,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 330. [2018-09-23 21:17:47,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-09-23 21:17:47,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 778 transitions. [2018-09-23 21:17:47,305 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 778 transitions. Word has length 12 [2018-09-23 21:17:47,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:47,306 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 778 transitions. [2018-09-23 21:17:47,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:17:47,306 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 778 transitions. [2018-09-23 21:17:47,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 21:17:47,307 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:47,307 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:47,308 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:47,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:47,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-09-23 21:17:47,309 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:47,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:47,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:47,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:47,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:47,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:17:47,530 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:47,530 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 21:17:47,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:17:47,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:17:47,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:17:47,531 INFO L87 Difference]: Start difference. First operand 330 states and 778 transitions. Second operand 8 states. [2018-09-23 21:17:48,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:48,936 INFO L93 Difference]: Finished difference Result 605 states and 1360 transitions. [2018-09-23 21:17:48,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-23 21:17:48,936 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 21:17:48,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:48,941 INFO L225 Difference]: With dead ends: 605 [2018-09-23 21:17:48,941 INFO L226 Difference]: Without dead ends: 597 [2018-09-23 21:17:48,942 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-09-23 21:17:48,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-09-23 21:17:49,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 337. [2018-09-23 21:17:49,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-09-23 21:17:49,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 794 transitions. [2018-09-23 21:17:49,006 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 794 transitions. Word has length 12 [2018-09-23 21:17:49,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:49,006 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 794 transitions. [2018-09-23 21:17:49,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:17:49,006 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 794 transitions. [2018-09-23 21:17:49,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 21:17:49,007 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:49,008 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:49,008 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:49,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:49,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1088621469, now seen corresponding path program 1 times [2018-09-23 21:17:49,009 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:49,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:49,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:49,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:49,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:49,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:17:49,117 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:49,117 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 21:17:49,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:17:49,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:17:49,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:17:49,118 INFO L87 Difference]: Start difference. First operand 337 states and 794 transitions. Second operand 8 states. [2018-09-23 21:17:51,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:51,445 INFO L93 Difference]: Finished difference Result 935 states and 2104 transitions. [2018-09-23 21:17:51,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-23 21:17:51,445 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 21:17:51,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:51,451 INFO L225 Difference]: With dead ends: 935 [2018-09-23 21:17:51,451 INFO L226 Difference]: Without dead ends: 927 [2018-09-23 21:17:51,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2018-09-23 21:17:51,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-09-23 21:17:51,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 343. [2018-09-23 21:17:51,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-09-23 21:17:51,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 808 transitions. [2018-09-23 21:17:51,532 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 808 transitions. Word has length 12 [2018-09-23 21:17:51,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:51,532 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 808 transitions. [2018-09-23 21:17:51,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:17:51,532 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 808 transitions. [2018-09-23 21:17:51,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 21:17:51,533 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:51,533 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:51,534 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:51,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:51,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1085821115, now seen corresponding path program 1 times [2018-09-23 21:17:51,534 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:51,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:51,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:51,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:51,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:51,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:17:51,651 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:51,651 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 21:17:51,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:17:51,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:17:51,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:17:51,652 INFO L87 Difference]: Start difference. First operand 343 states and 808 transitions. Second operand 8 states. [2018-09-23 21:17:53,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:53,651 INFO L93 Difference]: Finished difference Result 923 states and 2061 transitions. [2018-09-23 21:17:53,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-23 21:17:53,652 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 21:17:53,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:53,658 INFO L225 Difference]: With dead ends: 923 [2018-09-23 21:17:53,658 INFO L226 Difference]: Without dead ends: 915 [2018-09-23 21:17:53,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-09-23 21:17:53,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-09-23 21:17:53,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 354. [2018-09-23 21:17:53,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-09-23 21:17:53,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 835 transitions. [2018-09-23 21:17:53,749 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 835 transitions. Word has length 12 [2018-09-23 21:17:53,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:53,749 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 835 transitions. [2018-09-23 21:17:53,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:17:53,749 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 835 transitions. [2018-09-23 21:17:53,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 21:17:53,750 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:53,750 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:53,751 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:53,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:53,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1085923260, now seen corresponding path program 1 times [2018-09-23 21:17:53,751 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:53,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:53,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:53,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:53,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:53,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:17:53,831 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:53,831 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 21:17:53,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:17:53,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:17:53,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:17:53,832 INFO L87 Difference]: Start difference. First operand 354 states and 835 transitions. Second operand 8 states. [2018-09-23 21:17:55,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:55,532 INFO L93 Difference]: Finished difference Result 837 states and 1868 transitions. [2018-09-23 21:17:55,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-23 21:17:55,533 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 21:17:55,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:55,538 INFO L225 Difference]: With dead ends: 837 [2018-09-23 21:17:55,539 INFO L226 Difference]: Without dead ends: 829 [2018-09-23 21:17:55,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-09-23 21:17:55,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-09-23 21:17:55,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 339. [2018-09-23 21:17:55,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-09-23 21:17:55,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 800 transitions. [2018-09-23 21:17:55,694 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 800 transitions. Word has length 12 [2018-09-23 21:17:55,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:55,694 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 800 transitions. [2018-09-23 21:17:55,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:17:55,694 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 800 transitions. [2018-09-23 21:17:55,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 21:17:55,695 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:55,695 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:55,696 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:55,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:55,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1383194877, now seen corresponding path program 1 times [2018-09-23 21:17:55,696 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:55,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:55,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:55,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:55,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:55,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:17:55,900 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:55,900 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 21:17:55,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:17:55,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:17:55,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:17:55,901 INFO L87 Difference]: Start difference. First operand 339 states and 800 transitions. Second operand 8 states. [2018-09-23 21:17:58,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:17:58,137 INFO L93 Difference]: Finished difference Result 996 states and 2227 transitions. [2018-09-23 21:17:58,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-23 21:17:58,138 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 21:17:58,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:17:58,144 INFO L225 Difference]: With dead ends: 996 [2018-09-23 21:17:58,144 INFO L226 Difference]: Without dead ends: 988 [2018-09-23 21:17:58,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-09-23 21:17:58,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-09-23 21:17:58,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 381. [2018-09-23 21:17:58,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-23 21:17:58,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-09-23 21:17:58,273 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-09-23 21:17:58,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:17:58,274 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-09-23 21:17:58,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:17:58,275 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-09-23 21:17:58,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 21:17:58,275 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:17:58,276 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:17:58,276 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:17:58,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:17:58,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1383297022, now seen corresponding path program 1 times [2018-09-23 21:17:58,277 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:17:58,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:17:58,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:58,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:17:58,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:17:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:17:58,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:17:58,393 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:17:58,393 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 21:17:58,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:17:58,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:17:58,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:17:58,394 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-09-23 21:18:00,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:00,385 INFO L93 Difference]: Finished difference Result 913 states and 2034 transitions. [2018-09-23 21:18:00,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-23 21:18:00,385 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 21:18:00,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:00,391 INFO L225 Difference]: With dead ends: 913 [2018-09-23 21:18:00,391 INFO L226 Difference]: Without dead ends: 905 [2018-09-23 21:18:00,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2018-09-23 21:18:00,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-09-23 21:18:00,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 371. [2018-09-23 21:18:00,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-09-23 21:18:00,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 890 transitions. [2018-09-23 21:18:00,501 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 890 transitions. Word has length 12 [2018-09-23 21:18:00,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:00,501 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 890 transitions. [2018-09-23 21:18:00,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:18:00,502 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 890 transitions. [2018-09-23 21:18:00,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 21:18:00,503 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:00,503 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:00,503 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:00,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:00,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1392211258, now seen corresponding path program 1 times [2018-09-23 21:18:00,504 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:00,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:00,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:00,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:00,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:00,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:18:00,590 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:00,590 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 21:18:00,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:18:00,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:18:00,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:18:00,591 INFO L87 Difference]: Start difference. First operand 371 states and 890 transitions. Second operand 8 states. [2018-09-23 21:18:02,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:02,321 INFO L93 Difference]: Finished difference Result 886 states and 2009 transitions. [2018-09-23 21:18:02,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-23 21:18:02,321 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 21:18:02,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:02,325 INFO L225 Difference]: With dead ends: 886 [2018-09-23 21:18:02,325 INFO L226 Difference]: Without dead ends: 878 [2018-09-23 21:18:02,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-09-23 21:18:02,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2018-09-23 21:18:02,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 372. [2018-09-23 21:18:02,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-09-23 21:18:02,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 891 transitions. [2018-09-23 21:18:02,435 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 891 transitions. Word has length 12 [2018-09-23 21:18:02,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:02,435 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 891 transitions. [2018-09-23 21:18:02,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:18:02,435 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 891 transitions. [2018-09-23 21:18:02,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 21:18:02,436 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:02,436 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:02,436 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:02,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:02,437 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-09-23 21:18:02,437 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:02,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:02,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:02,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:02,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:02,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:18:02,520 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:02,520 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 21:18:02,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 21:18:02,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 21:18:02,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 21:18:02,521 INFO L87 Difference]: Start difference. First operand 372 states and 891 transitions. Second operand 9 states. [2018-09-23 21:18:04,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:04,440 INFO L93 Difference]: Finished difference Result 801 states and 1838 transitions. [2018-09-23 21:18:04,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-23 21:18:04,440 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-23 21:18:04,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:04,445 INFO L225 Difference]: With dead ends: 801 [2018-09-23 21:18:04,445 INFO L226 Difference]: Without dead ends: 793 [2018-09-23 21:18:04,446 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-23 21:18:04,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-09-23 21:18:04,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 393. [2018-09-23 21:18:04,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-09-23 21:18:04,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 949 transitions. [2018-09-23 21:18:04,639 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 949 transitions. Word has length 12 [2018-09-23 21:18:04,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:04,640 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 949 transitions. [2018-09-23 21:18:04,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 21:18:04,640 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 949 transitions. [2018-09-23 21:18:04,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 21:18:04,641 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:04,641 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:04,641 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:04,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:04,642 INFO L82 PathProgramCache]: Analyzing trace with hash 192619318, now seen corresponding path program 1 times [2018-09-23 21:18:04,642 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:04,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:04,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:04,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:04,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:05,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:18:05,351 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:05,351 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 21:18:05,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 21:18:05,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 21:18:05,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 21:18:05,352 INFO L87 Difference]: Start difference. First operand 393 states and 949 transitions. Second operand 9 states. [2018-09-23 21:18:07,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:07,770 INFO L93 Difference]: Finished difference Result 962 states and 2211 transitions. [2018-09-23 21:18:07,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-23 21:18:07,770 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-23 21:18:07,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:07,775 INFO L225 Difference]: With dead ends: 962 [2018-09-23 21:18:07,775 INFO L226 Difference]: Without dead ends: 954 [2018-09-23 21:18:07,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-09-23 21:18:07,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-09-23 21:18:07,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 409. [2018-09-23 21:18:07,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-09-23 21:18:07,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 997 transitions. [2018-09-23 21:18:07,937 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 997 transitions. Word has length 12 [2018-09-23 21:18:07,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:07,938 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 997 transitions. [2018-09-23 21:18:07,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 21:18:07,938 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 997 transitions. [2018-09-23 21:18:07,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 21:18:07,939 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:07,939 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:07,939 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:07,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:07,939 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-09-23 21:18:07,939 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:07,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:07,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:07,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:07,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:08,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:18:08,019 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:08,019 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 21:18:08,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 21:18:08,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 21:18:08,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 21:18:08,020 INFO L87 Difference]: Start difference. First operand 409 states and 997 transitions. Second operand 9 states. [2018-09-23 21:18:10,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:10,569 INFO L93 Difference]: Finished difference Result 1000 states and 2329 transitions. [2018-09-23 21:18:10,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-23 21:18:10,570 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-23 21:18:10,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:10,574 INFO L225 Difference]: With dead ends: 1000 [2018-09-23 21:18:10,575 INFO L226 Difference]: Without dead ends: 992 [2018-09-23 21:18:10,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-09-23 21:18:10,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-09-23 21:18:10,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 430. [2018-09-23 21:18:10,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-09-23 21:18:10,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1052 transitions. [2018-09-23 21:18:10,754 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1052 transitions. Word has length 12 [2018-09-23 21:18:10,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:10,754 INFO L480 AbstractCegarLoop]: Abstraction has 430 states and 1052 transitions. [2018-09-23 21:18:10,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 21:18:10,754 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1052 transitions. [2018-09-23 21:18:10,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 21:18:10,756 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:10,756 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:10,756 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:10,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:10,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1320238459, now seen corresponding path program 1 times [2018-09-23 21:18:10,757 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:10,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:10,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:10,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:10,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:10,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:18:10,852 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:10,852 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 21:18:10,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 21:18:10,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 21:18:10,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 21:18:10,853 INFO L87 Difference]: Start difference. First operand 430 states and 1052 transitions. Second operand 9 states. [2018-09-23 21:18:13,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:13,614 INFO L93 Difference]: Finished difference Result 1065 states and 2466 transitions. [2018-09-23 21:18:13,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-23 21:18:13,615 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-23 21:18:13,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:13,620 INFO L225 Difference]: With dead ends: 1065 [2018-09-23 21:18:13,620 INFO L226 Difference]: Without dead ends: 1057 [2018-09-23 21:18:13,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-09-23 21:18:13,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2018-09-23 21:18:13,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 471. [2018-09-23 21:18:13,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-09-23 21:18:13,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1168 transitions. [2018-09-23 21:18:13,815 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1168 transitions. Word has length 12 [2018-09-23 21:18:13,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:13,817 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 1168 transitions. [2018-09-23 21:18:13,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 21:18:13,817 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1168 transitions. [2018-09-23 21:18:13,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 21:18:13,818 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:13,818 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:13,819 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:13,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:13,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1320340604, now seen corresponding path program 1 times [2018-09-23 21:18:13,819 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:13,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:13,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:13,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:13,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:13,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:18:13,928 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:13,928 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 21:18:13,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 21:18:13,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 21:18:13,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 21:18:13,929 INFO L87 Difference]: Start difference. First operand 471 states and 1168 transitions. Second operand 9 states. [2018-09-23 21:18:17,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:17,185 INFO L93 Difference]: Finished difference Result 1227 states and 2851 transitions. [2018-09-23 21:18:17,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-23 21:18:17,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-23 21:18:17,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:17,192 INFO L225 Difference]: With dead ends: 1227 [2018-09-23 21:18:17,192 INFO L226 Difference]: Without dead ends: 1219 [2018-09-23 21:18:17,193 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=365, Invalid=967, Unknown=0, NotChecked=0, Total=1332 [2018-09-23 21:18:17,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-09-23 21:18:17,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 438. [2018-09-23 21:18:17,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-09-23 21:18:17,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1072 transitions. [2018-09-23 21:18:17,438 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1072 transitions. Word has length 12 [2018-09-23 21:18:17,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:17,439 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 1072 transitions. [2018-09-23 21:18:17,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 21:18:17,439 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1072 transitions. [2018-09-23 21:18:17,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 21:18:17,440 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:17,440 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:17,440 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:17,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:17,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-09-23 21:18:17,441 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:17,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:17,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:17,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:17,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:18:17,525 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:17,525 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 21:18:17,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 21:18:17,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 21:18:17,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 21:18:17,527 INFO L87 Difference]: Start difference. First operand 438 states and 1072 transitions. Second operand 9 states. [2018-09-23 21:18:20,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:20,347 INFO L93 Difference]: Finished difference Result 1076 states and 2511 transitions. [2018-09-23 21:18:20,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-23 21:18:20,347 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-23 21:18:20,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:20,352 INFO L225 Difference]: With dead ends: 1076 [2018-09-23 21:18:20,352 INFO L226 Difference]: Without dead ends: 1068 [2018-09-23 21:18:20,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-09-23 21:18:20,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2018-09-23 21:18:20,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 445. [2018-09-23 21:18:20,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-09-23 21:18:20,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1088 transitions. [2018-09-23 21:18:20,576 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1088 transitions. Word has length 12 [2018-09-23 21:18:20,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:20,576 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 1088 transitions. [2018-09-23 21:18:20,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 21:18:20,576 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1088 transitions. [2018-09-23 21:18:20,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 21:18:20,577 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:20,577 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:20,577 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:20,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:20,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1838990990, now seen corresponding path program 1 times [2018-09-23 21:18:20,578 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:20,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:20,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:20,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:20,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:20,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:18:20,707 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:20,707 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 21:18:20,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 21:18:20,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 21:18:20,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 21:18:20,708 INFO L87 Difference]: Start difference. First operand 445 states and 1088 transitions. Second operand 9 states. [2018-09-23 21:18:23,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:23,327 INFO L93 Difference]: Finished difference Result 1111 states and 2606 transitions. [2018-09-23 21:18:23,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-23 21:18:23,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-23 21:18:23,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:23,333 INFO L225 Difference]: With dead ends: 1111 [2018-09-23 21:18:23,333 INFO L226 Difference]: Without dead ends: 1103 [2018-09-23 21:18:23,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-09-23 21:18:23,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2018-09-23 21:18:23,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 520. [2018-09-23 21:18:23,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-09-23 21:18:23,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1295 transitions. [2018-09-23 21:18:23,650 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1295 transitions. Word has length 12 [2018-09-23 21:18:23,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:23,651 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 1295 transitions. [2018-09-23 21:18:23,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 21:18:23,651 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1295 transitions. [2018-09-23 21:18:23,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 21:18:23,651 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:23,651 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:23,652 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:23,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:23,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1838888845, now seen corresponding path program 1 times [2018-09-23 21:18:23,652 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:23,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:23,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:23,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:23,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:23,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:18:23,750 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:23,750 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 21:18:23,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 21:18:23,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 21:18:23,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 21:18:23,751 INFO L87 Difference]: Start difference. First operand 520 states and 1295 transitions. Second operand 9 states. [2018-09-23 21:18:27,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:27,190 INFO L93 Difference]: Finished difference Result 1304 states and 3059 transitions. [2018-09-23 21:18:27,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-23 21:18:27,192 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-23 21:18:27,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:27,197 INFO L225 Difference]: With dead ends: 1304 [2018-09-23 21:18:27,197 INFO L226 Difference]: Without dead ends: 1296 [2018-09-23 21:18:27,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2018-09-23 21:18:27,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-09-23 21:18:27,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 487. [2018-09-23 21:18:27,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-09-23 21:18:27,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1199 transitions. [2018-09-23 21:18:27,502 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1199 transitions. Word has length 12 [2018-09-23 21:18:27,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:27,502 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 1199 transitions. [2018-09-23 21:18:27,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 21:18:27,503 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1199 transitions. [2018-09-23 21:18:27,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 21:18:27,503 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:27,504 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:27,504 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:27,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:27,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1731038698, now seen corresponding path program 1 times [2018-09-23 21:18:27,505 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:27,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:27,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:27,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:27,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:27,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:18:27,580 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:27,580 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 21:18:27,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 21:18:27,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 21:18:27,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 21:18:27,581 INFO L87 Difference]: Start difference. First operand 487 states and 1199 transitions. Second operand 9 states. [2018-09-23 21:18:31,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:31,533 INFO L93 Difference]: Finished difference Result 1370 states and 3217 transitions. [2018-09-23 21:18:31,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-23 21:18:31,533 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-23 21:18:31,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:31,541 INFO L225 Difference]: With dead ends: 1370 [2018-09-23 21:18:31,541 INFO L226 Difference]: Without dead ends: 1362 [2018-09-23 21:18:31,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870 [2018-09-23 21:18:31,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2018-09-23 21:18:31,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 479. [2018-09-23 21:18:31,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-09-23 21:18:31,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1179 transitions. [2018-09-23 21:18:31,887 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1179 transitions. Word has length 12 [2018-09-23 21:18:31,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:31,887 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 1179 transitions. [2018-09-23 21:18:31,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 21:18:31,888 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1179 transitions. [2018-09-23 21:18:31,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 21:18:31,889 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:31,889 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:31,889 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:31,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:31,889 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-09-23 21:18:31,890 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:31,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:31,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:31,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:31,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:31,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:18:31,973 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:31,973 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-23 21:18:31,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-23 21:18:31,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-23 21:18:31,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-23 21:18:31,974 INFO L87 Difference]: Start difference. First operand 479 states and 1179 transitions. Second operand 9 states. [2018-09-23 21:18:34,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:34,843 INFO L93 Difference]: Finished difference Result 1298 states and 3068 transitions. [2018-09-23 21:18:34,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-23 21:18:34,844 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-23 21:18:34,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:34,849 INFO L225 Difference]: With dead ends: 1298 [2018-09-23 21:18:34,849 INFO L226 Difference]: Without dead ends: 1290 [2018-09-23 21:18:34,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-09-23 21:18:34,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-09-23 21:18:35,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 602. [2018-09-23 21:18:35,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-09-23 21:18:35,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-09-23 21:18:35,293 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-09-23 21:18:35,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:35,293 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-09-23 21:18:35,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-23 21:18:35,293 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-09-23 21:18:35,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-23 21:18:35,293 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:35,294 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:35,294 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:35,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:35,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1080362888, now seen corresponding path program 1 times [2018-09-23 21:18:35,294 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:35,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:35,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:35,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:35,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:35,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:18:35,348 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:35,348 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-23 21:18:35,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-23 21:18:35,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-23 21:18:35,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-23 21:18:35,349 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-09-23 21:18:36,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:36,277 INFO L93 Difference]: Finished difference Result 1242 states and 3091 transitions. [2018-09-23 21:18:36,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-23 21:18:36,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-23 21:18:36,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:36,280 INFO L225 Difference]: With dead ends: 1242 [2018-09-23 21:18:36,280 INFO L226 Difference]: Without dead ends: 673 [2018-09-23 21:18:36,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-23 21:18:36,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-09-23 21:18:36,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 612. [2018-09-23 21:18:36,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-09-23 21:18:36,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1463 transitions. [2018-09-23 21:18:36,700 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1463 transitions. Word has length 13 [2018-09-23 21:18:36,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:36,700 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 1463 transitions. [2018-09-23 21:18:36,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-23 21:18:36,700 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1463 transitions. [2018-09-23 21:18:36,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-23 21:18:36,701 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:36,701 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:36,701 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:36,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:36,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1652407871, now seen corresponding path program 1 times [2018-09-23 21:18:36,702 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:36,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:36,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:36,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:36,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:18:36,795 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:18:36,795 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 21:18:36,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:36,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:18:37,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:18:37,670 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:18:37,671 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-23 21:18:37,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-23 21:18:37,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-23 21:18:37,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-09-23 21:18:37,672 INFO L87 Difference]: Start difference. First operand 612 states and 1463 transitions. Second operand 16 states. [2018-09-23 21:18:43,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:43,261 INFO L93 Difference]: Finished difference Result 854 states and 1987 transitions. [2018-09-23 21:18:43,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-23 21:18:43,262 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-09-23 21:18:43,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:43,265 INFO L225 Difference]: With dead ends: 854 [2018-09-23 21:18:43,265 INFO L226 Difference]: Without dead ends: 849 [2018-09-23 21:18:43,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-09-23 21:18:43,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-09-23 21:18:44,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 690. [2018-09-23 21:18:44,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-09-23 21:18:44,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1639 transitions. [2018-09-23 21:18:44,205 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1639 transitions. Word has length 13 [2018-09-23 21:18:44,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:44,206 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1639 transitions. [2018-09-23 21:18:44,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-23 21:18:44,206 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1639 transitions. [2018-09-23 21:18:44,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-23 21:18:44,206 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:44,207 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:44,207 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:44,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:44,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1456173380, now seen corresponding path program 1 times [2018-09-23 21:18:44,208 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:44,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:44,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:44,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:44,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:44,355 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:18:44,355 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:18:44,355 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-23 21:18:44,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-23 21:18:44,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-23 21:18:44,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-23 21:18:44,356 INFO L87 Difference]: Start difference. First operand 690 states and 1639 transitions. Second operand 5 states. [2018-09-23 21:18:45,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:18:45,323 INFO L93 Difference]: Finished difference Result 1308 states and 3113 transitions. [2018-09-23 21:18:45,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-23 21:18:45,324 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-23 21:18:45,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:18:45,325 INFO L225 Difference]: With dead ends: 1308 [2018-09-23 21:18:45,325 INFO L226 Difference]: Without dead ends: 709 [2018-09-23 21:18:45,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-23 21:18:45,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-09-23 21:18:45,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 690. [2018-09-23 21:18:45,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-09-23 21:18:45,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-09-23 21:18:45,911 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-09-23 21:18:45,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:18:45,911 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-09-23 21:18:45,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-23 21:18:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-09-23 21:18:45,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 21:18:45,912 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:18:45,912 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:18:45,913 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:18:45,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:18:45,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1952744875, now seen corresponding path program 1 times [2018-09-23 21:18:45,913 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:18:45,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:18:45,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:45,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:45,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:18:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:46,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:18:46,044 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:18:46,044 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 21:18:46,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:18:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:18:46,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:18:46,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:18:46,365 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:18:46,366 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-23 21:18:46,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-23 21:18:46,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-23 21:18:46,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-23 21:18:46,367 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 17 states. [2018-09-23 21:18:53,968 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-23 21:18:56,632 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-23 21:18:58,945 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-23 21:19:02,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:19:02,221 INFO L93 Difference]: Finished difference Result 2011 states and 4412 transitions. [2018-09-23 21:19:02,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-23 21:19:02,221 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-23 21:19:02,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:19:02,225 INFO L225 Difference]: With dead ends: 2011 [2018-09-23 21:19:02,225 INFO L226 Difference]: Without dead ends: 2003 [2018-09-23 21:19:02,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9561 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=3074, Invalid=22366, Unknown=0, NotChecked=0, Total=25440 [2018-09-23 21:19:02,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2018-09-23 21:19:03,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1151. [2018-09-23 21:19:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2018-09-23 21:19:03,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 2622 transitions. [2018-09-23 21:19:03,378 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 2622 transitions. Word has length 16 [2018-09-23 21:19:03,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:19:03,379 INFO L480 AbstractCegarLoop]: Abstraction has 1151 states and 2622 transitions. [2018-09-23 21:19:03,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-23 21:19:03,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 2622 transitions. [2018-09-23 21:19:03,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 21:19:03,380 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:19:03,380 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:19:03,380 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:19:03,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:19:03,381 INFO L82 PathProgramCache]: Analyzing trace with hash -51223093, now seen corresponding path program 1 times [2018-09-23 21:19:03,381 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:19:03,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:19:03,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:19:03,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:19:03,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:19:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:19:03,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:19:03,466 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:19:03,466 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 21:19:03,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:19:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:19:03,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:19:03,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:19:03,658 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:19:03,659 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-23 21:19:03,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-23 21:19:03,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-23 21:19:03,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-23 21:19:03,659 INFO L87 Difference]: Start difference. First operand 1151 states and 2622 transitions. Second operand 17 states. [2018-09-23 21:19:16,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:19:16,512 INFO L93 Difference]: Finished difference Result 2797 states and 6168 transitions. [2018-09-23 21:19:16,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-09-23 21:19:16,512 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-23 21:19:16,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:19:16,520 INFO L225 Difference]: With dead ends: 2797 [2018-09-23 21:19:16,520 INFO L226 Difference]: Without dead ends: 2789 [2018-09-23 21:19:16,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6171 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2430, Invalid=14862, Unknown=0, NotChecked=0, Total=17292 [2018-09-23 21:19:16,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2789 states. [2018-09-23 21:19:17,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2789 to 1186. [2018-09-23 21:19:17,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2018-09-23 21:19:17,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 2705 transitions. [2018-09-23 21:19:17,917 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 2705 transitions. Word has length 16 [2018-09-23 21:19:17,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:19:17,917 INFO L480 AbstractCegarLoop]: Abstraction has 1186 states and 2705 transitions. [2018-09-23 21:19:17,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-23 21:19:17,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 2705 transitions. [2018-09-23 21:19:17,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 21:19:17,918 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:19:17,918 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:19:17,919 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:19:17,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:19:17,919 INFO L82 PathProgramCache]: Analyzing trace with hash -666637335, now seen corresponding path program 1 times [2018-09-23 21:19:17,919 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:19:17,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:19:17,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:19:17,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:19:17,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:19:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:19:18,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:19:18,272 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:19:18,272 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 21:19:18,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:19:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:19:18,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:19:18,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:19:18,548 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:19:18,549 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-23 21:19:18,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-23 21:19:18,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-23 21:19:18,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-23 21:19:18,550 INFO L87 Difference]: Start difference. First operand 1186 states and 2705 transitions. Second operand 17 states. [2018-09-23 21:19:30,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:19:30,190 INFO L93 Difference]: Finished difference Result 2492 states and 5544 transitions. [2018-09-23 21:19:30,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-09-23 21:19:30,190 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-23 21:19:30,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:19:30,197 INFO L225 Difference]: With dead ends: 2492 [2018-09-23 21:19:30,197 INFO L226 Difference]: Without dead ends: 2484 [2018-09-23 21:19:30,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4610 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1718, Invalid=11392, Unknown=0, NotChecked=0, Total=13110 [2018-09-23 21:19:30,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2018-09-23 21:19:31,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 1219. [2018-09-23 21:19:31,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1219 states. [2018-09-23 21:19:31,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 2792 transitions. [2018-09-23 21:19:31,980 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 2792 transitions. Word has length 16 [2018-09-23 21:19:31,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:19:31,980 INFO L480 AbstractCegarLoop]: Abstraction has 1219 states and 2792 transitions. [2018-09-23 21:19:31,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-23 21:19:31,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 2792 transitions. [2018-09-23 21:19:31,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 21:19:31,981 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:19:31,981 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:19:31,981 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:19:31,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:19:31,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1212722005, now seen corresponding path program 1 times [2018-09-23 21:19:31,982 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:19:31,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:19:31,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:19:31,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:19:31,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:19:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:19:32,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:19:32,055 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:19:32,055 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 21:19:32,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:19:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:19:32,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:19:32,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:19:32,466 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-23 21:19:32,466 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2018-09-23 21:19:32,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-23 21:19:32,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-23 21:19:32,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-09-23 21:19:32,467 INFO L87 Difference]: Start difference. First operand 1219 states and 2792 transitions. Second operand 17 states. [2018-09-23 21:19:49,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:19:49,049 INFO L93 Difference]: Finished difference Result 3178 states and 7226 transitions. [2018-09-23 21:19:49,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-09-23 21:19:49,049 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-23 21:19:49,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:19:49,057 INFO L225 Difference]: With dead ends: 3178 [2018-09-23 21:19:49,057 INFO L226 Difference]: Without dead ends: 3170 [2018-09-23 21:19:49,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9560 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2932, Invalid=21248, Unknown=0, NotChecked=0, Total=24180 [2018-09-23 21:19:49,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2018-09-23 21:19:50,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 1242. [2018-09-23 21:19:50,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1242 states. [2018-09-23 21:19:50,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 2857 transitions. [2018-09-23 21:19:50,416 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 2857 transitions. Word has length 16 [2018-09-23 21:19:50,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:19:50,416 INFO L480 AbstractCegarLoop]: Abstraction has 1242 states and 2857 transitions. [2018-09-23 21:19:50,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-23 21:19:50,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 2857 transitions. [2018-09-23 21:19:50,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 21:19:50,417 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:19:50,417 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:19:50,418 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:19:50,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:19:50,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1212619860, now seen corresponding path program 1 times [2018-09-23 21:19:50,418 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:19:50,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:19:50,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:19:50,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:19:50,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:19:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:19:50,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:19:50,590 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:19:50,590 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 21:19:50,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:19:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:19:50,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:19:50,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:19:50,839 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-23 21:19:50,839 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2018-09-23 21:19:50,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-23 21:19:50,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-23 21:19:50,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-09-23 21:19:50,840 INFO L87 Difference]: Start difference. First operand 1242 states and 2857 transitions. Second operand 17 states. [2018-09-23 21:20:04,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:20:04,275 INFO L93 Difference]: Finished difference Result 2638 states and 5927 transitions. [2018-09-23 21:20:04,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-23 21:20:04,275 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-23 21:20:04,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:20:04,281 INFO L225 Difference]: With dead ends: 2638 [2018-09-23 21:20:04,281 INFO L226 Difference]: Without dead ends: 2630 [2018-09-23 21:20:04,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5685 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1807, Invalid=13199, Unknown=0, NotChecked=0, Total=15006 [2018-09-23 21:20:04,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2018-09-23 21:20:05,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 1469. [2018-09-23 21:20:05,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2018-09-23 21:20:05,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 3433 transitions. [2018-09-23 21:20:05,866 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 3433 transitions. Word has length 16 [2018-09-23 21:20:05,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:20:05,866 INFO L480 AbstractCegarLoop]: Abstraction has 1469 states and 3433 transitions. [2018-09-23 21:20:05,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-23 21:20:05,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 3433 transitions. [2018-09-23 21:20:05,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 21:20:05,868 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:20:05,868 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:20:05,868 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:20:05,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:20:05,868 INFO L82 PathProgramCache]: Analyzing trace with hash 780585054, now seen corresponding path program 1 times [2018-09-23 21:20:05,869 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:20:05,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:20:05,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:20:05,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:20:05,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:20:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:20:05,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:20:05,952 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:20:05,952 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 21:20:05,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:20:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:20:05,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:20:06,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:20:06,134 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:20:06,135 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-23 21:20:06,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-23 21:20:06,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-23 21:20:06,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-23 21:20:06,136 INFO L87 Difference]: Start difference. First operand 1469 states and 3433 transitions. Second operand 17 states. [2018-09-23 21:20:19,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:20:19,681 INFO L93 Difference]: Finished difference Result 2854 states and 6510 transitions. [2018-09-23 21:20:19,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-23 21:20:19,681 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-23 21:20:19,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:20:19,686 INFO L225 Difference]: With dead ends: 2854 [2018-09-23 21:20:19,686 INFO L226 Difference]: Without dead ends: 2846 [2018-09-23 21:20:19,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1456, Invalid=7664, Unknown=0, NotChecked=0, Total=9120 [2018-09-23 21:20:19,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2846 states. [2018-09-23 21:20:21,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2846 to 1479. [2018-09-23 21:20:21,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1479 states. [2018-09-23 21:20:21,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 3457 transitions. [2018-09-23 21:20:21,263 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 3457 transitions. Word has length 16 [2018-09-23 21:20:21,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:20:21,264 INFO L480 AbstractCegarLoop]: Abstraction has 1479 states and 3457 transitions. [2018-09-23 21:20:21,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-23 21:20:21,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 3457 transitions. [2018-09-23 21:20:21,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 21:20:21,264 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:20:21,265 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:20:21,265 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:20:21,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:20:21,265 INFO L82 PathProgramCache]: Analyzing trace with hash 165170812, now seen corresponding path program 1 times [2018-09-23 21:20:21,265 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:20:21,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:20:21,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:20:21,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:20:21,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:20:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:20:21,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:20:21,333 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:20:21,333 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 21:20:21,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:20:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:20:21,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:20:21,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:20:21,555 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:20:21,555 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-23 21:20:21,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-23 21:20:21,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-23 21:20:21,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-23 21:20:21,556 INFO L87 Difference]: Start difference. First operand 1479 states and 3457 transitions. Second operand 17 states. [2018-09-23 21:20:36,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:20:36,803 INFO L93 Difference]: Finished difference Result 3363 states and 7697 transitions. [2018-09-23 21:20:36,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-23 21:20:36,804 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-23 21:20:36,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:20:36,808 INFO L225 Difference]: With dead ends: 3363 [2018-09-23 21:20:36,808 INFO L226 Difference]: Without dead ends: 3355 [2018-09-23 21:20:36,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3712 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1635, Invalid=9495, Unknown=0, NotChecked=0, Total=11130 [2018-09-23 21:20:36,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2018-09-23 21:20:38,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 1535. [2018-09-23 21:20:38,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535 states. [2018-09-23 21:20:38,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 3580 transitions. [2018-09-23 21:20:38,422 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 3580 transitions. Word has length 16 [2018-09-23 21:20:38,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:20:38,423 INFO L480 AbstractCegarLoop]: Abstraction has 1535 states and 3580 transitions. [2018-09-23 21:20:38,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-23 21:20:38,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 3580 transitions. [2018-09-23 21:20:38,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 21:20:38,424 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:20:38,424 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:20:38,424 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:20:38,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:20:38,424 INFO L82 PathProgramCache]: Analyzing trace with hash 723989304, now seen corresponding path program 1 times [2018-09-23 21:20:38,425 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:20:38,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:20:38,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:20:38,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:20:38,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:20:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:20:39,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:20:39,270 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:20:39,270 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 21:20:39,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:20:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:20:39,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:20:39,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:20:39,609 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:20:39,609 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2018-09-23 21:20:39,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-23 21:20:39,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-23 21:20:39,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-09-23 21:20:39,610 INFO L87 Difference]: Start difference. First operand 1535 states and 3580 transitions. Second operand 18 states. [2018-09-23 21:20:56,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:20:56,209 INFO L93 Difference]: Finished difference Result 2910 states and 6684 transitions. [2018-09-23 21:20:56,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-23 21:20:56,210 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 16 [2018-09-23 21:20:56,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:20:56,213 INFO L225 Difference]: With dead ends: 2910 [2018-09-23 21:20:56,213 INFO L226 Difference]: Without dead ends: 2902 [2018-09-23 21:20:56,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3369 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1407, Invalid=8693, Unknown=0, NotChecked=0, Total=10100 [2018-09-23 21:20:56,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2018-09-23 21:20:57,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 1226. [2018-09-23 21:20:57,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2018-09-23 21:20:57,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 2816 transitions. [2018-09-23 21:20:57,607 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 2816 transitions. Word has length 16 [2018-09-23 21:20:57,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:20:57,607 INFO L480 AbstractCegarLoop]: Abstraction has 1226 states and 2816 transitions. [2018-09-23 21:20:57,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-23 21:20:57,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 2816 transitions. [2018-09-23 21:20:57,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 21:20:57,608 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:20:57,608 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:20:57,608 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:20:57,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:20:57,609 INFO L82 PathProgramCache]: Analyzing trace with hash 876461633, now seen corresponding path program 1 times [2018-09-23 21:20:57,609 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:20:57,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:20:57,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:20:57,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:20:57,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:20:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:20:57,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:20:57,684 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:20:57,684 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 21:20:57,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:20:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:20:57,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:20:57,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 21:20:57,934 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:20:57,935 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-23 21:20:57,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-23 21:20:57,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-23 21:20:57,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-23 21:20:57,935 INFO L87 Difference]: Start difference. First operand 1226 states and 2816 transitions. Second operand 17 states. [2018-09-23 21:21:11,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:21:11,674 INFO L93 Difference]: Finished difference Result 2474 states and 5593 transitions. [2018-09-23 21:21:11,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-23 21:21:11,675 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-23 21:21:11,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:21:11,678 INFO L225 Difference]: With dead ends: 2474 [2018-09-23 21:21:11,678 INFO L226 Difference]: Without dead ends: 2466 [2018-09-23 21:21:11,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2722 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1240, Invalid=6950, Unknown=0, NotChecked=0, Total=8190 [2018-09-23 21:21:11,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states. [2018-09-23 21:21:12,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 1069. [2018-09-23 21:21:12,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2018-09-23 21:21:12,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 2444 transitions. [2018-09-23 21:21:12,928 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 2444 transitions. Word has length 16 [2018-09-23 21:21:12,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:21:12,928 INFO L480 AbstractCegarLoop]: Abstraction has 1069 states and 2444 transitions. [2018-09-23 21:21:12,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-23 21:21:12,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 2444 transitions. [2018-09-23 21:21:12,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 21:21:12,929 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:21:12,929 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:21:12,929 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:21:12,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:21:12,930 INFO L82 PathProgramCache]: Analyzing trace with hash -345007351, now seen corresponding path program 1 times [2018-09-23 21:21:12,930 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:21:12,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:21:12,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:21:12,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:21:12,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:21:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:21:12,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 21:21:12,996 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:21:12,996 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 21:21:13,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:21:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:21:13,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:21:13,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 21:21:13,038 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:21:13,038 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-23 21:21:13,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:21:13,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:21:13,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:21:13,039 INFO L87 Difference]: Start difference. First operand 1069 states and 2444 transitions. Second operand 8 states. [2018-09-23 21:21:16,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:21:16,637 INFO L93 Difference]: Finished difference Result 1522 states and 3375 transitions. [2018-09-23 21:21:16,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-23 21:21:16,638 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-23 21:21:16,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:21:16,639 INFO L225 Difference]: With dead ends: 1522 [2018-09-23 21:21:16,640 INFO L226 Difference]: Without dead ends: 1514 [2018-09-23 21:21:16,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-09-23 21:21:16,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2018-09-23 21:21:18,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1225. [2018-09-23 21:21:18,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-09-23 21:21:18,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 2809 transitions. [2018-09-23 21:21:18,161 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 2809 transitions. Word has length 16 [2018-09-23 21:21:18,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:21:18,161 INFO L480 AbstractCegarLoop]: Abstraction has 1225 states and 2809 transitions. [2018-09-23 21:21:18,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:21:18,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 2809 transitions. [2018-09-23 21:21:18,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 21:21:18,162 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:21:18,162 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:21:18,163 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:21:18,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:21:18,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521947, now seen corresponding path program 1 times [2018-09-23 21:21:18,163 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:21:18,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:21:18,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:21:18,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:21:18,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:21:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:21:18,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 21:21:18,323 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:21:18,323 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 21:21:18,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:21:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:21:18,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:21:18,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 21:21:18,367 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:21:18,368 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-23 21:21:18,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:21:18,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:21:18,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:21:18,368 INFO L87 Difference]: Start difference. First operand 1225 states and 2809 transitions. Second operand 8 states. [2018-09-23 21:21:22,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:21:22,231 INFO L93 Difference]: Finished difference Result 1661 states and 3674 transitions. [2018-09-23 21:21:22,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-23 21:21:22,231 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-23 21:21:22,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:21:22,233 INFO L225 Difference]: With dead ends: 1661 [2018-09-23 21:21:22,233 INFO L226 Difference]: Without dead ends: 1653 [2018-09-23 21:21:22,234 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-09-23 21:21:22,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2018-09-23 21:21:23,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1237. [2018-09-23 21:21:23,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2018-09-23 21:21:23,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 2833 transitions. [2018-09-23 21:21:23,627 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 2833 transitions. Word has length 16 [2018-09-23 21:21:23,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:21:23,627 INFO L480 AbstractCegarLoop]: Abstraction has 1237 states and 2833 transitions. [2018-09-23 21:21:23,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:21:23,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 2833 transitions. [2018-09-23 21:21:23,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 21:21:23,628 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:21:23,628 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:21:23,628 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:21:23,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:21:23,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521668, now seen corresponding path program 1 times [2018-09-23 21:21:23,628 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:21:23,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:21:23,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:21:23,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:21:23,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:21:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:21:23,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 21:21:23,699 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:21:23,700 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 21:21:23,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:21:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:21:23,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:21:23,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 21:21:23,742 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:21:23,742 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-23 21:21:23,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:21:23,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:21:23,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:21:23,742 INFO L87 Difference]: Start difference. First operand 1237 states and 2833 transitions. Second operand 8 states. [2018-09-23 21:21:28,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:21:28,319 INFO L93 Difference]: Finished difference Result 1772 states and 3936 transitions. [2018-09-23 21:21:28,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-23 21:21:28,319 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-23 21:21:28,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:21:28,321 INFO L225 Difference]: With dead ends: 1772 [2018-09-23 21:21:28,321 INFO L226 Difference]: Without dead ends: 1764 [2018-09-23 21:21:28,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-09-23 21:21:28,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2018-09-23 21:21:29,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1318. [2018-09-23 21:21:29,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1318 states. [2018-09-23 21:21:29,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 3019 transitions. [2018-09-23 21:21:29,887 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 3019 transitions. Word has length 16 [2018-09-23 21:21:29,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:21:29,887 INFO L480 AbstractCegarLoop]: Abstraction has 1318 states and 3019 transitions. [2018-09-23 21:21:29,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:21:29,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 3019 transitions. [2018-09-23 21:21:29,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 21:21:29,888 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:21:29,888 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:21:29,888 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:21:29,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:21:29,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1133346772, now seen corresponding path program 1 times [2018-09-23 21:21:29,888 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:21:29,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:21:29,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:21:29,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:21:29,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:21:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:21:29,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 21:21:29,974 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:21:29,974 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 21:21:29,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:21:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:21:29,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:21:29,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 21:21:30,011 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:21:30,011 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-23 21:21:30,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:21:30,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:21:30,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:21:30,012 INFO L87 Difference]: Start difference. First operand 1318 states and 3019 transitions. Second operand 8 states. [2018-09-23 21:21:34,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:21:34,103 INFO L93 Difference]: Finished difference Result 1789 states and 3956 transitions. [2018-09-23 21:21:34,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-23 21:21:34,103 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-23 21:21:34,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:21:34,106 INFO L225 Difference]: With dead ends: 1789 [2018-09-23 21:21:34,106 INFO L226 Difference]: Without dead ends: 1781 [2018-09-23 21:21:34,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-09-23 21:21:34,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2018-09-23 21:21:35,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1345. [2018-09-23 21:21:35,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1345 states. [2018-09-23 21:21:35,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 3076 transitions. [2018-09-23 21:21:35,821 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 3076 transitions. Word has length 16 [2018-09-23 21:21:35,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:21:35,821 INFO L480 AbstractCegarLoop]: Abstraction has 1345 states and 3076 transitions. [2018-09-23 21:21:35,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:21:35,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 3076 transitions. [2018-09-23 21:21:35,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 21:21:35,821 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:21:35,822 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-23 21:21:35,822 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:21:35,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:21:35,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1133347051, now seen corresponding path program 1 times [2018-09-23 21:21:35,822 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:21:35,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:21:35,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:21:35,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:21:35,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:21:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:21:35,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 21:21:35,909 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:21:35,909 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 21:21:35,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:21:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:21:35,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:21:35,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-23 21:21:35,948 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:21:35,948 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-23 21:21:35,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:21:35,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:21:35,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:21:35,949 INFO L87 Difference]: Start difference. First operand 1345 states and 3076 transitions. Second operand 8 states. Received shutdown request... [2018-09-23 21:21:37,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-23 21:21:37,642 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-23 21:21:37,648 WARN L206 ceAbstractionStarter]: Timeout [2018-09-23 21:21:37,649 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.09 09:21:37 BoogieIcfgContainer [2018-09-23 21:21:37,649 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-23 21:21:37,649 INFO L168 Benchmark]: Toolchain (without parser) took 251845.12 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 838.9 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -334.8 MB). Peak memory consumption was 504.0 MB. Max. memory is 7.1 GB. [2018-09-23 21:21:37,650 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 21:21:37,651 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 21:21:37,651 INFO L168 Benchmark]: Boogie Preprocessor took 61.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 21:21:37,652 INFO L168 Benchmark]: RCFGBuilder took 897.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-23 21:21:37,652 INFO L168 Benchmark]: TraceAbstraction took 250811.60 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 838.9 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -366.6 MB). Peak memory consumption was 472.3 MB. Max. memory is 7.1 GB. [2018-09-23 21:21:37,655 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 897.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 250811.60 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 838.9 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -366.6 MB). Peak memory consumption was 472.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 205]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 205). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (380 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 (1345states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (380 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 222]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 222). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (380 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 (1345states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (380 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 (1345states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (380 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 (1345states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (380 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 (1345states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (380 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 (1345states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (380 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 (1345states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (380 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 (1345states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (380 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 (1345states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (380 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 (1345states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (380 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 (1345states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (380 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 (1345states) and FLOYD_HOARE automaton (currently 14 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (380 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 250.7s OverallTime, 41 OverallIterations, 2 TraceHistogramMax, 215.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12206 SDtfs, 40893 SDslu, 48928 SDs, 0 SdLazy, 118637 SolverSat, 8841 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 108.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2032 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 1716 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 51500 ImplicationChecksByTransitivity, 40.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1535occurred in iteration=34, 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: 24.8s AutomataMinimizationTime, 40 MinimizatonAttempts, 26535 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 772 NumberOfCodeBlocks, 772 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 716 ConstructedInterpolants, 78 QuantifiedInterpolants, 46500 SizeOfPredicates, 88 NumberOfNonLiveVariables, 595 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 56 InterpolantComputations, 28 PerfectInterpolantSequences, 40/83 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.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-23_21-21-37-666.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-23_21-21-37-666.csv Completed graceful shutdown