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-d19836b [2018-09-26 21:40:19,772 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:40:19,774 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:40:19,787 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:40:19,787 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:40:19,788 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:40:19,789 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:40:19,791 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:40:19,794 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:40:19,795 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:40:19,796 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:40:19,796 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:40:19,797 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:40:19,798 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:40:19,799 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:40:19,800 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:40:19,801 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:40:19,803 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:40:19,805 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:40:19,806 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:40:19,807 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:40:19,809 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:40:19,811 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:40:19,811 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:40:19,812 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:40:19,813 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:40:19,814 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:40:19,815 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:40:19,815 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:40:19,817 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:40:19,817 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:40:19,818 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:40:19,818 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:40:19,818 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:40:19,819 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:40:19,820 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:40:19,820 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-09-26 21:40:19,843 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:40:19,843 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:40:19,845 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:40:19,845 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:40:19,846 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:40:19,846 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:40:19,846 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:40:19,847 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:40:19,847 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:40:19,847 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:40:19,847 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:40:19,848 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:40:19,848 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:40:19,848 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:40:19,848 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:40:19,848 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:40:19,849 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:40:19,849 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:40:19,849 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:40:19,849 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:40:19,849 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:40:19,850 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:40:19,850 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:40:19,850 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:40:19,850 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:40:19,850 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:40:19,851 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:40:19,851 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:40:19,851 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:40:19,851 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:40:19,851 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-26 21:40:19,894 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:40:19,906 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:40:19,910 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:40:19,912 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:40:19,912 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:40:19,913 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl [2018-09-26 21:40:19,914 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl' [2018-09-26 21:40:20,002 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:40:20,006 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:40:20,007 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:40:20,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:40:20,007 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:40:20,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:19" (1/1) ... [2018-09-26 21:40:20,044 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:19" (1/1) ... [2018-09-26 21:40:20,049 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 21:40:20,050 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 21:40:20,050 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 21:40:20,052 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:40:20,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:40:20,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:40:20,054 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:40:20,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:19" (1/1) ... [2018-09-26 21:40:20,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:19" (1/1) ... [2018-09-26 21:40:20,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:19" (1/1) ... [2018-09-26 21:40:20,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:19" (1/1) ... [2018-09-26 21:40:20,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:19" (1/1) ... [2018-09-26 21:40:20,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:19" (1/1) ... [2018-09-26 21:40:20,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:19" (1/1) ... [2018-09-26 21:40:20,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:40:20,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:40:20,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:40:20,119 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:40:20,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:40:20,208 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-26 21:40:20,209 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-26 21:40:20,209 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-26 21:40:21,023 INFO L343 CfgBuilder]: Using library mode [2018-09-26 21:40:21,023 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:40:21 BoogieIcfgContainer [2018-09-26 21:40:21,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:40:21,025 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:40:21,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:40:21,028 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:40:21,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:19" (1/2) ... [2018-09-26 21:40:21,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a835da3 and model type threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:40:21, skipping insertion in model container [2018-09-26 21:40:21,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:40:21" (2/2) ... [2018-09-26 21:40:21,032 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out.bpl [2018-09-26 21:40:21,042 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:40:21,053 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-09-26 21:40:21,106 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:40:21,107 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:40:21,107 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:40:21,107 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:40:21,108 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:40:21,108 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:40:21,108 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:40:21,108 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:40:21,108 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:40:21,127 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-09-26 21:40:21,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 21:40:21,138 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:21,139 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:21,140 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:21,148 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:21,148 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-09-26 21:40:21,150 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:21,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:21,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:21,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:21,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:21,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:21,536 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:21,536 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:40:21,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 21:40:21,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 21:40:21,554 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:21,556 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-09-26 21:40:25,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:25,056 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-09-26 21:40:25,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 21:40:25,059 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-26 21:40:25,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:25,090 INFO L225 Difference]: With dead ends: 163 [2018-09-26 21:40:25,090 INFO L226 Difference]: Without dead ends: 158 [2018-09-26 21:40:25,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:25,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-26 21:40:25,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-09-26 21:40:25,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 21:40:25,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-09-26 21:40:25,149 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-09-26 21:40:25,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:25,150 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-09-26 21:40:25,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 21:40:25,150 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-09-26 21:40:25,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 21:40:25,152 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:25,152 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:25,153 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:25,153 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:25,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-09-26 21:40:25,154 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:25,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:25,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:25,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:25,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:25,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:25,262 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:25,263 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:40:25,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 21:40:25,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 21:40:25,265 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:25,266 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-09-26 21:40:28,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:28,106 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-09-26 21:40:28,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 21:40:28,107 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-26 21:40:28,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:28,112 INFO L225 Difference]: With dead ends: 188 [2018-09-26 21:40:28,112 INFO L226 Difference]: Without dead ends: 183 [2018-09-26 21:40:28,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:28,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-26 21:40:28,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-09-26 21:40:28,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-26 21:40:28,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-09-26 21:40:28,150 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-09-26 21:40:28,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:28,151 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-09-26 21:40:28,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 21:40:28,151 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-09-26 21:40:28,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 21:40:28,152 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:28,152 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:28,153 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:28,153 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:28,154 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-09-26 21:40:28,154 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:28,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:28,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:28,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:28,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:28,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:28,290 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:28,291 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 21:40:28,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:40:28,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:40:28,291 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:28,292 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-09-26 21:40:32,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:32,410 INFO L93 Difference]: Finished difference Result 361 states and 808 transitions. [2018-09-26 21:40:32,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 21:40:32,411 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-26 21:40:32,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:32,419 INFO L225 Difference]: With dead ends: 361 [2018-09-26 21:40:32,419 INFO L226 Difference]: Without dead ends: 349 [2018-09-26 21:40:32,421 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:32,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-09-26 21:40:32,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 174. [2018-09-26 21:40:32,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-09-26 21:40:32,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 387 transitions. [2018-09-26 21:40:32,469 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 387 transitions. Word has length 9 [2018-09-26 21:40:32,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:32,470 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 387 transitions. [2018-09-26 21:40:32,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:40:32,470 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 387 transitions. [2018-09-26 21:40:32,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 21:40:32,472 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:32,472 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:32,473 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:32,473 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:32,473 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-09-26 21:40:32,473 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:32,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:32,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:32,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:32,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:32,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:32,921 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:32,922 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 21:40:32,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:40:32,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:40:32,923 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:32,923 INFO L87 Difference]: Start difference. First operand 174 states and 387 transitions. Second operand 7 states. [2018-09-26 21:40:35,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:35,901 INFO L93 Difference]: Finished difference Result 307 states and 694 transitions. [2018-09-26 21:40:35,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 21:40:35,902 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-26 21:40:35,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:35,905 INFO L225 Difference]: With dead ends: 307 [2018-09-26 21:40:35,905 INFO L226 Difference]: Without dead ends: 302 [2018-09-26 21:40:35,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:35,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-09-26 21:40:35,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 203. [2018-09-26 21:40:35,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-26 21:40:35,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-09-26 21:40:35,939 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-09-26 21:40:35,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:35,939 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-09-26 21:40:35,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:40:35,939 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-09-26 21:40:35,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:40:35,941 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:35,941 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:35,942 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:35,942 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:35,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-09-26 21:40:35,943 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:35,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:35,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:35,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:35,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:36,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:36,249 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:36,249 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:40:36,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:40:36,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:40:36,250 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:36,250 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 8 states. [2018-09-26 21:40:44,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:44,535 INFO L93 Difference]: Finished difference Result 741 states and 1656 transitions. [2018-09-26 21:40:44,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 21:40:44,536 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:40:44,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:44,542 INFO L225 Difference]: With dead ends: 741 [2018-09-26 21:40:44,542 INFO L226 Difference]: Without dead ends: 733 [2018-09-26 21:40:44,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:44,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-09-26 21:40:44,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 315. [2018-09-26 21:40:44,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-09-26 21:40:44,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 743 transitions. [2018-09-26 21:40:44,597 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 743 transitions. Word has length 12 [2018-09-26 21:40:44,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:44,598 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 743 transitions. [2018-09-26 21:40:44,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:40:44,598 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 743 transitions. [2018-09-26 21:40:44,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:40:44,600 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:44,600 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:44,603 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:44,603 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:44,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-09-26 21:40:44,603 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:44,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:44,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:44,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:44,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:44,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:44,708 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:44,708 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:40:44,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:40:44,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:40:44,709 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:44,709 INFO L87 Difference]: Start difference. First operand 315 states and 743 transitions. Second operand 8 states. [2018-09-26 21:40:59,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:59,337 INFO L93 Difference]: Finished difference Result 797 states and 1784 transitions. [2018-09-26 21:40:59,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 21:40:59,337 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:40:59,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:59,344 INFO L225 Difference]: With dead ends: 797 [2018-09-26 21:40:59,344 INFO L226 Difference]: Without dead ends: 789 [2018-09-26 21:40:59,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:59,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-09-26 21:40:59,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 319. [2018-09-26 21:40:59,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-09-26 21:40:59,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 751 transitions. [2018-09-26 21:40:59,399 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 751 transitions. Word has length 12 [2018-09-26 21:40:59,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:59,399 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 751 transitions. [2018-09-26 21:40:59,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:40:59,400 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 751 transitions. [2018-09-26 21:40:59,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:40:59,401 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:59,401 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:59,402 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:59,402 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:59,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-09-26 21:40:59,402 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:59,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:59,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:59,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:59,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:59,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:59,624 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:59,624 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:40:59,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:40:59,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:40:59,625 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:59,625 INFO L87 Difference]: Start difference. First operand 319 states and 751 transitions. Second operand 8 states. [2018-09-26 21:41:06,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:06,472 INFO L93 Difference]: Finished difference Result 684 states and 1538 transitions. [2018-09-26 21:41:06,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 21:41:06,472 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:41:06,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:06,478 INFO L225 Difference]: With dead ends: 684 [2018-09-26 21:41:06,478 INFO L226 Difference]: Without dead ends: 676 [2018-09-26 21:41:06,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:06,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-09-26 21:41:06,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 330. [2018-09-26 21:41:06,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-09-26 21:41:06,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 778 transitions. [2018-09-26 21:41:06,549 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 778 transitions. Word has length 12 [2018-09-26 21:41:06,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:06,549 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 778 transitions. [2018-09-26 21:41:06,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:41:06,550 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 778 transitions. [2018-09-26 21:41:06,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:41:06,551 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:06,551 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:06,552 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:06,552 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:06,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-09-26 21:41:06,552 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:06,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:06,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:06,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:06,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:06,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:06,828 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:41:06,828 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:41:06,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:41:06,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:41:06,829 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:06,829 INFO L87 Difference]: Start difference. First operand 330 states and 778 transitions. Second operand 8 states. [2018-09-26 21:41:12,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:12,048 INFO L93 Difference]: Finished difference Result 605 states and 1360 transitions. [2018-09-26 21:41:12,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 21:41:12,048 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:41:12,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:12,053 INFO L225 Difference]: With dead ends: 605 [2018-09-26 21:41:12,053 INFO L226 Difference]: Without dead ends: 597 [2018-09-26 21:41:12,054 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:12,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-09-26 21:41:12,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 337. [2018-09-26 21:41:12,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-09-26 21:41:12,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 794 transitions. [2018-09-26 21:41:12,114 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 794 transitions. Word has length 12 [2018-09-26 21:41:12,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:12,114 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 794 transitions. [2018-09-26 21:41:12,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:41:12,114 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 794 transitions. [2018-09-26 21:41:12,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:41:12,115 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:12,115 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:12,116 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:12,116 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:12,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1088621469, now seen corresponding path program 1 times [2018-09-26 21:41:12,117 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:12,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:12,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:12,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:12,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:12,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:12,358 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:41:12,358 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:41:12,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:41:12,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:41:12,359 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:12,359 INFO L87 Difference]: Start difference. First operand 337 states and 794 transitions. Second operand 8 states. [2018-09-26 21:41:20,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:20,117 INFO L93 Difference]: Finished difference Result 935 states and 2104 transitions. [2018-09-26 21:41:20,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 21:41:20,118 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:41:20,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:20,124 INFO L225 Difference]: With dead ends: 935 [2018-09-26 21:41:20,124 INFO L226 Difference]: Without dead ends: 927 [2018-09-26 21:41:20,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:20,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-09-26 21:41:20,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 343. [2018-09-26 21:41:20,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-09-26 21:41:20,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 808 transitions. [2018-09-26 21:41:20,207 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 808 transitions. Word has length 12 [2018-09-26 21:41:20,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:20,208 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 808 transitions. [2018-09-26 21:41:20,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:41:20,208 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 808 transitions. [2018-09-26 21:41:20,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:41:20,209 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:20,209 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:20,209 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:20,209 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:20,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1085821115, now seen corresponding path program 1 times [2018-09-26 21:41:20,210 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:20,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:20,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:20,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:20,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:20,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:20,301 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:41:20,301 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:41:20,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:41:20,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:41:20,302 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:20,303 INFO L87 Difference]: Start difference. First operand 343 states and 808 transitions. Second operand 8 states. [2018-09-26 21:41:27,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:27,981 INFO L93 Difference]: Finished difference Result 923 states and 2061 transitions. [2018-09-26 21:41:27,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 21:41:27,982 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:41:27,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:27,988 INFO L225 Difference]: With dead ends: 923 [2018-09-26 21:41:27,988 INFO L226 Difference]: Without dead ends: 915 [2018-09-26 21:41:27,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:27,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-09-26 21:41:28,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 354. [2018-09-26 21:41:28,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-09-26 21:41:28,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 835 transitions. [2018-09-26 21:41:28,087 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 835 transitions. Word has length 12 [2018-09-26 21:41:28,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:28,088 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 835 transitions. [2018-09-26 21:41:28,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:41:28,088 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 835 transitions. [2018-09-26 21:41:28,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:41:28,089 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:28,089 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:28,090 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:28,090 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:28,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1085923260, now seen corresponding path program 1 times [2018-09-26 21:41:28,090 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:28,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:28,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:28,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:28,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:28,205 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:41:28,206 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:41:28,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:41:28,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:41:28,207 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:28,207 INFO L87 Difference]: Start difference. First operand 354 states and 835 transitions. Second operand 8 states. [2018-09-26 21:41:33,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:33,829 INFO L93 Difference]: Finished difference Result 837 states and 1868 transitions. [2018-09-26 21:41:33,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 21:41:33,829 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:41:33,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:33,835 INFO L225 Difference]: With dead ends: 837 [2018-09-26 21:41:33,835 INFO L226 Difference]: Without dead ends: 829 [2018-09-26 21:41:33,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:33,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-09-26 21:41:33,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 339. [2018-09-26 21:41:33,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-09-26 21:41:33,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 800 transitions. [2018-09-26 21:41:33,945 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 800 transitions. Word has length 12 [2018-09-26 21:41:33,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:33,945 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 800 transitions. [2018-09-26 21:41:33,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:41:33,945 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 800 transitions. [2018-09-26 21:41:33,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:41:33,946 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:33,947 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:33,947 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:33,947 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:33,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1383194877, now seen corresponding path program 1 times [2018-09-26 21:41:33,948 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:33,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:33,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:33,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:33,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:34,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:34,235 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:41:34,235 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:41:34,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:41:34,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:41:34,236 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:34,236 INFO L87 Difference]: Start difference. First operand 339 states and 800 transitions. Second operand 8 states. [2018-09-26 21:41:43,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:43,029 INFO L93 Difference]: Finished difference Result 996 states and 2227 transitions. [2018-09-26 21:41:43,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 21:41:43,029 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:41:43,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:43,036 INFO L225 Difference]: With dead ends: 996 [2018-09-26 21:41:43,036 INFO L226 Difference]: Without dead ends: 988 [2018-09-26 21:41:43,037 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:43,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-09-26 21:41:43,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 381. [2018-09-26 21:41:43,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-26 21:41:43,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-09-26 21:41:43,170 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-09-26 21:41:43,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:43,172 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-09-26 21:41:43,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:41:43,172 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-09-26 21:41:43,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:41:43,173 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:43,173 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:43,174 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:43,174 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:43,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1383297022, now seen corresponding path program 1 times [2018-09-26 21:41:43,174 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:43,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:43,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:43,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:43,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:43,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:43,302 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:41:43,302 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:41:43,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:41:43,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:41:43,303 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:43,304 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-09-26 21:41:50,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:50,567 INFO L93 Difference]: Finished difference Result 913 states and 2034 transitions. [2018-09-26 21:41:50,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 21:41:50,568 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:41:50,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:50,573 INFO L225 Difference]: With dead ends: 913 [2018-09-26 21:41:50,573 INFO L226 Difference]: Without dead ends: 905 [2018-09-26 21:41:50,574 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:50,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-09-26 21:41:50,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 371. [2018-09-26 21:41:50,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-09-26 21:41:50,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 890 transitions. [2018-09-26 21:41:50,699 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 890 transitions. Word has length 12 [2018-09-26 21:41:50,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:50,699 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 890 transitions. [2018-09-26 21:41:50,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:41:50,700 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 890 transitions. [2018-09-26 21:41:50,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:41:50,700 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:50,701 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:50,701 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:50,701 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:50,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1392211258, now seen corresponding path program 1 times [2018-09-26 21:41:50,702 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:50,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:50,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:50,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:50,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:50,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:50,786 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:41:50,786 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:41:50,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:41:50,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:41:50,787 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:50,787 INFO L87 Difference]: Start difference. First operand 371 states and 890 transitions. Second operand 8 states. [2018-09-26 21:41:56,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:56,809 INFO L93 Difference]: Finished difference Result 886 states and 2009 transitions. [2018-09-26 21:41:56,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 21:41:56,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:41:56,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:56,814 INFO L225 Difference]: With dead ends: 886 [2018-09-26 21:41:56,814 INFO L226 Difference]: Without dead ends: 878 [2018-09-26 21:41:56,814 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:56,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2018-09-26 21:41:56,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 372. [2018-09-26 21:41:56,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-09-26 21:41:56,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 891 transitions. [2018-09-26 21:41:56,939 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 891 transitions. Word has length 12 [2018-09-26 21:41:56,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:56,939 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 891 transitions. [2018-09-26 21:41:56,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:41:56,939 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 891 transitions. [2018-09-26 21:41:56,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:41:56,940 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:56,940 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:56,940 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:56,940 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:56,940 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-09-26 21:41:56,941 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:56,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:56,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:56,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:56,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:57,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:57,039 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:41:57,039 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:41:57,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:41:57,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:41:57,040 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:57,040 INFO L87 Difference]: Start difference. First operand 372 states and 891 transitions. Second operand 9 states. [2018-09-26 21:42:03,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:03,820 INFO L93 Difference]: Finished difference Result 801 states and 1838 transitions. [2018-09-26 21:42:03,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 21:42:03,820 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 21:42:03,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:03,825 INFO L225 Difference]: With dead ends: 801 [2018-09-26 21:42:03,825 INFO L226 Difference]: Without dead ends: 793 [2018-09-26 21:42:03,825 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:03,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-09-26 21:42:03,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 393. [2018-09-26 21:42:03,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-09-26 21:42:03,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 949 transitions. [2018-09-26 21:42:03,966 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 949 transitions. Word has length 12 [2018-09-26 21:42:03,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:03,966 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 949 transitions. [2018-09-26 21:42:03,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:42:03,966 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 949 transitions. [2018-09-26 21:42:03,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:42:03,967 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:03,967 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:03,967 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:03,968 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:03,968 INFO L82 PathProgramCache]: Analyzing trace with hash 192619318, now seen corresponding path program 1 times [2018-09-26 21:42:03,968 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:03,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:03,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:03,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:03,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:04,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:04,073 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:42:04,074 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:42:04,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:42:04,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:42:04,075 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:04,075 INFO L87 Difference]: Start difference. First operand 393 states and 949 transitions. Second operand 9 states. [2018-09-26 21:42:12,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:12,200 INFO L93 Difference]: Finished difference Result 962 states and 2211 transitions. [2018-09-26 21:42:12,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 21:42:12,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 21:42:12,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:12,205 INFO L225 Difference]: With dead ends: 962 [2018-09-26 21:42:12,205 INFO L226 Difference]: Without dead ends: 954 [2018-09-26 21:42:12,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:12,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-09-26 21:42:12,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 409. [2018-09-26 21:42:12,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-09-26 21:42:12,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 997 transitions. [2018-09-26 21:42:12,374 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 997 transitions. Word has length 12 [2018-09-26 21:42:12,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:12,374 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 997 transitions. [2018-09-26 21:42:12,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:42:12,375 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 997 transitions. [2018-09-26 21:42:12,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:42:12,375 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:12,375 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:12,376 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:12,376 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:12,376 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-09-26 21:42:12,376 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:12,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:12,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:12,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:12,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:12,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:12,551 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:42:12,551 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:42:12,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:42:12,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:42:12,552 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:12,552 INFO L87 Difference]: Start difference. First operand 409 states and 997 transitions. Second operand 9 states. [2018-09-26 21:42:21,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:21,021 INFO L93 Difference]: Finished difference Result 1000 states and 2329 transitions. [2018-09-26 21:42:21,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 21:42:21,022 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 21:42:21,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:21,029 INFO L225 Difference]: With dead ends: 1000 [2018-09-26 21:42:21,029 INFO L226 Difference]: Without dead ends: 992 [2018-09-26 21:42:21,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:21,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-09-26 21:42:21,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 430. [2018-09-26 21:42:21,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-09-26 21:42:21,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1052 transitions. [2018-09-26 21:42:21,215 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1052 transitions. Word has length 12 [2018-09-26 21:42:21,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:21,215 INFO L480 AbstractCegarLoop]: Abstraction has 430 states and 1052 transitions. [2018-09-26 21:42:21,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:42:21,215 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1052 transitions. [2018-09-26 21:42:21,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:42:21,216 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:21,216 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:21,216 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:21,217 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:21,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1320238459, now seen corresponding path program 1 times [2018-09-26 21:42:21,217 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:21,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:21,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:21,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:21,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:21,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:21,338 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:42:21,338 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:42:21,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:42:21,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:42:21,339 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:21,339 INFO L87 Difference]: Start difference. First operand 430 states and 1052 transitions. Second operand 9 states. [2018-09-26 21:42:30,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:30,976 INFO L93 Difference]: Finished difference Result 1065 states and 2466 transitions. [2018-09-26 21:42:30,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 21:42:30,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 21:42:30,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:30,982 INFO L225 Difference]: With dead ends: 1065 [2018-09-26 21:42:30,982 INFO L226 Difference]: Without dead ends: 1057 [2018-09-26 21:42:30,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:30,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2018-09-26 21:42:31,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 471. [2018-09-26 21:42:31,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-09-26 21:42:31,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1168 transitions. [2018-09-26 21:42:31,201 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1168 transitions. Word has length 12 [2018-09-26 21:42:31,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:31,202 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 1168 transitions. [2018-09-26 21:42:31,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:42:31,202 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1168 transitions. [2018-09-26 21:42:31,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:42:31,203 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:31,203 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:31,203 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:31,204 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:31,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1320340604, now seen corresponding path program 1 times [2018-09-26 21:42:31,204 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:31,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:31,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:31,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:31,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:31,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:31,310 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:42:31,310 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:42:31,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:42:31,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:42:31,311 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:31,312 INFO L87 Difference]: Start difference. First operand 471 states and 1168 transitions. Second operand 9 states. [2018-09-26 21:42:41,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:41,940 INFO L93 Difference]: Finished difference Result 1227 states and 2851 transitions. [2018-09-26 21:42:41,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 21:42:41,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 21:42:41,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:41,945 INFO L225 Difference]: With dead ends: 1227 [2018-09-26 21:42:41,946 INFO L226 Difference]: Without dead ends: 1219 [2018-09-26 21:42:41,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:41,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-09-26 21:42:42,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 438. [2018-09-26 21:42:42,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-09-26 21:42:42,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1072 transitions. [2018-09-26 21:42:42,162 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1072 transitions. Word has length 12 [2018-09-26 21:42:42,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:42,162 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 1072 transitions. [2018-09-26 21:42:42,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:42:42,163 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1072 transitions. [2018-09-26 21:42:42,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:42:42,163 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:42,163 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:42,164 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:42,164 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:42,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-09-26 21:42:42,164 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:42,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:42,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:42,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:42,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:42,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:42,267 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:42:42,267 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:42:42,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:42:42,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:42:42,268 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:42,268 INFO L87 Difference]: Start difference. First operand 438 states and 1072 transitions. Second operand 9 states. [2018-09-26 21:42:51,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:51,333 INFO L93 Difference]: Finished difference Result 1076 states and 2511 transitions. [2018-09-26 21:42:51,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 21:42:51,334 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 21:42:51,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:51,339 INFO L225 Difference]: With dead ends: 1076 [2018-09-26 21:42:51,339 INFO L226 Difference]: Without dead ends: 1068 [2018-09-26 21:42:51,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:51,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2018-09-26 21:42:51,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 445. [2018-09-26 21:42:51,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-09-26 21:42:51,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1088 transitions. [2018-09-26 21:42:51,569 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1088 transitions. Word has length 12 [2018-09-26 21:42:51,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:51,569 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 1088 transitions. [2018-09-26 21:42:51,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:42:51,569 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1088 transitions. [2018-09-26 21:42:51,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:42:51,570 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:51,570 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:51,570 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:51,570 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:51,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1838990990, now seen corresponding path program 1 times [2018-09-26 21:42:51,570 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:51,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:51,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:51,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:51,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:51,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:51,705 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:42:51,706 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:42:51,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:42:51,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:42:51,706 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:51,707 INFO L87 Difference]: Start difference. First operand 445 states and 1088 transitions. Second operand 9 states. [2018-09-26 21:42:59,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:59,514 INFO L93 Difference]: Finished difference Result 1111 states and 2606 transitions. [2018-09-26 21:42:59,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 21:42:59,514 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 21:42:59,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:59,519 INFO L225 Difference]: With dead ends: 1111 [2018-09-26 21:42:59,519 INFO L226 Difference]: Without dead ends: 1103 [2018-09-26 21:42:59,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:59,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2018-09-26 21:42:59,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 520. [2018-09-26 21:42:59,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-09-26 21:42:59,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1295 transitions. [2018-09-26 21:42:59,839 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1295 transitions. Word has length 12 [2018-09-26 21:42:59,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:59,839 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 1295 transitions. [2018-09-26 21:42:59,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:42:59,839 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1295 transitions. [2018-09-26 21:42:59,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:42:59,840 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:59,840 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:59,840 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:59,841 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:59,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1838888845, now seen corresponding path program 1 times [2018-09-26 21:42:59,841 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:59,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:59,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:59,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:59,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:59,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:59,930 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:42:59,930 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:42:59,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:42:59,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:42:59,931 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:59,931 INFO L87 Difference]: Start difference. First operand 520 states and 1295 transitions. Second operand 9 states. [2018-09-26 21:43:10,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:43:10,396 INFO L93 Difference]: Finished difference Result 1304 states and 3059 transitions. [2018-09-26 21:43:10,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 21:43:10,399 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 21:43:10,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:43:10,405 INFO L225 Difference]: With dead ends: 1304 [2018-09-26 21:43:10,405 INFO L226 Difference]: Without dead ends: 1296 [2018-09-26 21:43:10,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:43:10,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-09-26 21:43:10,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 487. [2018-09-26 21:43:10,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-09-26 21:43:10,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1199 transitions. [2018-09-26 21:43:10,725 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1199 transitions. Word has length 12 [2018-09-26 21:43:10,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:43:10,725 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 1199 transitions. [2018-09-26 21:43:10,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:43:10,725 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1199 transitions. [2018-09-26 21:43:10,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:43:10,726 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:43:10,726 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:43:10,726 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:43:10,726 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:43:10,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1731038698, now seen corresponding path program 1 times [2018-09-26 21:43:10,727 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:43:10,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:43:10,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:10,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:10,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:10,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:43:10,816 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:43:10,816 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:43:10,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:43:10,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:43:10,817 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:43:10,817 INFO L87 Difference]: Start difference. First operand 487 states and 1199 transitions. Second operand 9 states. [2018-09-26 21:43:22,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:43:22,419 INFO L93 Difference]: Finished difference Result 1370 states and 3217 transitions. [2018-09-26 21:43:22,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 21:43:22,421 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 21:43:22,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:43:22,428 INFO L225 Difference]: With dead ends: 1370 [2018-09-26 21:43:22,428 INFO L226 Difference]: Without dead ends: 1362 [2018-09-26 21:43:22,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:43:22,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2018-09-26 21:43:22,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 479. [2018-09-26 21:43:22,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-09-26 21:43:22,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1179 transitions. [2018-09-26 21:43:22,784 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1179 transitions. Word has length 12 [2018-09-26 21:43:22,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:43:22,785 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 1179 transitions. [2018-09-26 21:43:22,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:43:22,785 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1179 transitions. [2018-09-26 21:43:22,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:43:22,786 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:43:22,786 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:43:22,787 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:43:22,787 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:43:22,787 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-09-26 21:43:22,787 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:43:22,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:43:22,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:22,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:22,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:22,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:43:22,875 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:43:22,875 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:43:22,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:43:22,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:43:22,876 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:43:22,876 INFO L87 Difference]: Start difference. First operand 479 states and 1179 transitions. Second operand 9 states. [2018-09-26 21:43:30,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:43:30,238 INFO L93 Difference]: Finished difference Result 1298 states and 3068 transitions. [2018-09-26 21:43:30,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 21:43:30,239 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 21:43:30,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:43:30,243 INFO L225 Difference]: With dead ends: 1298 [2018-09-26 21:43:30,244 INFO L226 Difference]: Without dead ends: 1290 [2018-09-26 21:43:30,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:43:30,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-09-26 21:43:30,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 602. [2018-09-26 21:43:30,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-09-26 21:43:30,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-09-26 21:43:30,711 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-09-26 21:43:30,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:43:30,712 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-09-26 21:43:30,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:43:30,712 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-09-26 21:43:30,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 21:43:30,712 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:43:30,712 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:43:30,713 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:43:30,713 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:43:30,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1080362888, now seen corresponding path program 1 times [2018-09-26 21:43:30,713 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:43:30,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:43:30,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:30,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:30,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:30,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:43:30,760 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:43:30,760 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:43:30,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:43:30,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:43:30,761 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:43:30,761 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-09-26 21:43:31,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:43:31,843 INFO L93 Difference]: Finished difference Result 1242 states and 3091 transitions. [2018-09-26 21:43:31,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:43:31,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-26 21:43:31,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:43:31,846 INFO L225 Difference]: With dead ends: 1242 [2018-09-26 21:43:31,847 INFO L226 Difference]: Without dead ends: 673 [2018-09-26 21:43:31,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:43:31,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-09-26 21:43:32,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 612. [2018-09-26 21:43:32,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-09-26 21:43:32,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1463 transitions. [2018-09-26 21:43:32,320 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1463 transitions. Word has length 13 [2018-09-26 21:43:32,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:43:32,320 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 1463 transitions. [2018-09-26 21:43:32,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:43:32,320 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1463 transitions. [2018-09-26 21:43:32,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 21:43:32,321 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:43:32,321 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:43:32,321 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:43:32,321 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:43:32,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1652407871, now seen corresponding path program 1 times [2018-09-26 21:43:32,322 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:43:32,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:43:32,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:32,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:32,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:32,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:43:32,412 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:43:32,413 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:43:32,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:32,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:43:33,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:43:33,554 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:43:33,554 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-26 21:43:33,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 21:43:33,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 21:43:33,555 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:43:33,555 INFO L87 Difference]: Start difference. First operand 612 states and 1463 transitions. Second operand 16 states. [2018-09-26 21:43:40,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:43:40,870 INFO L93 Difference]: Finished difference Result 854 states and 1987 transitions. [2018-09-26 21:43:40,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 21:43:40,870 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-09-26 21:43:40,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:43:40,873 INFO L225 Difference]: With dead ends: 854 [2018-09-26 21:43:40,873 INFO L226 Difference]: Without dead ends: 849 [2018-09-26 21:43:40,873 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:43:40,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-09-26 21:43:41,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 690. [2018-09-26 21:43:41,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-09-26 21:43:41,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1639 transitions. [2018-09-26 21:43:41,565 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1639 transitions. Word has length 13 [2018-09-26 21:43:41,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:43:41,565 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1639 transitions. [2018-09-26 21:43:41,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 21:43:41,565 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1639 transitions. [2018-09-26 21:43:41,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 21:43:41,566 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:43:41,566 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:43:41,567 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:43:41,567 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:43:41,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1456173380, now seen corresponding path program 1 times [2018-09-26 21:43:41,567 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:43:41,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:43:41,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:41,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:41,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:41,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:43:41,737 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:43:41,737 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:43:41,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:43:41,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:43:41,738 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:43:41,738 INFO L87 Difference]: Start difference. First operand 690 states and 1639 transitions. Second operand 5 states. [2018-09-26 21:43:43,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:43:43,436 INFO L93 Difference]: Finished difference Result 1308 states and 3113 transitions. [2018-09-26 21:43:43,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:43:43,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-26 21:43:43,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:43:43,438 INFO L225 Difference]: With dead ends: 1308 [2018-09-26 21:43:43,439 INFO L226 Difference]: Without dead ends: 709 [2018-09-26 21:43:43,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:43:43,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-09-26 21:43:44,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 690. [2018-09-26 21:43:44,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-09-26 21:43:44,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-09-26 21:43:44,402 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-09-26 21:43:44,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:43:44,402 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-09-26 21:43:44,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:43:44,403 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-09-26 21:43:44,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:43:44,404 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:43:44,404 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:43:44,404 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr9ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:43:44,405 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:43:44,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1952744875, now seen corresponding path program 1 times [2018-09-26 21:43:44,405 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:43:44,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:43:44,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:44,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:44,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:43:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:44,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:43:44,701 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:43:44,701 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:43:44,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:43:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:43:44,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:43:45,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:43:45,289 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:43:45,289 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-26 21:43:45,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 21:43:45,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 21:43:45,290 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:43:45,290 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 17 states. Received shutdown request... [2018-09-26 21:44:25,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 21:44:25,350 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 21:44:25,356 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 21:44:25,356 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:44:25 BoogieIcfgContainer [2018-09-26 21:44:25,356 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:44:25,357 INFO L168 Benchmark]: Toolchain (without parser) took 245353.97 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -165.7 MB). Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 256.8 MB). Peak memory consumption was 91.1 MB. Max. memory is 7.1 GB. [2018-09-26 21:44:25,360 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:44:25,361 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:44:25,361 INFO L168 Benchmark]: Boogie Preprocessor took 62.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:44:25,362 INFO L168 Benchmark]: RCFGBuilder took 904.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-26 21:44:25,363 INFO L168 Benchmark]: TraceAbstraction took 244331.41 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -165.7 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 225.1 MB). Peak memory consumption was 59.4 MB. Max. memory is 7.1 GB. [2018-09-26 21:44:25,368 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 46.06 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 62.06 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 904.71 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 244331.41 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -165.7 MB). Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 225.1 MB). Peak memory consumption was 59.4 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 (690states) and FLOYD_HOARE automaton (currently 93 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (630 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 (690states) and FLOYD_HOARE automaton (currently 93 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (630 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 (690states) and FLOYD_HOARE automaton (currently 93 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (630 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 (690states) and FLOYD_HOARE automaton (currently 93 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (630 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 (690states) and FLOYD_HOARE automaton (currently 93 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (630 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 (690states) and FLOYD_HOARE automaton (currently 93 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (630 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 (690states) and FLOYD_HOARE automaton (currently 93 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (630 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 (690states) and FLOYD_HOARE automaton (currently 93 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (630 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 (690states) and FLOYD_HOARE automaton (currently 93 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (630 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 (690states) and FLOYD_HOARE automaton (currently 93 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (630 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 (690states) and FLOYD_HOARE automaton (currently 93 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (630 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 (690states) and FLOYD_HOARE automaton (currently 93 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (630 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 (690states) and FLOYD_HOARE automaton (currently 93 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (630 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 (690states) and FLOYD_HOARE automaton (currently 93 states, 17 states before enhancement), while ReachableStatesComputation was computing reachable states (630 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 244.2s OverallTime, 28 OverallIterations, 2 TraceHistogramMax, 231.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7806 SDtfs, 20596 SDslu, 22529 SDs, 0 SdLazy, 46099 SolverSat, 4651 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 53.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 690 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 658 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=690occurred in iteration=26, 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: 5.8s AutomataMinimizationTime, 27 MinimizatonAttempts, 11879 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 356 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 326 ConstructedInterpolants, 14 QuantifiedInterpolants, 17016 SizeOfPredicates, 12 NumberOfNonLiveVariables, 75 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 30 InterpolantComputations, 26 PerfectInterpolantSequences, 12/19 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-09-26_21-44-25-384.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-09-26_21-44-25-384.csv Completed graceful shutdown