java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:41:59,341 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:41:59,343 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:41:59,357 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:41:59,358 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:41:59,359 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:41:59,360 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:41:59,362 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:41:59,364 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:41:59,365 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:41:59,366 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:41:59,366 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:41:59,367 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:41:59,368 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:41:59,369 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:41:59,370 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:41:59,371 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:41:59,373 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:41:59,375 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:41:59,377 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:41:59,378 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:41:59,379 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:41:59,382 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:41:59,382 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:41:59,382 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:41:59,383 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:41:59,384 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:41:59,385 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:41:59,386 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:41:59,387 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:41:59,387 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:41:59,388 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:41:59,388 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:41:59,389 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:41:59,390 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:41:59,390 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:41:59,391 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 12:41:59,407 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:41:59,408 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:41:59,409 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:41:59,409 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:41:59,409 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:41:59,410 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:41:59,410 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:41:59,410 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:41:59,410 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:41:59,411 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:41:59,411 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:41:59,411 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:41:59,411 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:41:59,411 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:41:59,412 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:41:59,412 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:41:59,412 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:41:59,412 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:41:59,413 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:41:59,413 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:41:59,413 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:41:59,413 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:41:59,413 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:41:59,414 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:41:59,414 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:41:59,414 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:41:59,414 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:41:59,414 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:41:59,414 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:41:59,415 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:41:59,415 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:41:59,462 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:41:59,484 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:41:59,489 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:41:59,491 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:41:59,492 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:41:59,492 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-10-04 12:41:59,493 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl' [2018-10-04 12:41:59,587 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:41:59,589 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:41:59,590 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:41:59,590 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:41:59,590 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:41:59,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:59" (1/1) ... [2018-10-04 12:41:59,630 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:59" (1/1) ... [2018-10-04 12:41:59,635 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 12:41:59,635 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 12:41:59,635 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 12:41:59,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:41:59,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:41:59,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:41:59,639 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:41:59,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:59" (1/1) ... [2018-10-04 12:41:59,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:59" (1/1) ... [2018-10-04 12:41:59,655 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:59" (1/1) ... [2018-10-04 12:41:59,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:59" (1/1) ... [2018-10-04 12:41:59,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:59" (1/1) ... [2018-10-04 12:41:59,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:59" (1/1) ... [2018-10-04 12:41:59,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:59" (1/1) ... [2018-10-04 12:41:59,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:41:59,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:41:59,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:41:59,676 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:41:59,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:41:59,766 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-04 12:41:59,766 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-04 12:41:59,767 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-04 12:42:00,582 INFO L338 CfgBuilder]: Using library mode [2018-10-04 12:42:00,583 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:42:00 BoogieIcfgContainer [2018-10-04 12:42:00,583 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:42:00,585 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:42:00,585 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:42:00,588 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:42:00,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:41:59" (1/2) ... [2018-10-04 12:42:00,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b55cfd and model type threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:42:00, skipping insertion in model container [2018-10-04 12:42:00,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:42:00" (2/2) ... [2018-10-04 12:42:00,592 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out.bpl [2018-10-04 12:42:00,602 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:42:00,611 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-10-04 12:42:00,666 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:42:00,667 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:42:00,667 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:42:00,668 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:42:00,668 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:42:00,668 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:42:00,668 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:42:00,668 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:42:00,668 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:42:00,689 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-10-04 12:42:00,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 12:42:00,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:00,697 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:00,699 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:00,709 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:00,710 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-10-04 12:42:00,712 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:00,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:00,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:00,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:00,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:01,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:01,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:01,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:42:01,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:42:01,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:42:01,143 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:01,146 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-10-04 12:42:03,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:03,085 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-10-04 12:42:03,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:42:03,089 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-04 12:42:03,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:03,107 INFO L225 Difference]: With dead ends: 163 [2018-10-04 12:42:03,107 INFO L226 Difference]: Without dead ends: 158 [2018-10-04 12:42:03,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 7 [2018-10-04 12:42:03,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-04 12:42:03,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-10-04 12:42:03,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-04 12:42:03,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-10-04 12:42:03,174 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-10-04 12:42:03,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:03,174 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-10-04 12:42:03,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:42:03,175 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-10-04 12:42:03,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 12:42:03,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:03,176 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:03,177 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:03,177 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:03,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-10-04 12:42:03,177 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:03,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:03,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:03,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:03,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:03,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-10-04 12:42:03,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:03,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:42:03,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:42:03,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:42:03,342 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:03,342 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-10-04 12:42:04,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:04,276 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-10-04 12:42:04,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:42:04,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-04 12:42:04,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:04,280 INFO L225 Difference]: With dead ends: 188 [2018-10-04 12:42:04,280 INFO L226 Difference]: Without dead ends: 183 [2018-10-04 12:42:04,281 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 7 [2018-10-04 12:42:04,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-04 12:42:04,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-10-04 12:42:04,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-04 12:42:04,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-10-04 12:42:04,323 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-10-04 12:42:04,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:04,323 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-10-04 12:42:04,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:42:04,324 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-10-04 12:42:04,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:42:04,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:04,330 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:04,330 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:04,331 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:04,332 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-10-04 12:42:04,332 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:04,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:04,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:04,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:04,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:04,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:04,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:04,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:42:04,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:42:04,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:42:04,450 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:04,450 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-10-04 12:42:06,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:06,215 INFO L93 Difference]: Finished difference Result 361 states and 808 transitions. [2018-10-04 12:42:06,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:42:06,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-10-04 12:42:06,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:06,220 INFO L225 Difference]: With dead ends: 361 [2018-10-04 12:42:06,220 INFO L226 Difference]: Without dead ends: 349 [2018-10-04 12:42:06,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 13 [2018-10-04 12:42:06,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-10-04 12:42:06,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 174. [2018-10-04 12:42:06,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-10-04 12:42:06,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 387 transitions. [2018-10-04 12:42:06,259 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 387 transitions. Word has length 9 [2018-10-04 12:42:06,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:06,259 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 387 transitions. [2018-10-04 12:42:06,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:42:06,260 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 387 transitions. [2018-10-04 12:42:06,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:42:06,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:06,261 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:06,262 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:06,262 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:06,263 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-10-04 12:42:06,263 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:06,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:06,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:06,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:06,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:06,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:06,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:06,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:42:06,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:42:06,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:42:06,727 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:06,727 INFO L87 Difference]: Start difference. First operand 174 states and 387 transitions. Second operand 7 states. [2018-10-04 12:42:08,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:08,555 INFO L93 Difference]: Finished difference Result 307 states and 694 transitions. [2018-10-04 12:42:08,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:42:08,556 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-10-04 12:42:08,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:08,559 INFO L225 Difference]: With dead ends: 307 [2018-10-04 12:42:08,559 INFO L226 Difference]: Without dead ends: 302 [2018-10-04 12:42:08,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.4s impTime 8 [2018-10-04 12:42:08,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-04 12:42:08,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 203. [2018-10-04 12:42:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-04 12:42:08,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-10-04 12:42:08,602 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-10-04 12:42:08,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:08,603 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-10-04 12:42:08,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:42:08,603 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-10-04 12:42:08,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:08,605 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:08,605 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:08,606 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:08,606 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:08,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-10-04 12:42:08,607 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:08,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:08,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:08,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:08,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:08,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:08,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:08,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:08,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:08,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:08,926 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:08,927 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 8 states. [2018-10-04 12:42:10,926 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 7 [2018-10-04 12:42:12,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:12,290 INFO L93 Difference]: Finished difference Result 741 states and 1656 transitions. [2018-10-04 12:42:12,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 12:42:12,291 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 12:42:12,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:12,298 INFO L225 Difference]: With dead ends: 741 [2018-10-04 12:42:12,298 INFO L226 Difference]: Without dead ends: 733 [2018-10-04 12:42:12,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.6s impTime 7 [2018-10-04 12:42:12,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-10-04 12:42:12,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 315. [2018-10-04 12:42:12,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-04 12:42:12,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 743 transitions. [2018-10-04 12:42:12,355 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 743 transitions. Word has length 12 [2018-10-04 12:42:12,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:12,355 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 743 transitions. [2018-10-04 12:42:12,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:12,356 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 743 transitions. [2018-10-04 12:42:12,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:12,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:12,358 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:12,358 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:12,359 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:12,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-10-04 12:42:12,359 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:12,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:12,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:12,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:12,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:12,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:12,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:12,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:12,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:12,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:12,502 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:12,502 INFO L87 Difference]: Start difference. First operand 315 states and 743 transitions. Second operand 8 states. [2018-10-04 12:42:16,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:16,377 INFO L93 Difference]: Finished difference Result 797 states and 1784 transitions. [2018-10-04 12:42:16,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 12:42:16,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 12:42:16,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:16,388 INFO L225 Difference]: With dead ends: 797 [2018-10-04 12:42:16,389 INFO L226 Difference]: Without dead ends: 789 [2018-10-04 12:42:16,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 14 [2018-10-04 12:42:16,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-10-04 12:42:16,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 319. [2018-10-04 12:42:16,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-10-04 12:42:16,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 751 transitions. [2018-10-04 12:42:16,439 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 751 transitions. Word has length 12 [2018-10-04 12:42:16,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:16,440 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 751 transitions. [2018-10-04 12:42:16,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:16,440 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 751 transitions. [2018-10-04 12:42:16,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:16,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:16,442 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:16,442 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:16,442 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:16,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-10-04 12:42:16,443 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:16,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:16,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:16,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:16,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:16,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:16,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:16,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:16,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:16,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:16,559 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:16,559 INFO L87 Difference]: Start difference. First operand 319 states and 751 transitions. Second operand 8 states. [2018-10-04 12:42:18,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:18,396 INFO L93 Difference]: Finished difference Result 684 states and 1538 transitions. [2018-10-04 12:42:18,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:42:18,397 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 12:42:18,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:18,402 INFO L225 Difference]: With dead ends: 684 [2018-10-04 12:42:18,402 INFO L226 Difference]: Without dead ends: 676 [2018-10-04 12:42:18,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 17 [2018-10-04 12:42:18,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-10-04 12:42:18,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 330. [2018-10-04 12:42:18,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-10-04 12:42:18,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 778 transitions. [2018-10-04 12:42:18,469 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 778 transitions. Word has length 12 [2018-10-04 12:42:18,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:18,470 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 778 transitions. [2018-10-04 12:42:18,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:18,470 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 778 transitions. [2018-10-04 12:42:18,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:18,471 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:18,471 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:18,472 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:18,472 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:18,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-10-04 12:42:18,472 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:18,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:18,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:18,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:18,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:18,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:18,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:18,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:18,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:18,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:18,766 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:18,767 INFO L87 Difference]: Start difference. First operand 330 states and 778 transitions. Second operand 8 states. [2018-10-04 12:42:20,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:20,248 INFO L93 Difference]: Finished difference Result 605 states and 1360 transitions. [2018-10-04 12:42:20,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:42:20,249 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 12:42:20,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:20,254 INFO L225 Difference]: With dead ends: 605 [2018-10-04 12:42:20,255 INFO L226 Difference]: Without dead ends: 597 [2018-10-04 12:42:20,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 15 [2018-10-04 12:42:20,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-10-04 12:42:20,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 337. [2018-10-04 12:42:20,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-10-04 12:42:20,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 794 transitions. [2018-10-04 12:42:20,316 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 794 transitions. Word has length 12 [2018-10-04 12:42:20,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:20,317 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 794 transitions. [2018-10-04 12:42:20,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:20,317 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 794 transitions. [2018-10-04 12:42:20,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:20,318 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:20,318 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:20,319 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:20,319 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:20,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1088621469, now seen corresponding path program 1 times [2018-10-04 12:42:20,319 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:20,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:20,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:20,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:20,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:20,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:20,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:20,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:20,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:20,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:20,565 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:20,565 INFO L87 Difference]: Start difference. First operand 337 states and 794 transitions. Second operand 8 states. [2018-10-04 12:42:22,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:22,644 INFO L93 Difference]: Finished difference Result 935 states and 2104 transitions. [2018-10-04 12:42:22,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:42:22,645 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 12:42:22,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:22,651 INFO L225 Difference]: With dead ends: 935 [2018-10-04 12:42:22,651 INFO L226 Difference]: Without dead ends: 927 [2018-10-04 12:42:22,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 14 [2018-10-04 12:42:22,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-10-04 12:42:22,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 343. [2018-10-04 12:42:22,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-10-04 12:42:22,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 808 transitions. [2018-10-04 12:42:22,741 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 808 transitions. Word has length 12 [2018-10-04 12:42:22,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:22,741 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 808 transitions. [2018-10-04 12:42:22,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:22,742 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 808 transitions. [2018-10-04 12:42:22,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:22,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:22,742 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:22,743 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:22,743 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:22,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1085821115, now seen corresponding path program 1 times [2018-10-04 12:42:22,744 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:22,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:22,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:22,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:22,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:22,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:22,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:22,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:22,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:22,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:22,829 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:22,829 INFO L87 Difference]: Start difference. First operand 343 states and 808 transitions. Second operand 8 states. [2018-10-04 12:42:24,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:24,954 INFO L93 Difference]: Finished difference Result 923 states and 2061 transitions. [2018-10-04 12:42:24,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:42:24,955 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 12:42:24,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:24,959 INFO L225 Difference]: With dead ends: 923 [2018-10-04 12:42:24,960 INFO L226 Difference]: Without dead ends: 915 [2018-10-04 12:42:24,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 16 [2018-10-04 12:42:24,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-10-04 12:42:25,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 354. [2018-10-04 12:42:25,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-10-04 12:42:25,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 835 transitions. [2018-10-04 12:42:25,060 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 835 transitions. Word has length 12 [2018-10-04 12:42:25,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:25,060 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 835 transitions. [2018-10-04 12:42:25,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:25,060 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 835 transitions. [2018-10-04 12:42:25,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:25,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:25,061 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:25,062 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:25,062 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:25,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1085923260, now seen corresponding path program 1 times [2018-10-04 12:42:25,062 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:25,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:25,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:25,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:25,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:25,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:25,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:25,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:25,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:25,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:25,170 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:25,171 INFO L87 Difference]: Start difference. First operand 354 states and 835 transitions. Second operand 8 states. [2018-10-04 12:42:26,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:26,997 INFO L93 Difference]: Finished difference Result 837 states and 1868 transitions. [2018-10-04 12:42:26,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:42:26,998 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 12:42:26,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:27,003 INFO L225 Difference]: With dead ends: 837 [2018-10-04 12:42:27,003 INFO L226 Difference]: Without dead ends: 829 [2018-10-04 12:42:27,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 15 [2018-10-04 12:42:27,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-10-04 12:42:27,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 339. [2018-10-04 12:42:27,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-04 12:42:27,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 800 transitions. [2018-10-04 12:42:27,116 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 800 transitions. Word has length 12 [2018-10-04 12:42:27,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:27,116 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 800 transitions. [2018-10-04 12:42:27,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:27,116 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 800 transitions. [2018-10-04 12:42:27,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:27,117 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:27,117 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:27,118 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:27,118 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:27,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1383194877, now seen corresponding path program 1 times [2018-10-04 12:42:27,119 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:27,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:27,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:27,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:27,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:27,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:27,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:27,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:27,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:27,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:27,433 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:27,433 INFO L87 Difference]: Start difference. First operand 339 states and 800 transitions. Second operand 8 states. [2018-10-04 12:42:29,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:29,855 INFO L93 Difference]: Finished difference Result 996 states and 2227 transitions. [2018-10-04 12:42:29,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 12:42:29,855 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 12:42:29,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:29,861 INFO L225 Difference]: With dead ends: 996 [2018-10-04 12:42:29,861 INFO L226 Difference]: Without dead ends: 988 [2018-10-04 12:42:29,862 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 16 [2018-10-04 12:42:29,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-10-04 12:42:29,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 381. [2018-10-04 12:42:29,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-04 12:42:29,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-10-04 12:42:29,979 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-10-04 12:42:29,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:29,980 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-10-04 12:42:29,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:29,981 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-10-04 12:42:29,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:29,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:29,982 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:29,982 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:29,982 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:29,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1383297022, now seen corresponding path program 1 times [2018-10-04 12:42:29,983 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:29,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:29,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:29,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:29,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:30,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:30,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:30,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:30,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:30,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:30,132 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:30,132 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-10-04 12:42:32,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:32,162 INFO L93 Difference]: Finished difference Result 913 states and 2034 transitions. [2018-10-04 12:42:32,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 12:42:32,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 12:42:32,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:32,168 INFO L225 Difference]: With dead ends: 913 [2018-10-04 12:42:32,168 INFO L226 Difference]: Without dead ends: 905 [2018-10-04 12:42:32,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 17 [2018-10-04 12:42:32,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-10-04 12:42:32,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 371. [2018-10-04 12:42:32,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-10-04 12:42:32,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 890 transitions. [2018-10-04 12:42:32,299 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 890 transitions. Word has length 12 [2018-10-04 12:42:32,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:32,300 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 890 transitions. [2018-10-04 12:42:32,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:32,300 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 890 transitions. [2018-10-04 12:42:32,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:32,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:32,301 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:32,301 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:32,302 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:32,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1392211258, now seen corresponding path program 1 times [2018-10-04 12:42:32,302 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:32,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:32,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:32,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:32,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:32,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:32,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:32,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:32,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:32,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:32,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:32,396 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:32,397 INFO L87 Difference]: Start difference. First operand 371 states and 890 transitions. Second operand 8 states. [2018-10-04 12:42:34,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:34,127 INFO L93 Difference]: Finished difference Result 886 states and 2009 transitions. [2018-10-04 12:42:34,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:42:34,127 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-04 12:42:34,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:34,131 INFO L225 Difference]: With dead ends: 886 [2018-10-04 12:42:34,131 INFO L226 Difference]: Without dead ends: 878 [2018-10-04 12:42:34,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 14 [2018-10-04 12:42:34,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2018-10-04 12:42:34,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 372. [2018-10-04 12:42:34,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-10-04 12:42:34,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 891 transitions. [2018-10-04 12:42:34,244 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 891 transitions. Word has length 12 [2018-10-04 12:42:34,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:34,245 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 891 transitions. [2018-10-04 12:42:34,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:34,245 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 891 transitions. [2018-10-04 12:42:34,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:34,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:34,246 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:34,246 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:34,246 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:34,246 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-10-04 12:42:34,246 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:34,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:34,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:34,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:34,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:34,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:34,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:34,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:34,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:42:34,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:42:34,378 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:34,379 INFO L87 Difference]: Start difference. First operand 372 states and 891 transitions. Second operand 9 states. [2018-10-04 12:42:36,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:36,145 INFO L93 Difference]: Finished difference Result 801 states and 1838 transitions. [2018-10-04 12:42:36,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:42:36,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 12:42:36,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:36,149 INFO L225 Difference]: With dead ends: 801 [2018-10-04 12:42:36,149 INFO L226 Difference]: Without dead ends: 793 [2018-10-04 12:42:36,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 17 [2018-10-04 12:42:36,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-10-04 12:42:36,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 393. [2018-10-04 12:42:36,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-10-04 12:42:36,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 949 transitions. [2018-10-04 12:42:36,296 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 949 transitions. Word has length 12 [2018-10-04 12:42:36,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:36,297 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 949 transitions. [2018-10-04 12:42:36,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:42:36,297 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 949 transitions. [2018-10-04 12:42:36,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:36,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:36,298 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:36,298 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:36,299 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:36,299 INFO L82 PathProgramCache]: Analyzing trace with hash 192619318, now seen corresponding path program 1 times [2018-10-04 12:42:36,299 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:36,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:36,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:36,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:36,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:36,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:36,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:36,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:36,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:42:36,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:42:36,408 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:36,409 INFO L87 Difference]: Start difference. First operand 393 states and 949 transitions. Second operand 9 states. [2018-10-04 12:42:38,884 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 7 [2018-10-04 12:42:38,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:38,900 INFO L93 Difference]: Finished difference Result 962 states and 2211 transitions. [2018-10-04 12:42:38,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 12:42:38,901 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 12:42:38,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:38,906 INFO L225 Difference]: With dead ends: 962 [2018-10-04 12:42:38,906 INFO L226 Difference]: Without dead ends: 954 [2018-10-04 12:42:38,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 7 [2018-10-04 12:42:38,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-10-04 12:42:39,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 409. [2018-10-04 12:42:39,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-10-04 12:42:39,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 997 transitions. [2018-10-04 12:42:39,064 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 997 transitions. Word has length 12 [2018-10-04 12:42:39,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:39,064 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 997 transitions. [2018-10-04 12:42:39,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:42:39,064 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 997 transitions. [2018-10-04 12:42:39,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:39,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:39,065 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:39,066 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:39,066 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:39,066 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-10-04 12:42:39,066 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:39,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:39,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:39,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:39,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:39,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:39,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:39,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:39,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:42:39,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:42:39,152 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:39,153 INFO L87 Difference]: Start difference. First operand 409 states and 997 transitions. Second operand 9 states. [2018-10-04 12:42:41,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:41,530 INFO L93 Difference]: Finished difference Result 1000 states and 2329 transitions. [2018-10-04 12:42:41,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 12:42:41,531 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 12:42:41,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:41,536 INFO L225 Difference]: With dead ends: 1000 [2018-10-04 12:42:41,536 INFO L226 Difference]: Without dead ends: 992 [2018-10-04 12:42:41,536 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 17 [2018-10-04 12:42:41,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-10-04 12:42:41,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 430. [2018-10-04 12:42:41,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-10-04 12:42:41,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1052 transitions. [2018-10-04 12:42:41,711 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1052 transitions. Word has length 12 [2018-10-04 12:42:41,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:41,711 INFO L480 AbstractCegarLoop]: Abstraction has 430 states and 1052 transitions. [2018-10-04 12:42:41,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:42:41,712 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1052 transitions. [2018-10-04 12:42:41,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:41,712 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:41,712 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:41,713 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:41,713 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:41,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1320238459, now seen corresponding path program 1 times [2018-10-04 12:42:41,713 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:41,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:41,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:41,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:41,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:41,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:41,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:41,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:41,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:42:41,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:42:41,795 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:41,795 INFO L87 Difference]: Start difference. First operand 430 states and 1052 transitions. Second operand 9 states. [2018-10-04 12:42:44,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:44,573 INFO L93 Difference]: Finished difference Result 1065 states and 2466 transitions. [2018-10-04 12:42:44,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 12:42:44,574 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 12:42:44,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:44,580 INFO L225 Difference]: With dead ends: 1065 [2018-10-04 12:42:44,580 INFO L226 Difference]: Without dead ends: 1057 [2018-10-04 12:42:44,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.3s impTime 18 [2018-10-04 12:42:44,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2018-10-04 12:42:44,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 471. [2018-10-04 12:42:44,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-10-04 12:42:44,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1168 transitions. [2018-10-04 12:42:44,791 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1168 transitions. Word has length 12 [2018-10-04 12:42:44,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:44,792 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 1168 transitions. [2018-10-04 12:42:44,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:42:44,792 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1168 transitions. [2018-10-04 12:42:44,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:44,793 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:44,793 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:44,793 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:44,793 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:44,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1320340604, now seen corresponding path program 1 times [2018-10-04 12:42:44,794 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:44,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:44,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:44,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:44,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:44,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:44,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:44,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:44,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:42:44,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:42:44,899 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:44,900 INFO L87 Difference]: Start difference. First operand 471 states and 1168 transitions. Second operand 9 states. [2018-10-04 12:42:48,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:48,075 INFO L93 Difference]: Finished difference Result 1227 states and 2851 transitions. [2018-10-04 12:42:48,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 12:42:48,076 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 12:42:48,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:48,081 INFO L225 Difference]: With dead ends: 1227 [2018-10-04 12:42:48,081 INFO L226 Difference]: Without dead ends: 1219 [2018-10-04 12:42:48,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 18 [2018-10-04 12:42:48,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-10-04 12:42:48,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 438. [2018-10-04 12:42:48,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-10-04 12:42:48,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1072 transitions. [2018-10-04 12:42:48,298 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1072 transitions. Word has length 12 [2018-10-04 12:42:48,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:48,298 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 1072 transitions. [2018-10-04 12:42:48,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:42:48,298 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1072 transitions. [2018-10-04 12:42:48,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:48,299 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:48,299 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:48,299 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:48,299 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:48,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-10-04 12:42:48,299 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:48,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:48,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:48,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:48,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:48,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-10-04 12:42:48,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:48,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:48,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:42:48,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:42:48,393 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:48,393 INFO L87 Difference]: Start difference. First operand 438 states and 1072 transitions. Second operand 9 states. [2018-10-04 12:42:51,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:51,186 INFO L93 Difference]: Finished difference Result 1076 states and 2511 transitions. [2018-10-04 12:42:51,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 12:42:51,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 12:42:51,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:51,191 INFO L225 Difference]: With dead ends: 1076 [2018-10-04 12:42:51,191 INFO L226 Difference]: Without dead ends: 1068 [2018-10-04 12:42:51,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 18 [2018-10-04 12:42:51,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2018-10-04 12:42:51,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 445. [2018-10-04 12:42:51,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-10-04 12:42:51,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1088 transitions. [2018-10-04 12:42:51,416 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1088 transitions. Word has length 12 [2018-10-04 12:42:51,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:51,416 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 1088 transitions. [2018-10-04 12:42:51,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:42:51,416 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1088 transitions. [2018-10-04 12:42:51,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:51,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:51,417 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:51,417 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:51,417 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:51,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1838990990, now seen corresponding path program 1 times [2018-10-04 12:42:51,417 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:51,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:51,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:51,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:51,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:51,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:51,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:51,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:51,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:42:51,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:42:51,501 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:51,501 INFO L87 Difference]: Start difference. First operand 445 states and 1088 transitions. Second operand 9 states. [2018-10-04 12:42:54,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:54,066 INFO L93 Difference]: Finished difference Result 1111 states and 2606 transitions. [2018-10-04 12:42:54,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:42:54,067 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 12:42:54,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:54,071 INFO L225 Difference]: With dead ends: 1111 [2018-10-04 12:42:54,071 INFO L226 Difference]: Without dead ends: 1103 [2018-10-04 12:42:54,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 17 [2018-10-04 12:42:54,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2018-10-04 12:42:54,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 520. [2018-10-04 12:42:54,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-04 12:42:54,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1295 transitions. [2018-10-04 12:42:54,403 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1295 transitions. Word has length 12 [2018-10-04 12:42:54,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:54,403 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 1295 transitions. [2018-10-04 12:42:54,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:42:54,403 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1295 transitions. [2018-10-04 12:42:54,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:54,404 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:54,404 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:54,404 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:54,405 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:54,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1838888845, now seen corresponding path program 1 times [2018-10-04 12:42:54,405 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:54,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:54,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:54,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:54,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:54,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:54,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:54,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:54,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:42:54,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:42:54,507 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:54,507 INFO L87 Difference]: Start difference. First operand 520 states and 1295 transitions. Second operand 9 states. [2018-10-04 12:42:58,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:58,124 INFO L93 Difference]: Finished difference Result 1304 states and 3059 transitions. [2018-10-04 12:42:58,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 12:42:58,126 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 12:42:58,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:58,132 INFO L225 Difference]: With dead ends: 1304 [2018-10-04 12:42:58,132 INFO L226 Difference]: Without dead ends: 1296 [2018-10-04 12:42:58,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 17 [2018-10-04 12:42:58,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-10-04 12:42:58,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 487. [2018-10-04 12:42:58,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-10-04 12:42:58,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1199 transitions. [2018-10-04 12:42:58,457 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1199 transitions. Word has length 12 [2018-10-04 12:42:58,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:58,457 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 1199 transitions. [2018-10-04 12:42:58,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:42:58,457 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1199 transitions. [2018-10-04 12:42:58,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:58,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:58,458 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:58,459 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:58,459 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:58,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1731038698, now seen corresponding path program 1 times [2018-10-04 12:42:58,459 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:58,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:58,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:58,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:58,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:58,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:58,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:58,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:58,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:42:58,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:42:58,562 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:58,563 INFO L87 Difference]: Start difference. First operand 487 states and 1199 transitions. Second operand 9 states. [2018-10-04 12:43:02,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:02,535 INFO L93 Difference]: Finished difference Result 1370 states and 3217 transitions. [2018-10-04 12:43:02,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:43:02,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 12:43:02,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:02,544 INFO L225 Difference]: With dead ends: 1370 [2018-10-04 12:43:02,545 INFO L226 Difference]: Without dead ends: 1362 [2018-10-04 12:43:02,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 18 [2018-10-04 12:43:02,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2018-10-04 12:43:02,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 479. [2018-10-04 12:43:02,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-10-04 12:43:02,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1179 transitions. [2018-10-04 12:43:02,893 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1179 transitions. Word has length 12 [2018-10-04 12:43:02,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:02,893 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 1179 transitions. [2018-10-04 12:43:02,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:43:02,893 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1179 transitions. [2018-10-04 12:43:02,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:43:02,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:02,895 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:02,895 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:02,895 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:02,895 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-10-04 12:43:02,896 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:02,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:02,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:02,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:02,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:02,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:43:02,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:43:02,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:43:02,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:43:02,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:43:02,985 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:02,985 INFO L87 Difference]: Start difference. First operand 479 states and 1179 transitions. Second operand 9 states. [2018-10-04 12:43:05,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:05,924 INFO L93 Difference]: Finished difference Result 1298 states and 3068 transitions. [2018-10-04 12:43:05,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:43:05,924 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-04 12:43:05,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:05,929 INFO L225 Difference]: With dead ends: 1298 [2018-10-04 12:43:05,929 INFO L226 Difference]: Without dead ends: 1290 [2018-10-04 12:43:05,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 17 [2018-10-04 12:43:05,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-10-04 12:43:06,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 602. [2018-10-04 12:43:06,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-10-04 12:43:06,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-10-04 12:43:06,354 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-10-04 12:43:06,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:06,354 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-10-04 12:43:06,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:43:06,354 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-10-04 12:43:06,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:43:06,355 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:06,355 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:06,356 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:06,356 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:06,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1080362888, now seen corresponding path program 1 times [2018-10-04 12:43:06,356 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:06,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:06,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:06,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:06,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:06,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:43:06,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:43:06,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:43:06,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:43:06,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:43:06,412 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:06,412 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-10-04 12:43:07,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:07,283 INFO L93 Difference]: Finished difference Result 1242 states and 3091 transitions. [2018-10-04 12:43:07,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:43:07,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-04 12:43:07,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:07,286 INFO L225 Difference]: With dead ends: 1242 [2018-10-04 12:43:07,286 INFO L226 Difference]: Without dead ends: 673 [2018-10-04 12:43:07,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 5 [2018-10-04 12:43:07,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-10-04 12:43:07,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 612. [2018-10-04 12:43:07,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-10-04 12:43:07,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1463 transitions. [2018-10-04 12:43:07,824 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1463 transitions. Word has length 13 [2018-10-04 12:43:07,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:07,824 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 1463 transitions. [2018-10-04 12:43:07,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:43:07,824 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1463 transitions. [2018-10-04 12:43:07,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:43:07,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:07,825 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:07,825 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:07,826 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:07,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1652407871, now seen corresponding path program 1 times [2018-10-04 12:43:07,826 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:07,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:07,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:07,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:07,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:07,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:43:07,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:43:07,922 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:43:07,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:07,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:43:08,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:43:08,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:43:08,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-10-04 12:43:08,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:43:08,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:43:08,752 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:08,752 INFO L87 Difference]: Start difference. First operand 612 states and 1463 transitions. Second operand 16 states. [2018-10-04 12:43:12,642 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:43:13,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:13,315 INFO L93 Difference]: Finished difference Result 854 states and 1987 transitions. [2018-10-04 12:43:13,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:43:13,315 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-10-04 12:43:13,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:13,318 INFO L225 Difference]: With dead ends: 854 [2018-10-04 12:43:13,318 INFO L226 Difference]: Without dead ends: 849 [2018-10-04 12:43:13,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.5s impTime 6 [2018-10-04 12:43:13,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-10-04 12:43:14,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 690. [2018-10-04 12:43:14,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-10-04 12:43:14,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1639 transitions. [2018-10-04 12:43:14,343 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1639 transitions. Word has length 13 [2018-10-04 12:43:14,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:14,343 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1639 transitions. [2018-10-04 12:43:14,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:43:14,343 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1639 transitions. [2018-10-04 12:43:14,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:43:14,344 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:14,344 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:14,345 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:14,345 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:14,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1456173380, now seen corresponding path program 1 times [2018-10-04 12:43:14,345 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:14,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:14,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:14,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:14,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:14,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:43:14,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:43:14,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:43:14,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:43:14,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:43:14,448 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:14,448 INFO L87 Difference]: Start difference. First operand 690 states and 1639 transitions. Second operand 5 states. [2018-10-04 12:43:15,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:15,402 INFO L93 Difference]: Finished difference Result 1308 states and 3113 transitions. [2018-10-04 12:43:15,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:43:15,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-04 12:43:15,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:15,405 INFO L225 Difference]: With dead ends: 1308 [2018-10-04 12:43:15,406 INFO L226 Difference]: Without dead ends: 709 [2018-10-04 12:43:15,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 12:43:15,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-10-04 12:43:16,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 690. [2018-10-04 12:43:16,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-10-04 12:43:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-10-04 12:43:16,122 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-10-04 12:43:16,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:16,122 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-10-04 12:43:16,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:43:16,122 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-10-04 12:43:16,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:43:16,123 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:16,123 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:16,124 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:16,124 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:16,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1952744875, now seen corresponding path program 1 times [2018-10-04 12:43:16,124 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:16,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:16,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:16,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:16,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:16,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:43:16,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:43:16,257 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:43:16,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:16,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:43:16,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:43:16,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:43:16,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-04 12:43:16,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:43:16,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:43:16,449 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:16,449 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 17 states. [2018-10-04 12:43:17,047 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 8 [2018-10-04 12:43:18,435 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 24 new depth: 7 [2018-10-04 12:43:21,142 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 10 [2018-10-04 12:43:23,874 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 27 new depth: 10 [2018-10-04 12:43:27,114 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 27 new depth: 11 [2018-10-04 12:43:31,465 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 31 new depth: 10 [2018-10-04 12:43:33,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:33,706 INFO L93 Difference]: Finished difference Result 2011 states and 4412 transitions. [2018-10-04 12:43:33,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-10-04 12:43:33,706 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-04 12:43:33,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:33,709 INFO L225 Difference]: With dead ends: 2011 [2018-10-04 12:43:33,710 INFO L226 Difference]: Without dead ends: 2003 [2018-10-04 12:43:33,710 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s Time 4.4s impTime 23 [2018-10-04 12:43:33,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2018-10-04 12:43:34,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1151. [2018-10-04 12:43:34,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2018-10-04 12:43:34,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 2622 transitions. [2018-10-04 12:43:34,838 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 2622 transitions. Word has length 16 [2018-10-04 12:43:34,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:34,838 INFO L480 AbstractCegarLoop]: Abstraction has 1151 states and 2622 transitions. [2018-10-04 12:43:34,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:43:34,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 2622 transitions. [2018-10-04 12:43:34,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:43:34,839 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:34,839 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:34,840 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:34,840 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:34,840 INFO L82 PathProgramCache]: Analyzing trace with hash -51223093, now seen corresponding path program 1 times [2018-10-04 12:43:34,840 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:34,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:34,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:34,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:34,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:34,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:43:34,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:43:34,946 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:43:34,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:34,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:43:35,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:43:35,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:43:35,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-04 12:43:35,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:43:35,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:43:35,139 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:35,139 INFO L87 Difference]: Start difference. First operand 1151 states and 2622 transitions. Second operand 17 states. [2018-10-04 12:43:35,421 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 7 [2018-10-04 12:43:39,650 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 23 new depth: 8 [2018-10-04 12:43:44,532 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 26 new depth: 8 [2018-10-04 12:43:48,070 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 9 [2018-10-04 12:43:49,957 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 26 new depth: 9 [2018-10-04 12:43:50,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:43:50,184 INFO L93 Difference]: Finished difference Result 2797 states and 6168 transitions. [2018-10-04 12:43:50,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-04 12:43:50,184 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-04 12:43:50,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:43:50,190 INFO L225 Difference]: With dead ends: 2797 [2018-10-04 12:43:50,191 INFO L226 Difference]: Without dead ends: 2789 [2018-10-04 12:43:50,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s Time 3.1s impTime 10 [2018-10-04 12:43:50,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2789 states. [2018-10-04 12:43:51,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2789 to 1186. [2018-10-04 12:43:51,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2018-10-04 12:43:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 2705 transitions. [2018-10-04 12:43:51,516 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 2705 transitions. Word has length 16 [2018-10-04 12:43:51,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:43:51,516 INFO L480 AbstractCegarLoop]: Abstraction has 1186 states and 2705 transitions. [2018-10-04 12:43:51,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:43:51,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 2705 transitions. [2018-10-04 12:43:51,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:43:51,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:43:51,518 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:43:51,519 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:43:51,519 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:43:51,519 INFO L82 PathProgramCache]: Analyzing trace with hash -666637335, now seen corresponding path program 1 times [2018-10-04 12:43:51,519 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:43:51,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:43:51,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:51,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:51,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:43:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:51,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:43:51,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:43:51,762 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:43:51,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:43:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:43:51,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:43:52,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:43:52,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:43:52,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-04 12:43:52,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:43:52,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:43:52,027 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:43:52,027 INFO L87 Difference]: Start difference. First operand 1186 states and 2705 transitions. Second operand 17 states. [2018-10-04 12:43:52,286 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 7 [2018-10-04 12:43:54,960 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 23 new depth: 7 [2018-10-04 12:43:58,742 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 8 [2018-10-04 12:44:01,628 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 9 [2018-10-04 12:44:02,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:44:02,878 INFO L93 Difference]: Finished difference Result 2492 states and 5544 transitions. [2018-10-04 12:44:02,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-10-04 12:44:02,878 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-04 12:44:02,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:44:02,886 INFO L225 Difference]: With dead ends: 2492 [2018-10-04 12:44:02,887 INFO L226 Difference]: Without dead ends: 2484 [2018-10-04 12:44:02,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time 1.9s impTime 23 [2018-10-04 12:44:02,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2018-10-04 12:44:04,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 1219. [2018-10-04 12:44:04,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1219 states. [2018-10-04 12:44:04,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 2792 transitions. [2018-10-04 12:44:04,408 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 2792 transitions. Word has length 16 [2018-10-04 12:44:04,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:44:04,408 INFO L480 AbstractCegarLoop]: Abstraction has 1219 states and 2792 transitions. [2018-10-04 12:44:04,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:44:04,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 2792 transitions. [2018-10-04 12:44:04,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:44:04,409 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:44:04,409 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:44:04,409 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:44:04,409 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:44:04,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1212722005, now seen corresponding path program 1 times [2018-10-04 12:44:04,410 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:44:04,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:44:04,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:04,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:04,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:04,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:44:04,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:44:04,524 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:44:04,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:04,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:44:04,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:44:04,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:44:04,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2018-10-04 12:44:04,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:44:04,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:44:04,723 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:44:04,723 INFO L87 Difference]: Start difference. First operand 1219 states and 2792 transitions. Second operand 17 states. [2018-10-04 12:44:04,991 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 8 [2018-10-04 12:44:08,448 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 24 new depth: 7 [2018-10-04 12:44:10,655 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 8 [2018-10-04 12:44:13,357 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 26 new depth: 8 [2018-10-04 12:44:16,311 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 9 [2018-10-04 12:44:18,669 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 26 new depth: 9 [2018-10-04 12:44:21,962 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 29 new depth: 9 [2018-10-04 12:44:23,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:44:23,900 INFO L93 Difference]: Finished difference Result 3178 states and 7226 transitions. [2018-10-04 12:44:23,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-10-04 12:44:23,907 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-04 12:44:23,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:44:23,915 INFO L225 Difference]: With dead ends: 3178 [2018-10-04 12:44:23,915 INFO L226 Difference]: Without dead ends: 3170 [2018-10-04 12:44:23,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s Time 4.5s impTime 18 [2018-10-04 12:44:23,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2018-10-04 12:44:25,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 1242. [2018-10-04 12:44:25,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1242 states. [2018-10-04 12:44:25,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 2857 transitions. [2018-10-04 12:44:25,348 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 2857 transitions. Word has length 16 [2018-10-04 12:44:25,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:44:25,348 INFO L480 AbstractCegarLoop]: Abstraction has 1242 states and 2857 transitions. [2018-10-04 12:44:25,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:44:25,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 2857 transitions. [2018-10-04 12:44:25,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:44:25,349 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:44:25,349 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:44:25,350 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:44:25,350 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:44:25,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1212619860, now seen corresponding path program 1 times [2018-10-04 12:44:25,350 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:44:25,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:44:25,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:25,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:25,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:25,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:44:25,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:44:25,440 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:44:25,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:25,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:25,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:44:25,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:44:25,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:44:25,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2018-10-04 12:44:25,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:44:25,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:44:25,656 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:44:25,657 INFO L87 Difference]: Start difference. First operand 1242 states and 2857 transitions. Second operand 17 states. [2018-10-04 12:44:25,903 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 7 [2018-10-04 12:44:29,633 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 23 new depth: 7 [2018-10-04 12:44:32,173 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 8 [2018-10-04 12:44:36,290 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 26 new depth: 9 [2018-10-04 12:44:39,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:44:39,742 INFO L93 Difference]: Finished difference Result 2638 states and 5927 transitions. [2018-10-04 12:44:39,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-10-04 12:44:39,743 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-04 12:44:39,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:44:39,751 INFO L225 Difference]: With dead ends: 2638 [2018-10-04 12:44:39,751 INFO L226 Difference]: Without dead ends: 2630 [2018-10-04 12:44:39,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s Time 2.3s impTime 22 [2018-10-04 12:44:39,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2018-10-04 12:44:41,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 1469. [2018-10-04 12:44:41,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2018-10-04 12:44:41,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 3433 transitions. [2018-10-04 12:44:41,605 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 3433 transitions. Word has length 16 [2018-10-04 12:44:41,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:44:41,606 INFO L480 AbstractCegarLoop]: Abstraction has 1469 states and 3433 transitions. [2018-10-04 12:44:41,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:44:41,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 3433 transitions. [2018-10-04 12:44:41,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:44:41,607 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:44:41,607 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:44:41,608 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:44:41,608 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:44:41,608 INFO L82 PathProgramCache]: Analyzing trace with hash 780585054, now seen corresponding path program 1 times [2018-10-04 12:44:41,608 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:44:41,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:44:41,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:41,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:41,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:41,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:44:41,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:44:41,683 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:44:41,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:41,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:44:41,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:44:41,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:44:41,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-04 12:44:41,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:44:41,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:44:41,877 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:44:41,877 INFO L87 Difference]: Start difference. First operand 1469 states and 3433 transitions. Second operand 17 states. [2018-10-04 12:44:42,171 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 7 [2018-10-04 12:44:46,925 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 23 new depth: 7 [2018-10-04 12:44:50,477 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 8 [2018-10-04 12:44:55,719 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 26 new depth: 8 [2018-10-04 12:44:56,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:44:56,922 INFO L93 Difference]: Finished difference Result 2855 states and 6512 transitions. [2018-10-04 12:44:56,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-04 12:44:56,923 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-04 12:44:56,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:44:56,926 INFO L225 Difference]: With dead ends: 2855 [2018-10-04 12:44:56,926 INFO L226 Difference]: Without dead ends: 2847 [2018-10-04 12:44:56,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time 1.6s impTime 13 [2018-10-04 12:44:56,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2847 states. [2018-10-04 12:44:58,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2847 to 1479. [2018-10-04 12:44:58,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1479 states. [2018-10-04 12:44:58,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 3457 transitions. [2018-10-04 12:44:58,564 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 3457 transitions. Word has length 16 [2018-10-04 12:44:58,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:44:58,564 INFO L480 AbstractCegarLoop]: Abstraction has 1479 states and 3457 transitions. [2018-10-04 12:44:58,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:44:58,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 3457 transitions. [2018-10-04 12:44:58,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:44:58,565 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:44:58,565 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:44:58,566 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:44:58,566 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:44:58,566 INFO L82 PathProgramCache]: Analyzing trace with hash 165170812, now seen corresponding path program 1 times [2018-10-04 12:44:58,566 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:44:58,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:44:58,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:58,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:58,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:44:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:58,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:44:58,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:44:58,708 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:44:58,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:44:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:44:58,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:44:58,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:44:58,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:44:58,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-04 12:44:58,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:44:58,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:44:58,928 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:44:58,928 INFO L87 Difference]: Start difference. First operand 1479 states and 3457 transitions. Second operand 17 states. [2018-10-04 12:44:59,184 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 8 [2018-10-04 12:45:02,059 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 24 new depth: 7 [2018-10-04 12:45:06,010 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 8 [2018-10-04 12:45:12,151 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 26 new depth: 9 [2018-10-04 12:45:14,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:45:14,152 INFO L93 Difference]: Finished difference Result 3363 states and 7697 transitions. [2018-10-04 12:45:14,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-04 12:45:14,152 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-04 12:45:14,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:45:14,156 INFO L225 Difference]: With dead ends: 3363 [2018-10-04 12:45:14,156 INFO L226 Difference]: Without dead ends: 3355 [2018-10-04 12:45:14,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s Time 2.0s impTime 23 [2018-10-04 12:45:14,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2018-10-04 12:45:15,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 1535. [2018-10-04 12:45:15,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535 states. [2018-10-04 12:45:15,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 3580 transitions. [2018-10-04 12:45:15,965 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 3580 transitions. Word has length 16 [2018-10-04 12:45:15,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:45:15,966 INFO L480 AbstractCegarLoop]: Abstraction has 1535 states and 3580 transitions. [2018-10-04 12:45:15,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:45:15,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 3580 transitions. [2018-10-04 12:45:15,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:45:15,967 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:45:15,967 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:45:15,967 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:45:15,967 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:45:15,968 INFO L82 PathProgramCache]: Analyzing trace with hash 723989304, now seen corresponding path program 1 times [2018-10-04 12:45:15,968 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:45:15,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:45:15,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:45:15,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:45:15,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:45:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:45:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:45:16,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:45:16,048 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:45:16,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:45:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:45:16,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:45:16,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:45:16,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:45:16,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2018-10-04 12:45:16,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 12:45:16,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 12:45:16,253 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:45:16,253 INFO L87 Difference]: Start difference. First operand 1535 states and 3580 transitions. Second operand 18 states. [2018-10-04 12:45:16,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:45:16,468 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Solver cannot find a model for the term (and (exists ((product__local__threadpooling_begin_1 Int)) (and (<= (+ product__local__threadpooling_begin_1 1) product__local__threadpooling_working_1) (<= (+ product__local__threadpooling_i_0 2) product__local__threadpooling_begin_1))) (not (<= (+ product__local__threadpooling_i_0 3) product__local__threadpooling_working_1))) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.PredicateTrie.getWitness(PredicateTrie.java:213) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:391) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:405) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:412) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:412) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.restructurePredicateTrie(BPredicateUnifier.java:371) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicateInternal(BPredicateUnifier.java:249) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicate(BPredicateUnifier.java:218) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicate(BPredicateUnifier.java:301) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicateForConjunction(BPredicateUnifier.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-04 12:45:16,474 INFO L168 Benchmark]: Toolchain (without parser) took 196886.01 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 162.0 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -65.3 MB). Peak memory consumption was 96.8 MB. Max. memory is 7.1 GB. [2018-10-04 12:45:16,476 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:45:16,476 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.69 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:45:16,477 INFO L168 Benchmark]: Boogie Preprocessor took 36.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:45:16,477 INFO L168 Benchmark]: RCFGBuilder took 907.80 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 12:45:16,478 INFO L168 Benchmark]: TraceAbstraction took 195888.04 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 162.0 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -97.0 MB). Peak memory consumption was 65.0 MB. Max. memory is 7.1 GB. [2018-10-04 12:45:16,483 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.69 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 907.80 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 195888.04 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 162.0 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -97.0 MB). Peak memory consumption was 65.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Solver cannot find a model for the term (and (exists ((product__local__threadpooling_begin_1 Int)) (and (<= (+ product__local__threadpooling_begin_1 1) product__local__threadpooling_working_1) (<= (+ product__local__threadpooling_i_0 2) product__local__threadpooling_begin_1))) (not (<= (+ product__local__threadpooling_i_0 3) product__local__threadpooling_working_1))) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Solver cannot find a model for the term (and (exists ((product__local__threadpooling_begin_1 Int)) (and (<= (+ product__local__threadpooling_begin_1 1) product__local__threadpooling_working_1) (<= (+ product__local__threadpooling_i_0 2) product__local__threadpooling_begin_1))) (not (<= (+ product__local__threadpooling_i_0 3) product__local__threadpooling_working_1))): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.PredicateTrie.getWitness(PredicateTrie.java:213) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-45-16-495.csv Received shutdown request...