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-c372c2b [2018-10-02 12:03:22,449 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 12:03:22,452 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 12:03:22,464 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 12:03:22,464 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 12:03:22,465 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 12:03:22,466 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 12:03:22,468 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 12:03:22,470 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 12:03:22,471 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 12:03:22,472 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 12:03:22,472 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 12:03:22,473 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 12:03:22,474 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 12:03:22,476 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 12:03:22,476 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 12:03:22,477 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 12:03:22,479 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 12:03:22,481 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 12:03:22,483 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 12:03:22,484 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 12:03:22,486 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 12:03:22,488 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 12:03:22,489 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 12:03:22,489 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 12:03:22,490 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 12:03:22,491 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 12:03:22,492 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 12:03:22,493 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 12:03:22,494 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 12:03:22,494 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 12:03:22,495 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 12:03:22,495 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 12:03:22,495 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 12:03:22,499 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 12:03:22,500 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 12:03:22,501 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-02 12:03:22,530 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 12:03:22,531 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 12:03:22,532 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 12:03:22,533 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 12:03:22,533 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 12:03:22,533 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 12:03:22,534 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 12:03:22,534 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 12:03:22,534 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 12:03:22,535 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 12:03:22,535 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 12:03:22,536 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 12:03:22,536 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 12:03:22,536 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 12:03:22,536 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 12:03:22,537 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 12:03:22,537 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 12:03:22,537 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 12:03:22,537 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 12:03:22,537 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 12:03:22,538 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 12:03:22,538 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 12:03:22,538 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 12:03:22,538 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 12:03:22,539 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 12:03:22,540 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 12:03:22,540 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 12:03:22,540 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 12:03:22,540 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 12:03:22,540 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 12:03:22,541 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-02 12:03:22,592 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 12:03:22,605 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 12:03:22,608 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 12:03:22,610 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 12:03:22,611 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 12:03:22,612 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-02 12:03:22,612 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl' [2018-10-02 12:03:22,687 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 12:03:22,691 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 12:03:22,691 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 12:03:22,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 12:03:22,692 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 12:03:22,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:22" (1/1) ... [2018-10-02 12:03:22,732 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:22" (1/1) ... [2018-10-02 12:03:22,737 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-02 12:03:22,737 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-02 12:03:22,737 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-02 12:03:22,740 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 12:03:22,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 12:03:22,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 12:03:22,741 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 12:03:22,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:22" (1/1) ... [2018-10-02 12:03:22,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:22" (1/1) ... [2018-10-02 12:03:22,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:22" (1/1) ... [2018-10-02 12:03:22,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:22" (1/1) ... [2018-10-02 12:03:22,783 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:22" (1/1) ... [2018-10-02 12:03:22,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:22" (1/1) ... [2018-10-02 12:03:22,795 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:22" (1/1) ... [2018-10-02 12:03:22,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 12:03:22,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 12:03:22,807 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 12:03:22,807 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 12:03:22,808 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:22" (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-02 12:03:22,887 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-02 12:03:22,887 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-02 12:03:22,887 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-02 12:03:23,800 INFO L337 CfgBuilder]: Using library mode [2018-10-02 12:03:23,801 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:03:23 BoogieIcfgContainer [2018-10-02 12:03:23,801 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 12:03:23,802 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 12:03:23,802 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 12:03:23,806 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 12:03:23,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 12:03:22" (1/2) ... [2018-10-02 12:03:23,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f082505 and model type threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:03:23, skipping insertion in model container [2018-10-02 12:03:23,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:03:23" (2/2) ... [2018-10-02 12:03:23,810 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out.bpl [2018-10-02 12:03:23,821 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 12:03:23,829 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-10-02 12:03:23,884 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 12:03:23,885 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 12:03:23,885 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 12:03:23,885 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 12:03:23,886 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 12:03:23,886 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 12:03:23,886 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 12:03:23,886 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 12:03:23,886 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 12:03:23,906 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-10-02 12:03:23,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-02 12:03:23,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:23,915 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:23,916 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:23,923 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:23,924 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-10-02 12:03:23,926 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:23,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:23,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:23,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:23,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:24,233 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-02 12:03:24,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:24,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 12:03:24,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-02 12:03:24,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-02 12:03:24,258 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:24,261 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-10-02 12:03:28,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:28,024 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-10-02 12:03:28,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-02 12:03:28,027 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-02 12:03:28,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:28,052 INFO L225 Difference]: With dead ends: 163 [2018-10-02 12:03:28,053 INFO L226 Difference]: Without dead ends: 158 [2018-10-02 12:03:28,056 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 [2018-10-02 12:03:28,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-02 12:03:28,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-10-02 12:03:28,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-02 12:03:28,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-10-02 12:03:28,115 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-10-02 12:03:28,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:28,116 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-10-02 12:03:28,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-02 12:03:28,116 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-10-02 12:03:28,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-02 12:03:28,117 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:28,118 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:28,120 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:28,120 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:28,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-10-02 12:03:28,120 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:28,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:28,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:28,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:28,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:03:28,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:28,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 12:03:28,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-02 12:03:28,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-02 12:03:28,204 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:28,204 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-10-02 12:03:30,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:30,364 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-10-02 12:03:30,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-02 12:03:30,365 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-02 12:03:30,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:30,369 INFO L225 Difference]: With dead ends: 188 [2018-10-02 12:03:30,369 INFO L226 Difference]: Without dead ends: 183 [2018-10-02 12:03:30,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime [2018-10-02 12:03:30,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-02 12:03:30,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-10-02 12:03:30,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-02 12:03:30,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-10-02 12:03:30,401 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-10-02 12:03:30,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:30,407 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-10-02 12:03:30,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-02 12:03:30,407 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-10-02 12:03:30,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 12:03:30,408 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:30,408 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:30,409 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:30,409 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:30,410 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-10-02 12:03:30,410 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:30,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:30,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:30,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:30,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:30,496 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-02 12:03:30,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:30,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 12:03:30,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:03:30,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:03:30,499 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:30,499 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-10-02 12:03:34,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:34,958 INFO L93 Difference]: Finished difference Result 361 states and 808 transitions. [2018-10-02 12:03:34,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-02 12:03:34,965 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-10-02 12:03:34,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:34,969 INFO L225 Difference]: With dead ends: 361 [2018-10-02 12:03:34,969 INFO L226 Difference]: Without dead ends: 349 [2018-10-02 12:03:34,970 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 [2018-10-02 12:03:34,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-10-02 12:03:35,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 174. [2018-10-02 12:03:35,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-10-02 12:03:35,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 387 transitions. [2018-10-02 12:03:35,027 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 387 transitions. Word has length 9 [2018-10-02 12:03:35,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:35,027 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 387 transitions. [2018-10-02 12:03:35,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:03:35,028 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 387 transitions. [2018-10-02 12:03:35,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 12:03:35,029 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:35,029 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:35,030 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:35,030 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:35,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-10-02 12:03:35,030 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:35,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:35,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:35,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:35,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:35,112 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-02 12:03:35,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:35,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 12:03:35,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 12:03:35,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 12:03:35,113 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:35,114 INFO L87 Difference]: Start difference. First operand 174 states and 387 transitions. Second operand 7 states. [2018-10-02 12:03:38,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:38,430 INFO L93 Difference]: Finished difference Result 307 states and 694 transitions. [2018-10-02 12:03:38,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-02 12:03:38,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-10-02 12:03:38,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:38,435 INFO L225 Difference]: With dead ends: 307 [2018-10-02 12:03:38,435 INFO L226 Difference]: Without dead ends: 302 [2018-10-02 12:03:38,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:03:38,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-02 12:03:38,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 203. [2018-10-02 12:03:38,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-02 12:03:38,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-10-02 12:03:38,469 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-10-02 12:03:38,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:38,470 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-10-02 12:03:38,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 12:03:38,470 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-10-02 12:03:38,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 12:03:38,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:38,472 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:38,473 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:38,473 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:38,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-10-02 12:03:38,473 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:38,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:38,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:38,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:38,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:38,783 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-02 12:03:38,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:38,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 12:03:38,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:03:38,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:03:38,785 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:38,785 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 8 states. [2018-10-02 12:03:46,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:03:46,394 INFO L93 Difference]: Finished difference Result 741 states and 1656 transitions. [2018-10-02 12:03:46,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-02 12:03:46,396 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-02 12:03:46,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:03:46,401 INFO L225 Difference]: With dead ends: 741 [2018-10-02 12:03:46,401 INFO L226 Difference]: Without dead ends: 733 [2018-10-02 12:03:46,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime [2018-10-02 12:03:46,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-10-02 12:03:46,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 315. [2018-10-02 12:03:46,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-02 12:03:46,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 743 transitions. [2018-10-02 12:03:46,457 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 743 transitions. Word has length 12 [2018-10-02 12:03:46,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:03:46,458 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 743 transitions. [2018-10-02 12:03:46,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:03:46,458 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 743 transitions. [2018-10-02 12:03:46,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 12:03:46,460 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:03:46,460 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:03:46,461 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:03:46,461 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:03:46,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-10-02 12:03:46,461 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:03:46,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:03:46,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:46,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:03:46,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:03:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:03:46,547 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-02 12:03:46,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:03:46,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 12:03:46,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:03:46,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:03:46,549 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:03:46,549 INFO L87 Difference]: Start difference. First operand 315 states and 743 transitions. Second operand 8 states. [2018-10-02 12:04:00,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:00,048 INFO L93 Difference]: Finished difference Result 797 states and 1784 transitions. [2018-10-02 12:04:00,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 12:04:00,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-02 12:04:00,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:00,056 INFO L225 Difference]: With dead ends: 797 [2018-10-02 12:04:00,056 INFO L226 Difference]: Without dead ends: 789 [2018-10-02 12:04:00,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.3s impTime [2018-10-02 12:04:00,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-10-02 12:04:00,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 319. [2018-10-02 12:04:00,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-10-02 12:04:00,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 751 transitions. [2018-10-02 12:04:00,128 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 751 transitions. Word has length 12 [2018-10-02 12:04:00,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:00,128 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 751 transitions. [2018-10-02 12:04:00,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:04:00,129 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 751 transitions. [2018-10-02 12:04:00,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 12:04:00,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:00,130 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:00,131 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:00,131 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:00,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-10-02 12:04:00,131 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:00,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:00,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:00,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:00,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:00,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:00,345 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-02 12:04:00,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:04:00,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 12:04:00,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:04:00,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:04:00,347 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:00,347 INFO L87 Difference]: Start difference. First operand 319 states and 751 transitions. Second operand 8 states. [2018-10-02 12:04:06,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:06,947 INFO L93 Difference]: Finished difference Result 684 states and 1538 transitions. [2018-10-02 12:04:06,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-02 12:04:06,947 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-02 12:04:06,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:06,952 INFO L225 Difference]: With dead ends: 684 [2018-10-02 12:04:06,953 INFO L226 Difference]: Without dead ends: 676 [2018-10-02 12:04:06,953 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 [2018-10-02 12:04:06,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-10-02 12:04:07,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 330. [2018-10-02 12:04:07,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-10-02 12:04:07,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 778 transitions. [2018-10-02 12:04:07,020 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 778 transitions. Word has length 12 [2018-10-02 12:04:07,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:07,021 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 778 transitions. [2018-10-02 12:04:07,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:04:07,021 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 778 transitions. [2018-10-02 12:04:07,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 12:04:07,022 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:07,022 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:07,023 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:07,023 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:07,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-10-02 12:04:07,023 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:07,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:07,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:07,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:07,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:07,519 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-02 12:04:07,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:04:07,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 12:04:07,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:04:07,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:04:07,521 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:07,521 INFO L87 Difference]: Start difference. First operand 330 states and 778 transitions. Second operand 8 states. [2018-10-02 12:04:12,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:12,454 INFO L93 Difference]: Finished difference Result 605 states and 1360 transitions. [2018-10-02 12:04:12,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 12:04:12,455 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-02 12:04:12,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:12,460 INFO L225 Difference]: With dead ends: 605 [2018-10-02 12:04:12,460 INFO L226 Difference]: Without dead ends: 597 [2018-10-02 12:04:12,461 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime [2018-10-02 12:04:12,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-10-02 12:04:12,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 337. [2018-10-02 12:04:12,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-10-02 12:04:12,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 794 transitions. [2018-10-02 12:04:12,524 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 794 transitions. Word has length 12 [2018-10-02 12:04:12,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:12,525 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 794 transitions. [2018-10-02 12:04:12,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:04:12,525 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 794 transitions. [2018-10-02 12:04:12,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 12:04:12,526 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:12,526 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:12,527 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:12,527 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:12,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1088621469, now seen corresponding path program 1 times [2018-10-02 12:04:12,527 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:12,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:12,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:12,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:12,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:12,620 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-02 12:04:12,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:04:12,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 12:04:12,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:04:12,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:04:12,622 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:12,622 INFO L87 Difference]: Start difference. First operand 337 states and 794 transitions. Second operand 8 states. [2018-10-02 12:04:20,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:20,281 INFO L93 Difference]: Finished difference Result 935 states and 2104 transitions. [2018-10-02 12:04:20,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 12:04:20,282 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-02 12:04:20,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:20,289 INFO L225 Difference]: With dead ends: 935 [2018-10-02 12:04:20,289 INFO L226 Difference]: Without dead ends: 927 [2018-10-02 12:04:20,290 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 [2018-10-02 12:04:20,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-10-02 12:04:20,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 343. [2018-10-02 12:04:20,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-10-02 12:04:20,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 808 transitions. [2018-10-02 12:04:20,400 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 808 transitions. Word has length 12 [2018-10-02 12:04:20,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:20,401 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 808 transitions. [2018-10-02 12:04:20,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:04:20,401 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 808 transitions. [2018-10-02 12:04:20,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 12:04:20,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:20,402 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:20,403 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:20,403 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:20,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1085821115, now seen corresponding path program 1 times [2018-10-02 12:04:20,403 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:20,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:20,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:20,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:20,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:21,128 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-02 12:04:21,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:04:21,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 12:04:21,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:04:21,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:04:21,130 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:21,130 INFO L87 Difference]: Start difference. First operand 343 states and 808 transitions. Second operand 8 states. [2018-10-02 12:04:29,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:29,130 INFO L93 Difference]: Finished difference Result 923 states and 2061 transitions. [2018-10-02 12:04:29,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-02 12:04:29,131 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-02 12:04:29,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:29,137 INFO L225 Difference]: With dead ends: 923 [2018-10-02 12:04:29,137 INFO L226 Difference]: Without dead ends: 915 [2018-10-02 12:04:29,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime [2018-10-02 12:04:29,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-10-02 12:04:29,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 354. [2018-10-02 12:04:29,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-10-02 12:04:29,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 835 transitions. [2018-10-02 12:04:29,238 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 835 transitions. Word has length 12 [2018-10-02 12:04:29,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:29,238 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 835 transitions. [2018-10-02 12:04:29,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:04:29,239 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 835 transitions. [2018-10-02 12:04:29,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 12:04:29,239 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:29,240 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:29,240 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:29,240 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:29,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1085923260, now seen corresponding path program 1 times [2018-10-02 12:04:29,241 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:29,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:29,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:29,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:29,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:29,344 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-02 12:04:29,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:04:29,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 12:04:29,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:04:29,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:04:29,345 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:29,345 INFO L87 Difference]: Start difference. First operand 354 states and 835 transitions. Second operand 8 states. [2018-10-02 12:04:34,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:34,814 INFO L93 Difference]: Finished difference Result 837 states and 1868 transitions. [2018-10-02 12:04:34,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 12:04:34,814 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-02 12:04:34,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:34,820 INFO L225 Difference]: With dead ends: 837 [2018-10-02 12:04:34,820 INFO L226 Difference]: Without dead ends: 829 [2018-10-02 12:04:34,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime [2018-10-02 12:04:34,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-10-02 12:04:34,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 339. [2018-10-02 12:04:34,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-02 12:04:34,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 800 transitions. [2018-10-02 12:04:34,941 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 800 transitions. Word has length 12 [2018-10-02 12:04:34,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:34,941 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 800 transitions. [2018-10-02 12:04:34,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:04:34,943 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 800 transitions. [2018-10-02 12:04:34,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 12:04:34,944 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:34,944 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:34,944 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:34,945 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:34,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1383194877, now seen corresponding path program 1 times [2018-10-02 12:04:34,945 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:34,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:34,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:34,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:34,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:35,162 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-02 12:04:35,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:04:35,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 12:04:35,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:04:35,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:04:35,164 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:35,164 INFO L87 Difference]: Start difference. First operand 339 states and 800 transitions. Second operand 8 states. [2018-10-02 12:04:43,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:43,293 INFO L93 Difference]: Finished difference Result 996 states and 2227 transitions. [2018-10-02 12:04:43,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-02 12:04:43,294 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-02 12:04:43,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:43,300 INFO L225 Difference]: With dead ends: 996 [2018-10-02 12:04:43,300 INFO L226 Difference]: Without dead ends: 988 [2018-10-02 12:04:43,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime [2018-10-02 12:04:43,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-10-02 12:04:43,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 381. [2018-10-02 12:04:43,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-02 12:04:43,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-10-02 12:04:43,438 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-10-02 12:04:43,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:43,439 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-10-02 12:04:43,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:04:43,440 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-10-02 12:04:43,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 12:04:43,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:43,441 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:43,441 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:43,441 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:43,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1383297022, now seen corresponding path program 1 times [2018-10-02 12:04:43,443 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:43,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:43,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:43,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:43,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:43,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-02 12:04:43,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:04:43,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 12:04:43,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:04:43,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:04:43,559 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:43,559 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-10-02 12:04:50,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:50,526 INFO L93 Difference]: Finished difference Result 913 states and 2034 transitions. [2018-10-02 12:04:50,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-02 12:04:50,527 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-02 12:04:50,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:50,532 INFO L225 Difference]: With dead ends: 913 [2018-10-02 12:04:50,532 INFO L226 Difference]: Without dead ends: 905 [2018-10-02 12:04:50,533 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 [2018-10-02 12:04:50,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-10-02 12:04:50,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 371. [2018-10-02 12:04:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-10-02 12:04:50,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 890 transitions. [2018-10-02 12:04:50,664 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 890 transitions. Word has length 12 [2018-10-02 12:04:50,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:50,664 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 890 transitions. [2018-10-02 12:04:50,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:04:50,665 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 890 transitions. [2018-10-02 12:04:50,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 12:04:50,665 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:50,666 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:50,666 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:50,666 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:50,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1392211258, now seen corresponding path program 1 times [2018-10-02 12:04:50,666 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:50,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:50,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:50,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:50,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:50,755 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-02 12:04:50,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:04:50,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 12:04:50,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 12:04:50,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 12:04:50,756 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:50,756 INFO L87 Difference]: Start difference. First operand 371 states and 890 transitions. Second operand 8 states. [2018-10-02 12:04:56,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:04:56,568 INFO L93 Difference]: Finished difference Result 886 states and 2009 transitions. [2018-10-02 12:04:56,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-02 12:04:56,568 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-10-02 12:04:56,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:04:56,572 INFO L225 Difference]: With dead ends: 886 [2018-10-02 12:04:56,572 INFO L226 Difference]: Without dead ends: 878 [2018-10-02 12:04:56,573 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 [2018-10-02 12:04:56,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2018-10-02 12:04:56,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 372. [2018-10-02 12:04:56,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-10-02 12:04:56,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 891 transitions. [2018-10-02 12:04:56,690 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 891 transitions. Word has length 12 [2018-10-02 12:04:56,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:04:56,690 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 891 transitions. [2018-10-02 12:04:56,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 12:04:56,691 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 891 transitions. [2018-10-02 12:04:56,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 12:04:56,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:04:56,692 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:04:56,692 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:04:56,692 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:04:56,693 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-10-02 12:04:56,693 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:04:56,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:04:56,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:56,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:04:56,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:04:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:04:56,787 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-02 12:04:56,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:04:56,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 12:04:56,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 12:04:56,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 12:04:56,789 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:04:56,789 INFO L87 Difference]: Start difference. First operand 372 states and 891 transitions. Second operand 9 states. [2018-10-02 12:05:02,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:02,869 INFO L93 Difference]: Finished difference Result 801 states and 1838 transitions. [2018-10-02 12:05:02,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-02 12:05:02,870 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-02 12:05:02,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:02,874 INFO L225 Difference]: With dead ends: 801 [2018-10-02 12:05:02,874 INFO L226 Difference]: Without dead ends: 793 [2018-10-02 12:05:02,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime [2018-10-02 12:05:02,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-10-02 12:05:03,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 393. [2018-10-02 12:05:03,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-10-02 12:05:03,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 949 transitions. [2018-10-02 12:05:03,038 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 949 transitions. Word has length 12 [2018-10-02 12:05:03,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:03,039 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 949 transitions. [2018-10-02 12:05:03,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 12:05:03,039 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 949 transitions. [2018-10-02 12:05:03,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 12:05:03,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:03,040 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:03,040 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:03,040 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:03,041 INFO L82 PathProgramCache]: Analyzing trace with hash 192619318, now seen corresponding path program 1 times [2018-10-02 12:05:03,041 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:03,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:03,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:03,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:03,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:03,143 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-02 12:05:03,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:05:03,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 12:05:03,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 12:05:03,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 12:05:03,145 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:03,145 INFO L87 Difference]: Start difference. First operand 393 states and 949 transitions. Second operand 9 states. [2018-10-02 12:05:11,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:11,350 INFO L93 Difference]: Finished difference Result 962 states and 2211 transitions. [2018-10-02 12:05:11,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-02 12:05:11,350 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-02 12:05:11,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:11,356 INFO L225 Difference]: With dead ends: 962 [2018-10-02 12:05:11,356 INFO L226 Difference]: Without dead ends: 954 [2018-10-02 12:05:11,356 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 [2018-10-02 12:05:11,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-10-02 12:05:11,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 409. [2018-10-02 12:05:11,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-10-02 12:05:11,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 997 transitions. [2018-10-02 12:05:11,519 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 997 transitions. Word has length 12 [2018-10-02 12:05:11,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:11,520 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 997 transitions. [2018-10-02 12:05:11,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 12:05:11,520 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 997 transitions. [2018-10-02 12:05:11,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 12:05:11,521 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:11,521 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:11,521 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:11,521 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:11,521 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-10-02 12:05:11,521 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:11,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:11,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:11,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:11,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:11,609 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-02 12:05:11,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:05:11,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 12:05:11,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 12:05:11,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 12:05:11,610 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:11,611 INFO L87 Difference]: Start difference. First operand 409 states and 997 transitions. Second operand 9 states. [2018-10-02 12:05:19,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:19,621 INFO L93 Difference]: Finished difference Result 1000 states and 2329 transitions. [2018-10-02 12:05:19,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-02 12:05:19,621 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-02 12:05:19,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:19,626 INFO L225 Difference]: With dead ends: 1000 [2018-10-02 12:05:19,626 INFO L226 Difference]: Without dead ends: 992 [2018-10-02 12:05:19,627 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 [2018-10-02 12:05:19,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-10-02 12:05:19,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 430. [2018-10-02 12:05:19,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-10-02 12:05:19,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1052 transitions. [2018-10-02 12:05:19,803 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1052 transitions. Word has length 12 [2018-10-02 12:05:19,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:19,803 INFO L480 AbstractCegarLoop]: Abstraction has 430 states and 1052 transitions. [2018-10-02 12:05:19,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 12:05:19,803 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1052 transitions. [2018-10-02 12:05:19,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 12:05:19,804 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:19,804 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:19,805 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:19,805 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:19,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1320238459, now seen corresponding path program 1 times [2018-10-02 12:05:19,805 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:19,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:19,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:19,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:19,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:19,895 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-02 12:05:19,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:05:19,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 12:05:19,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 12:05:19,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 12:05:19,896 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:19,896 INFO L87 Difference]: Start difference. First operand 430 states and 1052 transitions. Second operand 9 states. [2018-10-02 12:05:28,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:28,748 INFO L93 Difference]: Finished difference Result 1065 states and 2466 transitions. [2018-10-02 12:05:28,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-02 12:05:28,748 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-02 12:05:28,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:28,754 INFO L225 Difference]: With dead ends: 1065 [2018-10-02 12:05:28,754 INFO L226 Difference]: Without dead ends: 1057 [2018-10-02 12:05:28,754 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 [2018-10-02 12:05:28,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2018-10-02 12:05:28,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 471. [2018-10-02 12:05:28,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-10-02 12:05:28,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1168 transitions. [2018-10-02 12:05:28,989 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1168 transitions. Word has length 12 [2018-10-02 12:05:28,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:28,989 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 1168 transitions. [2018-10-02 12:05:28,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 12:05:28,989 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1168 transitions. [2018-10-02 12:05:28,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 12:05:28,990 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:28,990 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:28,991 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:28,991 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:28,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1320340604, now seen corresponding path program 1 times [2018-10-02 12:05:28,991 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:28,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:28,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:28,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:28,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:29,092 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-02 12:05:29,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:05:29,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 12:05:29,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 12:05:29,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 12:05:29,094 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:29,094 INFO L87 Difference]: Start difference. First operand 471 states and 1168 transitions. Second operand 9 states. [2018-10-02 12:05:39,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:39,042 INFO L93 Difference]: Finished difference Result 1227 states and 2851 transitions. [2018-10-02 12:05:39,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-02 12:05:39,042 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-02 12:05:39,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:39,048 INFO L225 Difference]: With dead ends: 1227 [2018-10-02 12:05:39,048 INFO L226 Difference]: Without dead ends: 1219 [2018-10-02 12:05:39,049 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 [2018-10-02 12:05:39,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-10-02 12:05:39,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 438. [2018-10-02 12:05:39,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-10-02 12:05:39,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1072 transitions. [2018-10-02 12:05:39,265 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1072 transitions. Word has length 12 [2018-10-02 12:05:39,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:39,266 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 1072 transitions. [2018-10-02 12:05:39,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 12:05:39,266 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1072 transitions. [2018-10-02 12:05:39,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 12:05:39,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:39,266 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:39,267 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:39,267 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:39,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-10-02 12:05:39,267 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:39,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:39,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:39,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:39,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:39,359 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-02 12:05:39,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:05:39,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 12:05:39,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 12:05:39,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 12:05:39,360 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:39,361 INFO L87 Difference]: Start difference. First operand 438 states and 1072 transitions. Second operand 9 states. [2018-10-02 12:05:47,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:47,578 INFO L93 Difference]: Finished difference Result 1076 states and 2511 transitions. [2018-10-02 12:05:47,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-02 12:05:47,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-02 12:05:47,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:47,584 INFO L225 Difference]: With dead ends: 1076 [2018-10-02 12:05:47,584 INFO L226 Difference]: Without dead ends: 1068 [2018-10-02 12:05:47,584 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 [2018-10-02 12:05:47,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2018-10-02 12:05:47,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 445. [2018-10-02 12:05:47,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-10-02 12:05:47,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1088 transitions. [2018-10-02 12:05:47,832 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1088 transitions. Word has length 12 [2018-10-02 12:05:47,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:47,832 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 1088 transitions. [2018-10-02 12:05:47,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 12:05:47,832 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1088 transitions. [2018-10-02 12:05:47,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 12:05:47,833 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:47,833 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:47,834 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:47,834 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:47,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1838990990, now seen corresponding path program 1 times [2018-10-02 12:05:47,834 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:47,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:47,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:47,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:47,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:47,923 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-02 12:05:47,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:05:47,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 12:05:47,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 12:05:47,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 12:05:47,924 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:47,925 INFO L87 Difference]: Start difference. First operand 445 states and 1088 transitions. Second operand 9 states. [2018-10-02 12:05:55,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:05:55,515 INFO L93 Difference]: Finished difference Result 1111 states and 2606 transitions. [2018-10-02 12:05:55,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 12:05:55,515 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-02 12:05:55,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:05:55,521 INFO L225 Difference]: With dead ends: 1111 [2018-10-02 12:05:55,521 INFO L226 Difference]: Without dead ends: 1103 [2018-10-02 12:05:55,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime [2018-10-02 12:05:55,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2018-10-02 12:05:55,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 520. [2018-10-02 12:05:55,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-02 12:05:55,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1295 transitions. [2018-10-02 12:05:55,861 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1295 transitions. Word has length 12 [2018-10-02 12:05:55,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:05:55,861 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 1295 transitions. [2018-10-02 12:05:55,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 12:05:55,861 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1295 transitions. [2018-10-02 12:05:55,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 12:05:55,862 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:05:55,862 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:05:55,862 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:05:55,862 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:05:55,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1838888845, now seen corresponding path program 1 times [2018-10-02 12:05:55,863 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:05:55,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:05:55,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:55,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:05:55,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:05:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:05:55,964 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-02 12:05:55,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:05:55,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 12:05:55,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 12:05:55,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 12:05:55,965 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:05:55,966 INFO L87 Difference]: Start difference. First operand 520 states and 1295 transitions. Second operand 9 states. [2018-10-02 12:06:06,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:06:06,096 INFO L93 Difference]: Finished difference Result 1304 states and 3059 transitions. [2018-10-02 12:06:06,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-02 12:06:06,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-02 12:06:06,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:06:06,103 INFO L225 Difference]: With dead ends: 1304 [2018-10-02 12:06:06,103 INFO L226 Difference]: Without dead ends: 1296 [2018-10-02 12:06:06,104 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 [2018-10-02 12:06:06,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-10-02 12:06:06,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 487. [2018-10-02 12:06:06,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-10-02 12:06:06,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1199 transitions. [2018-10-02 12:06:06,426 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1199 transitions. Word has length 12 [2018-10-02 12:06:06,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:06:06,427 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 1199 transitions. [2018-10-02 12:06:06,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 12:06:06,427 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1199 transitions. [2018-10-02 12:06:06,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 12:06:06,427 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:06:06,428 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:06:06,428 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:06:06,428 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:06:06,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1731038698, now seen corresponding path program 1 times [2018-10-02 12:06:06,428 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:06:06,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:06:06,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:06,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:06,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:06,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 12:06:06,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:06:06,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 12:06:06,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 12:06:06,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 12:06:06,521 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:06:06,521 INFO L87 Difference]: Start difference. First operand 487 states and 1199 transitions. Second operand 9 states. [2018-10-02 12:06:17,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:06:17,583 INFO L93 Difference]: Finished difference Result 1370 states and 3217 transitions. [2018-10-02 12:06:17,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 12:06:17,583 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-02 12:06:17,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:06:17,591 INFO L225 Difference]: With dead ends: 1370 [2018-10-02 12:06:17,591 INFO L226 Difference]: Without dead ends: 1362 [2018-10-02 12:06:17,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime [2018-10-02 12:06:17,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2018-10-02 12:06:17,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 479. [2018-10-02 12:06:17,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-10-02 12:06:17,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1179 transitions. [2018-10-02 12:06:17,929 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1179 transitions. Word has length 12 [2018-10-02 12:06:17,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:06:17,929 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 1179 transitions. [2018-10-02 12:06:17,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 12:06:17,930 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1179 transitions. [2018-10-02 12:06:17,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 12:06:17,930 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:06:17,931 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:06:17,931 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:06:17,931 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:06:17,931 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-10-02 12:06:17,931 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:06:17,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:06:17,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:17,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:17,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:18,140 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-02 12:06:18,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:06:18,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 12:06:18,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 12:06:18,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 12:06:18,142 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:06:18,142 INFO L87 Difference]: Start difference. First operand 479 states and 1179 transitions. Second operand 9 states. [2018-10-02 12:06:24,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:06:24,983 INFO L93 Difference]: Finished difference Result 1298 states and 3068 transitions. [2018-10-02 12:06:24,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-02 12:06:24,984 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-10-02 12:06:24,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:06:24,990 INFO L225 Difference]: With dead ends: 1298 [2018-10-02 12:06:24,990 INFO L226 Difference]: Without dead ends: 1290 [2018-10-02 12:06:24,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime [2018-10-02 12:06:24,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-10-02 12:06:25,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 602. [2018-10-02 12:06:25,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-10-02 12:06:25,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-10-02 12:06:25,430 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-10-02 12:06:25,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:06:25,430 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-10-02 12:06:25,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 12:06:25,430 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-10-02 12:06:25,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 12:06:25,431 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:06:25,431 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:06:25,431 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:06:25,431 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:06:25,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1080362888, now seen corresponding path program 1 times [2018-10-02 12:06:25,432 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:06:25,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:06:25,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:25,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:25,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:25,488 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-02 12:06:25,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:06:25,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 12:06:25,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 12:06:25,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 12:06:25,489 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:06:25,489 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-10-02 12:06:26,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:06:26,635 INFO L93 Difference]: Finished difference Result 1242 states and 3091 transitions. [2018-10-02 12:06:26,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 12:06:26,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-02 12:06:26,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:06:26,638 INFO L225 Difference]: With dead ends: 1242 [2018-10-02 12:06:26,638 INFO L226 Difference]: Without dead ends: 673 [2018-10-02 12:06:26,640 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 [2018-10-02 12:06:26,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-10-02 12:06:27,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 612. [2018-10-02 12:06:27,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-10-02 12:06:27,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1463 transitions. [2018-10-02 12:06:27,117 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1463 transitions. Word has length 13 [2018-10-02 12:06:27,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:06:27,118 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 1463 transitions. [2018-10-02 12:06:27,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 12:06:27,118 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1463 transitions. [2018-10-02 12:06:27,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 12:06:27,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:06:27,119 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:06:27,119 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:06:27,119 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:06:27,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1652407871, now seen corresponding path program 1 times [2018-10-02 12:06:27,120 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:06:27,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:06:27,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:27,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:27,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:27,218 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-02 12:06:27,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:06:27,218 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-02 12:06:27,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:27,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:06:27,734 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-02 12:06:27,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:06:27,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-10-02 12:06:27,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 12:06:27,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 12:06:27,757 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:06:27,757 INFO L87 Difference]: Start difference. First operand 612 states and 1463 transitions. Second operand 16 states. [2018-10-02 12:06:34,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:06:34,732 INFO L93 Difference]: Finished difference Result 854 states and 1987 transitions. [2018-10-02 12:06:34,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-02 12:06:34,732 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-10-02 12:06:34,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:06:34,735 INFO L225 Difference]: With dead ends: 854 [2018-10-02 12:06:34,735 INFO L226 Difference]: Without dead ends: 849 [2018-10-02 12:06:34,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime [2018-10-02 12:06:34,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-10-02 12:06:35,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 690. [2018-10-02 12:06:35,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-10-02 12:06:35,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1639 transitions. [2018-10-02 12:06:35,448 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1639 transitions. Word has length 13 [2018-10-02 12:06:35,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:06:35,448 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1639 transitions. [2018-10-02 12:06:35,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 12:06:35,448 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1639 transitions. [2018-10-02 12:06:35,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 12:06:35,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:06:35,449 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:06:35,450 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:06:35,450 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:06:35,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1456173380, now seen corresponding path program 1 times [2018-10-02 12:06:35,450 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:06:35,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:06:35,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:35,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:35,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:35,597 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-02 12:06:35,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 12:06:35,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-02 12:06:35,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 12:06:35,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 12:06:35,598 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:06:35,599 INFO L87 Difference]: Start difference. First operand 690 states and 1639 transitions. Second operand 5 states. [2018-10-02 12:06:37,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:06:37,205 INFO L93 Difference]: Finished difference Result 1308 states and 3113 transitions. [2018-10-02 12:06:37,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-02 12:06:37,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-02 12:06:37,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:06:37,207 INFO L225 Difference]: With dead ends: 1308 [2018-10-02 12:06:37,208 INFO L226 Difference]: Without dead ends: 709 [2018-10-02 12:06:37,209 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 [2018-10-02 12:06:37,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-10-02 12:06:38,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 690. [2018-10-02 12:06:38,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-10-02 12:06:38,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-10-02 12:06:38,266 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-10-02 12:06:38,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:06:38,267 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-10-02 12:06:38,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 12:06:38,267 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-10-02 12:06:38,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 12:06:38,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:06:38,268 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:06:38,269 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:06:38,269 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:06:38,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1952744875, now seen corresponding path program 1 times [2018-10-02 12:06:38,269 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:06:38,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:06:38,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:38,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:38,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:06:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:38,448 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-02 12:06:38,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:06:38,448 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-02 12:06:38,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:06:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:06:38,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:06:38,620 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-02 12:06:38,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:06:38,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-02 12:06:38,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 12:06:38,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 12:06:38,643 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:06:38,643 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 17 states. [2018-10-02 12:07:26,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 12:07:26,261 INFO L93 Difference]: Finished difference Result 2011 states and 4412 transitions. [2018-10-02 12:07:26,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-10-02 12:07:26,262 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-02 12:07:26,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 12:07:26,265 INFO L225 Difference]: With dead ends: 2011 [2018-10-02 12:07:26,265 INFO L226 Difference]: Without dead ends: 2003 [2018-10-02 12:07:26,265 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s Time 3.8s impTime [2018-10-02 12:07:26,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2018-10-02 12:07:27,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1151. [2018-10-02 12:07:27,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2018-10-02 12:07:27,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 2622 transitions. [2018-10-02 12:07:27,446 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 2622 transitions. Word has length 16 [2018-10-02 12:07:27,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 12:07:27,446 INFO L480 AbstractCegarLoop]: Abstraction has 1151 states and 2622 transitions. [2018-10-02 12:07:27,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 12:07:27,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 2622 transitions. [2018-10-02 12:07:27,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 12:07:27,447 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 12:07:27,447 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 12:07:27,448 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT]=== [2018-10-02 12:07:27,448 INFO L103 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-02 12:07:27,448 INFO L82 PathProgramCache]: Analyzing trace with hash -51223093, now seen corresponding path program 1 times [2018-10-02 12:07:27,448 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 12:07:27,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 12:07:27,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:27,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:07:27,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 12:07:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:07:27,635 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-02 12:07:27,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 12:07:27,636 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-02 12:07:27,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 12:07:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 12:07:27,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 12:07:27,817 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-02 12:07:27,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 12:07:27,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-02 12:07:27,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 12:07:27,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 12:07:27,839 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-02 12:07:27,839 INFO L87 Difference]: Start difference. First operand 1151 states and 2622 transitions. Second operand 17 states. Received shutdown request... [2018-10-02 12:07:29,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-02 12:07:29,443 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-02 12:07:29,450 WARN L205 ceAbstractionStarter]: Timeout [2018-10-02 12:07:29,450 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:07:29 BoogieIcfgContainer [2018-10-02 12:07:29,451 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 12:07:29,451 INFO L168 Benchmark]: Toolchain (without parser) took 246764.14 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -88.6 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 273.5 MB). Peak memory consumption was 184.9 MB. Max. memory is 7.1 GB. [2018-10-02 12:07:29,454 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 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-02 12:07:29,454 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.78 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-02 12:07:29,455 INFO L168 Benchmark]: Boogie Preprocessor took 64.29 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-02 12:07:29,456 INFO L168 Benchmark]: RCFGBuilder took 994.65 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-02 12:07:29,457 INFO L168 Benchmark]: TraceAbstraction took 245648.59 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -88.6 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 241.7 MB). Peak memory consumption was 153.1 MB. Max. memory is 7.1 GB. [2018-10-02 12:07:29,462 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.25 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.78 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 64.29 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 994.65 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 245648.59 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -88.6 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 241.7 MB). Peak memory consumption was 153.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 277]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 277). Cancelled while BasicCegarLoop was constructing difference of abstraction (1151states) and FLOYD_HOARE automaton (currently 9 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (45 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 250]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 250). Cancelled while BasicCegarLoop was constructing difference of abstraction (1151states) and FLOYD_HOARE automaton (currently 9 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (45 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 364]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 364). Cancelled while BasicCegarLoop was constructing difference of abstraction (1151states) and FLOYD_HOARE automaton (currently 9 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (45 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 240]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 240). Cancelled while BasicCegarLoop was constructing difference of abstraction (1151states) and FLOYD_HOARE automaton (currently 9 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (45 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 247]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 247). Cancelled while BasicCegarLoop was constructing difference of abstraction (1151states) and FLOYD_HOARE automaton (currently 9 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (45 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 54). Cancelled while BasicCegarLoop was constructing difference of abstraction (1151states) and FLOYD_HOARE automaton (currently 9 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (45 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 264]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 264). Cancelled while BasicCegarLoop was constructing difference of abstraction (1151states) and FLOYD_HOARE automaton (currently 9 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (45 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 284]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 284). Cancelled while BasicCegarLoop was constructing difference of abstraction (1151states) and FLOYD_HOARE automaton (currently 9 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (45 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 154). Cancelled while BasicCegarLoop was constructing difference of abstraction (1151states) and FLOYD_HOARE automaton (currently 9 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (45 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 332]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 332). Cancelled while BasicCegarLoop was constructing difference of abstraction (1151states) and FLOYD_HOARE automaton (currently 9 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (45 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 222]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 222). Cancelled while BasicCegarLoop was constructing difference of abstraction (1151states) and FLOYD_HOARE automaton (currently 9 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (45 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 229]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 229). Cancelled while BasicCegarLoop was constructing difference of abstraction (1151states) and FLOYD_HOARE automaton (currently 9 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (45 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 205]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 205). Cancelled while BasicCegarLoop was constructing difference of abstraction (1151states) and FLOYD_HOARE automaton (currently 9 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (45 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 294]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 294). Cancelled while BasicCegarLoop was constructing difference of abstraction (1151states) and FLOYD_HOARE automaton (currently 9 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (45 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 245.5s OverallTime, 29 OverallIterations, 2 TraceHistogramMax, 232.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7940 SDtfs, 21704 SDslu, 23617 SDs, 0 SdLazy, 49850 SolverSat, 4929 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 59.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 776 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 736 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1151occurred in iteration=28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 7.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 12731 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 388 NumberOfCodeBlocks, 388 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 356 ConstructedInterpolants, 21 QuantifiedInterpolants, 19806 SizeOfPredicates, 19 NumberOfNonLiveVariables, 115 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 32 InterpolantComputations, 26 PerfectInterpolantSequences, 15/25 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_12-07-29-475.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_12-07-29-475.csv Completed graceful shutdown