java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 20:06:12,879 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:06:12,884 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:06:12,903 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:06:12,903 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:06:12,905 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:06:12,907 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:06:12,909 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:06:12,913 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:06:12,919 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:06:12,920 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:06:12,921 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:06:12,927 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:06:12,928 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:06:12,929 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:06:12,930 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:06:12,931 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:06:12,938 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:06:12,943 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:06:12,944 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:06:12,948 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:06:12,949 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:06:12,952 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:06:12,952 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:06:12,956 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:06:12,957 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:06:12,959 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:06:12,960 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:06:12,962 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:06:12,964 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:06:12,965 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:06:12,966 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:06:12,966 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:06:12,966 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:06:12,970 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:06:12,970 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:06:12,971 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 20:06:12,995 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:06:12,996 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:06:12,997 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:06:12,997 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:06:12,998 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:06:12,998 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:06:12,999 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:06:12,999 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:06:12,999 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:06:13,000 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:06:13,000 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:06:13,001 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:06:13,001 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:06:13,001 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:06:13,001 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:06:13,001 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:06:13,002 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:06:13,002 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:06:13,002 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:06:13,002 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:06:13,002 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:06:13,003 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:06:13,003 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:06:13,003 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:06:13,003 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:06:13,003 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:06:13,004 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:06:13,004 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:06:13,004 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:06:13,004 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:06:13,076 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:06:13,090 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:06:13,094 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:06:13,096 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:06:13,096 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:06:13,097 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-30 20:06:13,097 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl' [2018-09-30 20:06:13,169 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:06:13,173 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:06:13,174 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:06:13,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:06:13,174 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:06:13,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:13" (1/1) ... [2018-09-30 20:06:13,210 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:13" (1/1) ... [2018-09-30 20:06:13,215 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 20:06:13,215 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 20:06:13,216 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 20:06:13,218 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:06:13,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:06:13,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:06:13,219 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:06:13,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:13" (1/1) ... [2018-09-30 20:06:13,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:13" (1/1) ... [2018-09-30 20:06:13,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:13" (1/1) ... [2018-09-30 20:06:13,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:13" (1/1) ... [2018-09-30 20:06:13,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:13" (1/1) ... [2018-09-30 20:06:13,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:13" (1/1) ... [2018-09-30 20:06:13,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:13" (1/1) ... [2018-09-30 20:06:13,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:06:13,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:06:13,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:06:13,271 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:06:13,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:13" (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-30 20:06:13,360 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-30 20:06:13,360 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-30 20:06:13,360 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-30 20:06:14,089 INFO L345 CfgBuilder]: Using library mode [2018-09-30 20:06:14,090 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:06:14 BoogieIcfgContainer [2018-09-30 20:06:14,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:06:14,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:06:14,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:06:14,094 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:06:14,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:06:13" (1/2) ... [2018-09-30 20:06:14,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e51e491 and model type threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:06:14, skipping insertion in model container [2018-09-30 20:06:14,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:06:14" (2/2) ... [2018-09-30 20:06:14,098 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out.bpl [2018-09-30 20:06:14,108 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:06:14,117 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-09-30 20:06:14,170 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:06:14,171 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:06:14,171 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:06:14,171 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:06:14,171 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:06:14,172 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:06:14,172 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:06:14,172 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:06:14,172 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:06:14,191 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-09-30 20:06:14,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 20:06:14,198 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:14,199 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:14,201 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:14,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:14,207 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-09-30 20:06:14,209 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:14,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:14,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:14,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:14,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:14,511 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-30 20:06:14,515 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:14,515 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:06:14,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 20:06:14,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 20:06:14,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-30 20:06:14,539 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-09-30 20:06:16,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:16,438 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-09-30 20:06:16,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 20:06:16,441 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-30 20:06:16,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:16,459 INFO L225 Difference]: With dead ends: 163 [2018-09-30 20:06:16,459 INFO L226 Difference]: Without dead ends: 158 [2018-09-30 20:06:16,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:06:16,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-30 20:06:16,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-09-30 20:06:16,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-30 20:06:16,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-09-30 20:06:16,525 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-09-30 20:06:16,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:16,525 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-09-30 20:06:16,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 20:06:16,525 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-09-30 20:06:16,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 20:06:16,527 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:16,527 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:16,528 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:16,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:16,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-09-30 20:06:16,529 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:16,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:16,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:16,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:16,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:16,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:16,651 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:16,651 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:06:16,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 20:06:16,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 20:06:16,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-30 20:06:16,655 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-09-30 20:06:17,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:17,713 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-09-30 20:06:17,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 20:06:17,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-30 20:06:17,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:17,718 INFO L225 Difference]: With dead ends: 188 [2018-09-30 20:06:17,718 INFO L226 Difference]: Without dead ends: 183 [2018-09-30 20:06:17,720 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:06:17,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-30 20:06:17,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-09-30 20:06:17,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-30 20:06:17,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-09-30 20:06:17,749 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-09-30 20:06:17,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:17,749 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-09-30 20:06:17,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 20:06:17,750 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-09-30 20:06:17,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:06:17,751 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:17,751 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:17,752 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:17,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:17,753 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-09-30 20:06:17,753 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:17,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:17,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:17,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:17,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:17,862 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-30 20:06:17,863 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:17,863 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:06:17,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:06:17,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:06:17,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:06:17,865 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-09-30 20:06:19,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:19,619 INFO L93 Difference]: Finished difference Result 361 states and 808 transitions. [2018-09-30 20:06:19,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:06:19,620 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-30 20:06:19,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:19,625 INFO L225 Difference]: With dead ends: 361 [2018-09-30 20:06:19,625 INFO L226 Difference]: Without dead ends: 349 [2018-09-30 20:06:19,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-09-30 20:06:19,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-09-30 20:06:19,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 174. [2018-09-30 20:06:19,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-09-30 20:06:19,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 387 transitions. [2018-09-30 20:06:19,667 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 387 transitions. Word has length 9 [2018-09-30 20:06:19,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:19,667 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 387 transitions. [2018-09-30 20:06:19,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:06:19,668 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 387 transitions. [2018-09-30 20:06:19,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:06:19,669 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:19,669 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:19,670 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:19,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:19,671 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-09-30 20:06:19,671 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:19,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:19,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:19,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:19,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:19,805 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-30 20:06:19,806 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:19,806 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 20:06:19,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:06:19,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:06:19,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:06:19,808 INFO L87 Difference]: Start difference. First operand 174 states and 387 transitions. Second operand 7 states. [2018-09-30 20:06:21,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:21,042 INFO L93 Difference]: Finished difference Result 307 states and 694 transitions. [2018-09-30 20:06:21,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 20:06:21,044 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-30 20:06:21,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:21,047 INFO L225 Difference]: With dead ends: 307 [2018-09-30 20:06:21,047 INFO L226 Difference]: Without dead ends: 302 [2018-09-30 20:06:21,048 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-09-30 20:06:21,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-09-30 20:06:21,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 203. [2018-09-30 20:06:21,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-30 20:06:21,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-09-30 20:06:21,098 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-09-30 20:06:21,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:21,098 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-09-30 20:06:21,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:06:21,098 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-09-30 20:06:21,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:06:21,100 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:21,101 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:21,101 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:21,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:21,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-09-30 20:06:21,102 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:21,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:21,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:21,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:21,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:21,552 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-30 20:06:21,552 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:21,552 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:06:21,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:06:21,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:06:21,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:06:21,554 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 8 states. [2018-09-30 20:06:25,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:25,032 INFO L93 Difference]: Finished difference Result 741 states and 1656 transitions. [2018-09-30 20:06:25,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 20:06:25,033 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:06:25,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:25,039 INFO L225 Difference]: With dead ends: 741 [2018-09-30 20:06:25,040 INFO L226 Difference]: Without dead ends: 733 [2018-09-30 20:06:25,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2018-09-30 20:06:25,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-09-30 20:06:25,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 315. [2018-09-30 20:06:25,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-09-30 20:06:25,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 743 transitions. [2018-09-30 20:06:25,095 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 743 transitions. Word has length 12 [2018-09-30 20:06:25,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:25,095 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 743 transitions. [2018-09-30 20:06:25,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:06:25,096 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 743 transitions. [2018-09-30 20:06:25,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:06:25,098 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:25,098 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:25,098 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:25,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:25,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-09-30 20:06:25,099 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:25,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:25,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:25,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:25,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:25,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-30 20:06:25,302 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:25,302 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:06:25,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:06:25,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:06:25,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:06:25,303 INFO L87 Difference]: Start difference. First operand 315 states and 743 transitions. Second operand 8 states. [2018-09-30 20:06:33,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:33,057 INFO L93 Difference]: Finished difference Result 797 states and 1784 transitions. [2018-09-30 20:06:33,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 20:06:33,060 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:06:33,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:33,066 INFO L225 Difference]: With dead ends: 797 [2018-09-30 20:06:33,067 INFO L226 Difference]: Without dead ends: 789 [2018-09-30 20:06:33,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-09-30 20:06:33,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-09-30 20:06:33,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 319. [2018-09-30 20:06:33,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-09-30 20:06:33,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 751 transitions. [2018-09-30 20:06:33,149 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 751 transitions. Word has length 12 [2018-09-30 20:06:33,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:33,149 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 751 transitions. [2018-09-30 20:06:33,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:06:33,150 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 751 transitions. [2018-09-30 20:06:33,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:06:33,151 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:33,151 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:33,152 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:33,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:33,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-09-30 20:06:33,152 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:33,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:33,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:33,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:33,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:33,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-30 20:06:33,290 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:33,291 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:06:33,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:06:33,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:06:33,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:06:33,292 INFO L87 Difference]: Start difference. First operand 319 states and 751 transitions. Second operand 8 states. [2018-09-30 20:06:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:35,719 INFO L93 Difference]: Finished difference Result 684 states and 1538 transitions. [2018-09-30 20:06:35,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 20:06:35,720 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:06:35,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:35,726 INFO L225 Difference]: With dead ends: 684 [2018-09-30 20:06:35,726 INFO L226 Difference]: Without dead ends: 676 [2018-09-30 20:06:35,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-09-30 20:06:35,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-09-30 20:06:35,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 330. [2018-09-30 20:06:35,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-09-30 20:06:35,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 778 transitions. [2018-09-30 20:06:35,788 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 778 transitions. Word has length 12 [2018-09-30 20:06:35,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:35,788 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 778 transitions. [2018-09-30 20:06:35,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:06:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 778 transitions. [2018-09-30 20:06:35,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:06:35,790 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:35,790 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:35,790 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:35,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:35,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-09-30 20:06:35,791 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:35,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:35,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:35,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:35,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:36,285 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-30 20:06:36,286 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:36,286 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:06:36,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:06:36,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:06:36,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:06:36,287 INFO L87 Difference]: Start difference. First operand 330 states and 778 transitions. Second operand 8 states. [2018-09-30 20:06:37,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:37,558 INFO L93 Difference]: Finished difference Result 605 states and 1360 transitions. [2018-09-30 20:06:37,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 20:06:37,559 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:06:37,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:37,568 INFO L225 Difference]: With dead ends: 605 [2018-09-30 20:06:37,568 INFO L226 Difference]: Without dead ends: 597 [2018-09-30 20:06:37,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-09-30 20:06:37,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-09-30 20:06:37,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 337. [2018-09-30 20:06:37,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-09-30 20:06:37,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 794 transitions. [2018-09-30 20:06:37,628 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 794 transitions. Word has length 12 [2018-09-30 20:06:37,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:37,629 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 794 transitions. [2018-09-30 20:06:37,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:06:37,629 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 794 transitions. [2018-09-30 20:06:37,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:06:37,630 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:37,630 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:37,631 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:37,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:37,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1088621469, now seen corresponding path program 1 times [2018-09-30 20:06:37,632 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:37,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:37,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:37,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:37,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:37,814 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-30 20:06:37,815 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:37,815 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:06:37,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:06:37,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:06:37,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:06:37,816 INFO L87 Difference]: Start difference. First operand 337 states and 794 transitions. Second operand 8 states. [2018-09-30 20:06:39,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:39,909 INFO L93 Difference]: Finished difference Result 935 states and 2104 transitions. [2018-09-30 20:06:39,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 20:06:39,909 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:06:39,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:39,916 INFO L225 Difference]: With dead ends: 935 [2018-09-30 20:06:39,916 INFO L226 Difference]: Without dead ends: 927 [2018-09-30 20:06:39,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2018-09-30 20:06:39,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-09-30 20:06:40,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 343. [2018-09-30 20:06:40,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-09-30 20:06:40,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 808 transitions. [2018-09-30 20:06:40,005 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 808 transitions. Word has length 12 [2018-09-30 20:06:40,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:40,005 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 808 transitions. [2018-09-30 20:06:40,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:06:40,005 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 808 transitions. [2018-09-30 20:06:40,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:06:40,006 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:40,006 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:40,007 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:40,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:40,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1085821115, now seen corresponding path program 1 times [2018-09-30 20:06:40,008 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:40,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:40,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:40,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:40,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:40,094 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-30 20:06:40,095 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:40,095 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:06:40,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:06:40,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:06:40,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:06:40,096 INFO L87 Difference]: Start difference. First operand 343 states and 808 transitions. Second operand 8 states. [2018-09-30 20:06:42,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:42,167 INFO L93 Difference]: Finished difference Result 923 states and 2061 transitions. [2018-09-30 20:06:42,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 20:06:42,167 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:06:42,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:42,173 INFO L225 Difference]: With dead ends: 923 [2018-09-30 20:06:42,173 INFO L226 Difference]: Without dead ends: 915 [2018-09-30 20:06:42,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-09-30 20:06:42,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-09-30 20:06:42,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 354. [2018-09-30 20:06:42,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-09-30 20:06:42,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 835 transitions. [2018-09-30 20:06:42,268 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 835 transitions. Word has length 12 [2018-09-30 20:06:42,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:42,269 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 835 transitions. [2018-09-30 20:06:42,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:06:42,269 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 835 transitions. [2018-09-30 20:06:42,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:06:42,270 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:42,270 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:42,270 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:42,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:42,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1085923260, now seen corresponding path program 1 times [2018-09-30 20:06:42,271 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:42,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:42,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:42,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:42,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:42,365 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-30 20:06:42,365 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:42,365 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:06:42,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:06:42,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:06:42,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:06:42,366 INFO L87 Difference]: Start difference. First operand 354 states and 835 transitions. Second operand 8 states. [2018-09-30 20:06:44,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:44,147 INFO L93 Difference]: Finished difference Result 837 states and 1868 transitions. [2018-09-30 20:06:44,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 20:06:44,147 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:06:44,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:44,153 INFO L225 Difference]: With dead ends: 837 [2018-09-30 20:06:44,153 INFO L226 Difference]: Without dead ends: 829 [2018-09-30 20:06:44,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-09-30 20:06:44,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-09-30 20:06:44,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 339. [2018-09-30 20:06:44,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-09-30 20:06:44,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 800 transitions. [2018-09-30 20:06:44,256 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 800 transitions. Word has length 12 [2018-09-30 20:06:44,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:44,257 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 800 transitions. [2018-09-30 20:06:44,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:06:44,257 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 800 transitions. [2018-09-30 20:06:44,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:06:44,258 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:44,258 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:44,258 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:44,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:44,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1383194877, now seen corresponding path program 1 times [2018-09-30 20:06:44,259 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:44,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:44,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:44,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:44,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:44,390 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-30 20:06:44,390 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:44,390 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:06:44,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:06:44,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:06:44,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:06:44,391 INFO L87 Difference]: Start difference. First operand 339 states and 800 transitions. Second operand 8 states. [2018-09-30 20:06:46,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:46,684 INFO L93 Difference]: Finished difference Result 996 states and 2227 transitions. [2018-09-30 20:06:46,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-30 20:06:46,685 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:06:46,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:46,691 INFO L225 Difference]: With dead ends: 996 [2018-09-30 20:06:46,691 INFO L226 Difference]: Without dead ends: 988 [2018-09-30 20:06:46,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-09-30 20:06:46,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-09-30 20:06:46,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 381. [2018-09-30 20:06:46,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-30 20:06:46,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-09-30 20:06:46,828 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-09-30 20:06:46,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:46,830 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-09-30 20:06:46,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:06:46,830 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-09-30 20:06:46,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:06:46,831 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:46,831 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:46,831 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:46,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:46,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1383297022, now seen corresponding path program 1 times [2018-09-30 20:06:46,832 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:46,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:46,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:46,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:46,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:47,076 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-30 20:06:47,077 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:47,077 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:06:47,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:06:47,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:06:47,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:06:47,078 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-09-30 20:06:49,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:49,179 INFO L93 Difference]: Finished difference Result 913 states and 2034 transitions. [2018-09-30 20:06:49,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 20:06:49,180 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:06:49,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:49,185 INFO L225 Difference]: With dead ends: 913 [2018-09-30 20:06:49,185 INFO L226 Difference]: Without dead ends: 905 [2018-09-30 20:06:49,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2018-09-30 20:06:49,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-09-30 20:06:49,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 371. [2018-09-30 20:06:49,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-09-30 20:06:49,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 890 transitions. [2018-09-30 20:06:49,316 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 890 transitions. Word has length 12 [2018-09-30 20:06:49,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:49,316 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 890 transitions. [2018-09-30 20:06:49,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:06:49,316 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 890 transitions. [2018-09-30 20:06:49,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:06:49,317 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:49,317 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:49,318 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:49,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:49,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1392211258, now seen corresponding path program 1 times [2018-09-30 20:06:49,318 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:49,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:49,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:49,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:49,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:49,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:06:49,407 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:49,407 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:06:49,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:06:49,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:06:49,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:06:49,408 INFO L87 Difference]: Start difference. First operand 371 states and 890 transitions. Second operand 8 states. [2018-09-30 20:06:51,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:51,051 INFO L93 Difference]: Finished difference Result 886 states and 2009 transitions. [2018-09-30 20:06:51,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 20:06:51,051 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 20:06:51,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:51,056 INFO L225 Difference]: With dead ends: 886 [2018-09-30 20:06:51,056 INFO L226 Difference]: Without dead ends: 878 [2018-09-30 20:06:51,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-09-30 20:06:51,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2018-09-30 20:06:51,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 372. [2018-09-30 20:06:51,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-09-30 20:06:51,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 891 transitions. [2018-09-30 20:06:51,181 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 891 transitions. Word has length 12 [2018-09-30 20:06:51,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:51,182 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 891 transitions. [2018-09-30 20:06:51,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:06:51,182 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 891 transitions. [2018-09-30 20:06:51,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:06:51,182 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:51,183 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:51,183 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:51,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:51,183 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-09-30 20:06:51,184 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:51,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:51,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:51,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:51,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:51,279 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-30 20:06:51,280 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:51,280 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:06:51,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:06:51,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:06:51,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:06:51,282 INFO L87 Difference]: Start difference. First operand 372 states and 891 transitions. Second operand 9 states. [2018-09-30 20:06:53,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:53,309 INFO L93 Difference]: Finished difference Result 801 states and 1838 transitions. [2018-09-30 20:06:53,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 20:06:53,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:06:53,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:53,312 INFO L225 Difference]: With dead ends: 801 [2018-09-30 20:06:53,313 INFO L226 Difference]: Without dead ends: 793 [2018-09-30 20:06:53,313 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2018-09-30 20:06:53,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-09-30 20:06:53,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 393. [2018-09-30 20:06:53,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-09-30 20:06:53,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 949 transitions. [2018-09-30 20:06:53,469 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 949 transitions. Word has length 12 [2018-09-30 20:06:53,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:53,469 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 949 transitions. [2018-09-30 20:06:53,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:06:53,469 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 949 transitions. [2018-09-30 20:06:53,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:06:53,470 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:53,470 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:53,471 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:53,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:53,471 INFO L82 PathProgramCache]: Analyzing trace with hash 192619318, now seen corresponding path program 1 times [2018-09-30 20:06:53,471 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:53,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:53,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:53,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:53,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:53,566 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-30 20:06:53,567 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:53,567 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:06:53,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:06:53,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:06:53,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:06:53,568 INFO L87 Difference]: Start difference. First operand 393 states and 949 transitions. Second operand 9 states. [2018-09-30 20:06:56,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:56,005 INFO L93 Difference]: Finished difference Result 962 states and 2211 transitions. [2018-09-30 20:06:56,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 20:06:56,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:06:56,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:56,010 INFO L225 Difference]: With dead ends: 962 [2018-09-30 20:06:56,011 INFO L226 Difference]: Without dead ends: 954 [2018-09-30 20:06:56,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-09-30 20:06:56,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-09-30 20:06:56,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 409. [2018-09-30 20:06:56,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-09-30 20:06:56,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 997 transitions. [2018-09-30 20:06:56,177 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 997 transitions. Word has length 12 [2018-09-30 20:06:56,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:56,178 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 997 transitions. [2018-09-30 20:06:56,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:06:56,178 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 997 transitions. [2018-09-30 20:06:56,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:06:56,179 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:56,179 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:56,179 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:56,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:56,180 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-09-30 20:06:56,180 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:56,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:56,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:56,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:56,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:56,275 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-30 20:06:56,276 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:56,276 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:06:56,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:06:56,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:06:56,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:06:56,277 INFO L87 Difference]: Start difference. First operand 409 states and 997 transitions. Second operand 9 states. [2018-09-30 20:06:58,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:06:58,749 INFO L93 Difference]: Finished difference Result 1000 states and 2329 transitions. [2018-09-30 20:06:58,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 20:06:58,750 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:06:58,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:06:58,756 INFO L225 Difference]: With dead ends: 1000 [2018-09-30 20:06:58,757 INFO L226 Difference]: Without dead ends: 992 [2018-09-30 20:06:58,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-09-30 20:06:58,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-09-30 20:06:58,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 430. [2018-09-30 20:06:58,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-09-30 20:06:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1052 transitions. [2018-09-30 20:06:58,924 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1052 transitions. Word has length 12 [2018-09-30 20:06:58,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:06:58,924 INFO L480 AbstractCegarLoop]: Abstraction has 430 states and 1052 transitions. [2018-09-30 20:06:58,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:06:58,924 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1052 transitions. [2018-09-30 20:06:58,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:06:58,925 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:06:58,925 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:06:58,926 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:06:58,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:06:58,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1320238459, now seen corresponding path program 1 times [2018-09-30 20:06:58,926 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:06:58,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:06:58,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:58,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:06:58,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:06:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:06:59,009 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-30 20:06:59,009 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:06:59,010 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:06:59,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:06:59,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:06:59,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:06:59,011 INFO L87 Difference]: Start difference. First operand 430 states and 1052 transitions. Second operand 9 states. [2018-09-30 20:07:01,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:01,859 INFO L93 Difference]: Finished difference Result 1065 states and 2466 transitions. [2018-09-30 20:07:01,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 20:07:01,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:07:01,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:01,865 INFO L225 Difference]: With dead ends: 1065 [2018-09-30 20:07:01,865 INFO L226 Difference]: Without dead ends: 1057 [2018-09-30 20:07:01,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-09-30 20:07:01,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2018-09-30 20:07:02,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 471. [2018-09-30 20:07:02,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-09-30 20:07:02,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1168 transitions. [2018-09-30 20:07:02,069 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1168 transitions. Word has length 12 [2018-09-30 20:07:02,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:02,069 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 1168 transitions. [2018-09-30 20:07:02,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:07:02,069 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1168 transitions. [2018-09-30 20:07:02,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:07:02,070 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:02,071 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:02,071 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:02,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:02,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1320340604, now seen corresponding path program 1 times [2018-09-30 20:07:02,072 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:02,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:02,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:02,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:02,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:02,184 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-30 20:07:02,185 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:02,185 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:07:02,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:07:02,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:07:02,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:07:02,186 INFO L87 Difference]: Start difference. First operand 471 states and 1168 transitions. Second operand 9 states. [2018-09-30 20:07:05,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:05,568 INFO L93 Difference]: Finished difference Result 1227 states and 2851 transitions. [2018-09-30 20:07:05,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-30 20:07:05,569 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:07:05,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:05,574 INFO L225 Difference]: With dead ends: 1227 [2018-09-30 20:07:05,574 INFO L226 Difference]: Without dead ends: 1219 [2018-09-30 20:07:05,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=365, Invalid=967, Unknown=0, NotChecked=0, Total=1332 [2018-09-30 20:07:05,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-09-30 20:07:05,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 438. [2018-09-30 20:07:05,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-09-30 20:07:05,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1072 transitions. [2018-09-30 20:07:05,788 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1072 transitions. Word has length 12 [2018-09-30 20:07:05,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:05,788 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 1072 transitions. [2018-09-30 20:07:05,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:07:05,788 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1072 transitions. [2018-09-30 20:07:05,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:07:05,789 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:05,789 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:05,789 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:05,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:05,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-09-30 20:07:05,790 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:05,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:05,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:05,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:05,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:05,871 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-30 20:07:05,871 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:05,871 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:07:05,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:07:05,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:07:05,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:07:05,872 INFO L87 Difference]: Start difference. First operand 438 states and 1072 transitions. Second operand 9 states. [2018-09-30 20:07:08,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:08,837 INFO L93 Difference]: Finished difference Result 1076 states and 2511 transitions. [2018-09-30 20:07:08,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 20:07:08,837 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:07:08,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:08,844 INFO L225 Difference]: With dead ends: 1076 [2018-09-30 20:07:08,844 INFO L226 Difference]: Without dead ends: 1068 [2018-09-30 20:07:08,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=807, Unknown=0, NotChecked=0, Total=1122 [2018-09-30 20:07:08,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2018-09-30 20:07:09,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 445. [2018-09-30 20:07:09,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-09-30 20:07:09,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1088 transitions. [2018-09-30 20:07:09,075 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1088 transitions. Word has length 12 [2018-09-30 20:07:09,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:09,076 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 1088 transitions. [2018-09-30 20:07:09,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:07:09,076 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1088 transitions. [2018-09-30 20:07:09,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:07:09,076 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:09,077 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:09,077 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:09,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:09,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1838990990, now seen corresponding path program 1 times [2018-09-30 20:07:09,077 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:09,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:09,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:09,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:09,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:09,175 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-30 20:07:09,175 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:09,175 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:07:09,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:07:09,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:07:09,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:07:09,176 INFO L87 Difference]: Start difference. First operand 445 states and 1088 transitions. Second operand 9 states. [2018-09-30 20:07:11,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:11,754 INFO L93 Difference]: Finished difference Result 1111 states and 2606 transitions. [2018-09-30 20:07:11,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:07:11,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:07:11,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:11,760 INFO L225 Difference]: With dead ends: 1111 [2018-09-30 20:07:11,760 INFO L226 Difference]: Without dead ends: 1103 [2018-09-30 20:07:11,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-09-30 20:07:11,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2018-09-30 20:07:12,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 520. [2018-09-30 20:07:12,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-09-30 20:07:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1295 transitions. [2018-09-30 20:07:12,072 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1295 transitions. Word has length 12 [2018-09-30 20:07:12,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:12,072 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 1295 transitions. [2018-09-30 20:07:12,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:07:12,072 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1295 transitions. [2018-09-30 20:07:12,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:07:12,073 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:12,073 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:12,073 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:12,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:12,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1838888845, now seen corresponding path program 1 times [2018-09-30 20:07:12,073 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:12,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:12,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:12,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:12,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:12,158 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-30 20:07:12,159 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:12,159 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:07:12,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:07:12,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:07:12,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:07:12,160 INFO L87 Difference]: Start difference. First operand 520 states and 1295 transitions. Second operand 9 states. [2018-09-30 20:07:15,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:15,636 INFO L93 Difference]: Finished difference Result 1304 states and 3059 transitions. [2018-09-30 20:07:15,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 20:07:15,638 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:07:15,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:15,643 INFO L225 Difference]: With dead ends: 1304 [2018-09-30 20:07:15,644 INFO L226 Difference]: Without dead ends: 1296 [2018-09-30 20:07:15,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2018-09-30 20:07:15,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-09-30 20:07:15,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 487. [2018-09-30 20:07:15,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-09-30 20:07:15,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1199 transitions. [2018-09-30 20:07:15,954 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1199 transitions. Word has length 12 [2018-09-30 20:07:15,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:15,955 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 1199 transitions. [2018-09-30 20:07:15,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:07:15,955 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1199 transitions. [2018-09-30 20:07:15,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:07:15,955 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:15,956 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:15,956 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:15,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:15,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1731038698, now seen corresponding path program 1 times [2018-09-30 20:07:15,957 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:15,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:15,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:15,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:15,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:16,040 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-30 20:07:16,041 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:16,041 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:07:16,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:07:16,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:07:16,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:07:16,042 INFO L87 Difference]: Start difference. First operand 487 states and 1199 transitions. Second operand 9 states. [2018-09-30 20:07:19,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:19,946 INFO L93 Difference]: Finished difference Result 1370 states and 3217 transitions. [2018-09-30 20:07:19,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 20:07:19,946 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:07:19,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:19,953 INFO L225 Difference]: With dead ends: 1370 [2018-09-30 20:07:19,953 INFO L226 Difference]: Without dead ends: 1362 [2018-09-30 20:07:19,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870 [2018-09-30 20:07:19,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2018-09-30 20:07:20,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 479. [2018-09-30 20:07:20,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-09-30 20:07:20,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1179 transitions. [2018-09-30 20:07:20,293 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1179 transitions. Word has length 12 [2018-09-30 20:07:20,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:20,293 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 1179 transitions. [2018-09-30 20:07:20,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:07:20,293 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1179 transitions. [2018-09-30 20:07:20,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:07:20,294 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:20,295 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:20,295 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:20,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:20,295 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-09-30 20:07:20,296 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:20,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:20,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:20,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:20,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:20,372 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-30 20:07:20,373 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:20,373 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 20:07:20,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:07:20,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:07:20,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:07:20,374 INFO L87 Difference]: Start difference. First operand 479 states and 1179 transitions. Second operand 9 states. [2018-09-30 20:07:23,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:23,255 INFO L93 Difference]: Finished difference Result 1298 states and 3068 transitions. [2018-09-30 20:07:23,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 20:07:23,256 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-30 20:07:23,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:23,261 INFO L225 Difference]: With dead ends: 1298 [2018-09-30 20:07:23,261 INFO L226 Difference]: Without dead ends: 1290 [2018-09-30 20:07:23,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-09-30 20:07:23,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-09-30 20:07:23,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 602. [2018-09-30 20:07:23,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-09-30 20:07:23,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-09-30 20:07:23,697 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-09-30 20:07:23,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:23,697 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-09-30 20:07:23,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:07:23,697 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-09-30 20:07:23,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:07:23,697 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:23,698 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:23,698 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:23,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:23,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1080362888, now seen corresponding path program 1 times [2018-09-30 20:07:23,698 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:23,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:23,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:23,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:23,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:23,929 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-30 20:07:23,929 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:23,930 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:07:23,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:07:23,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:07:23,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-30 20:07:23,930 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-09-30 20:07:24,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:24,825 INFO L93 Difference]: Finished difference Result 1242 states and 3091 transitions. [2018-09-30 20:07:24,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 20:07:24,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-30 20:07:24,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:24,828 INFO L225 Difference]: With dead ends: 1242 [2018-09-30 20:07:24,828 INFO L226 Difference]: Without dead ends: 673 [2018-09-30 20:07:24,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:07:24,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-09-30 20:07:25,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 612. [2018-09-30 20:07:25,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-09-30 20:07:25,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1463 transitions. [2018-09-30 20:07:25,258 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1463 transitions. Word has length 13 [2018-09-30 20:07:25,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:25,258 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 1463 transitions. [2018-09-30 20:07:25,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:07:25,258 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1463 transitions. [2018-09-30 20:07:25,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:07:25,259 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:25,259 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:25,260 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:25,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:25,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1652407871, now seen corresponding path program 1 times [2018-09-30 20:07:25,260 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:25,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:25,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:25,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:25,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:25,364 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-30 20:07:25,364 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:07:25,365 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-30 20:07:25,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:25,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:07:26,490 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-30 20:07:26,518 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:07:26,518 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-30 20:07:26,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 20:07:26,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 20:07:26,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-09-30 20:07:26,519 INFO L87 Difference]: Start difference. First operand 612 states and 1463 transitions. Second operand 16 states. [2018-09-30 20:07:31,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:31,467 INFO L93 Difference]: Finished difference Result 854 states and 1987 transitions. [2018-09-30 20:07:31,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 20:07:31,467 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-09-30 20:07:31,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:31,469 INFO L225 Difference]: With dead ends: 854 [2018-09-30 20:07:31,469 INFO L226 Difference]: Without dead ends: 849 [2018-09-30 20:07:31,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-09-30 20:07:31,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-09-30 20:07:32,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 690. [2018-09-30 20:07:32,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-09-30 20:07:32,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1639 transitions. [2018-09-30 20:07:32,164 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1639 transitions. Word has length 13 [2018-09-30 20:07:32,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:32,164 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1639 transitions. [2018-09-30 20:07:32,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 20:07:32,164 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1639 transitions. [2018-09-30 20:07:32,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:07:32,165 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:32,165 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:32,166 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:32,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:32,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1456173380, now seen corresponding path program 1 times [2018-09-30 20:07:32,166 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:32,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:32,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:32,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:32,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:32,328 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-30 20:07:32,328 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:07:32,328 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:07:32,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:07:32,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:07:32,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-30 20:07:32,329 INFO L87 Difference]: Start difference. First operand 690 states and 1639 transitions. Second operand 5 states. [2018-09-30 20:07:33,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:33,604 INFO L93 Difference]: Finished difference Result 1308 states and 3113 transitions. [2018-09-30 20:07:33,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 20:07:33,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-30 20:07:33,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:33,607 INFO L225 Difference]: With dead ends: 1308 [2018-09-30 20:07:33,607 INFO L226 Difference]: Without dead ends: 709 [2018-09-30 20:07:33,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-30 20:07:33,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-09-30 20:07:34,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 690. [2018-09-30 20:07:34,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-09-30 20:07:34,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-09-30 20:07:34,648 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-09-30 20:07:34,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:34,648 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-09-30 20:07:34,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:07:34,649 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-09-30 20:07:34,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:07:34,650 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:34,650 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:34,650 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:34,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:34,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1952744875, now seen corresponding path program 1 times [2018-09-30 20:07:34,651 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:34,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:34,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:34,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:34,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:35,429 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-30 20:07:35,430 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:07:35,430 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-30 20:07:35,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:35,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:07:36,131 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-30 20:07:36,156 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:07:36,157 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 20:07:36,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 20:07:36,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 20:07:36,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-30 20:07:36,157 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 17 states. [2018-09-30 20:07:43,842 WARN L178 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-30 20:07:49,277 WARN L178 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-30 20:07:52,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:07:52,714 INFO L93 Difference]: Finished difference Result 2011 states and 4412 transitions. [2018-09-30 20:07:52,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-30 20:07:52,715 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 20:07:52,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:07:52,719 INFO L225 Difference]: With dead ends: 2011 [2018-09-30 20:07:52,719 INFO L226 Difference]: Without dead ends: 2003 [2018-09-30 20:07:52,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9561 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=3074, Invalid=22366, Unknown=0, NotChecked=0, Total=25440 [2018-09-30 20:07:52,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2018-09-30 20:07:53,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1151. [2018-09-30 20:07:53,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2018-09-30 20:07:53,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 2622 transitions. [2018-09-30 20:07:53,863 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 2622 transitions. Word has length 16 [2018-09-30 20:07:53,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:07:53,863 INFO L480 AbstractCegarLoop]: Abstraction has 1151 states and 2622 transitions. [2018-09-30 20:07:53,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 20:07:53,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 2622 transitions. [2018-09-30 20:07:53,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:07:53,864 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:07:53,865 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:07:53,865 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:07:53,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:07:53,865 INFO L82 PathProgramCache]: Analyzing trace with hash -51223093, now seen corresponding path program 1 times [2018-09-30 20:07:53,866 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:07:53,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:07:53,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:53,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:53,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:07:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:53,975 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-30 20:07:53,975 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:07:53,975 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:07:53,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:07:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:07:53,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:07:54,151 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-30 20:07:54,172 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:07:54,173 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 20:07:54,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 20:07:54,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 20:07:54,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-30 20:07:54,174 INFO L87 Difference]: Start difference. First operand 1151 states and 2622 transitions. Second operand 17 states. [2018-09-30 20:08:07,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:07,191 INFO L93 Difference]: Finished difference Result 2797 states and 6168 transitions. [2018-09-30 20:08:07,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-09-30 20:08:07,191 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 20:08:07,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:07,199 INFO L225 Difference]: With dead ends: 2797 [2018-09-30 20:08:07,199 INFO L226 Difference]: Without dead ends: 2789 [2018-09-30 20:08:07,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6171 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2430, Invalid=14862, Unknown=0, NotChecked=0, Total=17292 [2018-09-30 20:08:07,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2789 states. [2018-09-30 20:08:08,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2789 to 1186. [2018-09-30 20:08:08,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2018-09-30 20:08:08,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 2705 transitions. [2018-09-30 20:08:08,425 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 2705 transitions. Word has length 16 [2018-09-30 20:08:08,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:08,425 INFO L480 AbstractCegarLoop]: Abstraction has 1186 states and 2705 transitions. [2018-09-30 20:08:08,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 20:08:08,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 2705 transitions. [2018-09-30 20:08:08,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:08:08,426 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:08,426 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:08:08,427 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:08,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:08,427 INFO L82 PathProgramCache]: Analyzing trace with hash -666637335, now seen corresponding path program 1 times [2018-09-30 20:08:08,427 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:08,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:08,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:08,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:08,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:08,600 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-30 20:08:08,600 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:08:08,600 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:08:08,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:08,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:08:08,857 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-30 20:08:08,879 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:08:08,879 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 20:08:08,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 20:08:08,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 20:08:08,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-30 20:08:08,880 INFO L87 Difference]: Start difference. First operand 1186 states and 2705 transitions. Second operand 17 states. [2018-09-30 20:08:20,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:20,584 INFO L93 Difference]: Finished difference Result 2492 states and 5544 transitions. [2018-09-30 20:08:20,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-09-30 20:08:20,585 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 20:08:20,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:20,591 INFO L225 Difference]: With dead ends: 2492 [2018-09-30 20:08:20,592 INFO L226 Difference]: Without dead ends: 2484 [2018-09-30 20:08:20,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4610 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1718, Invalid=11392, Unknown=0, NotChecked=0, Total=13110 [2018-09-30 20:08:20,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2018-09-30 20:08:22,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 1219. [2018-09-30 20:08:22,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1219 states. [2018-09-30 20:08:22,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 2792 transitions. [2018-09-30 20:08:22,023 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 2792 transitions. Word has length 16 [2018-09-30 20:08:22,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:22,023 INFO L480 AbstractCegarLoop]: Abstraction has 1219 states and 2792 transitions. [2018-09-30 20:08:22,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 20:08:22,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 2792 transitions. [2018-09-30 20:08:22,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:08:22,024 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:22,024 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:08:22,025 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:22,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:22,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1212722005, now seen corresponding path program 1 times [2018-09-30 20:08:22,025 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:22,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:22,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:22,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:22,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:22,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:22,105 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:08:22,105 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:08:22,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:22,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:08:22,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:22,315 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 20:08:22,315 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2018-09-30 20:08:22,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 20:08:22,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 20:08:22,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-09-30 20:08:22,316 INFO L87 Difference]: Start difference. First operand 1219 states and 2792 transitions. Second operand 17 states. [2018-09-30 20:08:38,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:38,954 INFO L93 Difference]: Finished difference Result 3178 states and 7226 transitions. [2018-09-30 20:08:38,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-09-30 20:08:38,955 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 20:08:38,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:38,963 INFO L225 Difference]: With dead ends: 3178 [2018-09-30 20:08:38,963 INFO L226 Difference]: Without dead ends: 3170 [2018-09-30 20:08:38,966 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9560 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2932, Invalid=21248, Unknown=0, NotChecked=0, Total=24180 [2018-09-30 20:08:38,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2018-09-30 20:08:40,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 1242. [2018-09-30 20:08:40,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1242 states. [2018-09-30 20:08:40,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 2857 transitions. [2018-09-30 20:08:40,446 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 2857 transitions. Word has length 16 [2018-09-30 20:08:40,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:40,446 INFO L480 AbstractCegarLoop]: Abstraction has 1242 states and 2857 transitions. [2018-09-30 20:08:40,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 20:08:40,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 2857 transitions. [2018-09-30 20:08:40,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:08:40,447 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:40,447 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:08:40,448 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:40,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:40,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1212619860, now seen corresponding path program 1 times [2018-09-30 20:08:40,448 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:40,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:40,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:40,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:40,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:40,566 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:08:40,566 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:08:40,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:40,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:08:40,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:08:40,840 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 20:08:40,840 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2018-09-30 20:08:40,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 20:08:40,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 20:08:40,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-09-30 20:08:40,841 INFO L87 Difference]: Start difference. First operand 1242 states and 2857 transitions. Second operand 17 states. [2018-09-30 20:08:54,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:08:54,157 INFO L93 Difference]: Finished difference Result 2638 states and 5927 transitions. [2018-09-30 20:08:54,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-30 20:08:54,157 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 20:08:54,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:08:54,161 INFO L225 Difference]: With dead ends: 2638 [2018-09-30 20:08:54,161 INFO L226 Difference]: Without dead ends: 2630 [2018-09-30 20:08:54,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5685 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1807, Invalid=13199, Unknown=0, NotChecked=0, Total=15006 [2018-09-30 20:08:54,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2018-09-30 20:08:55,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 1469. [2018-09-30 20:08:55,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2018-09-30 20:08:55,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 3433 transitions. [2018-09-30 20:08:55,795 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 3433 transitions. Word has length 16 [2018-09-30 20:08:55,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:08:55,795 INFO L480 AbstractCegarLoop]: Abstraction has 1469 states and 3433 transitions. [2018-09-30 20:08:55,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 20:08:55,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 3433 transitions. [2018-09-30 20:08:55,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:08:55,796 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:08:55,796 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:08:55,797 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:08:55,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:08:55,797 INFO L82 PathProgramCache]: Analyzing trace with hash 780585054, now seen corresponding path program 1 times [2018-09-30 20:08:55,797 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:08:55,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:08:55,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:55,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:55,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:08:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:55,914 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-30 20:08:55,914 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:08:55,914 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:08:55,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:08:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:08:55,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:08:56,195 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-30 20:08:56,216 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:08:56,216 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 20:08:56,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 20:08:56,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 20:08:56,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-30 20:08:56,217 INFO L87 Difference]: Start difference. First operand 1469 states and 3433 transitions. Second operand 17 states. [2018-09-30 20:09:09,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:09:09,701 INFO L93 Difference]: Finished difference Result 2854 states and 6510 transitions. [2018-09-30 20:09:09,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-30 20:09:09,702 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 20:09:09,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:09:09,705 INFO L225 Difference]: With dead ends: 2854 [2018-09-30 20:09:09,705 INFO L226 Difference]: Without dead ends: 2846 [2018-09-30 20:09:09,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1456, Invalid=7664, Unknown=0, NotChecked=0, Total=9120 [2018-09-30 20:09:09,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2846 states. [2018-09-30 20:09:11,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2846 to 1479. [2018-09-30 20:09:11,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1479 states. [2018-09-30 20:09:11,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 3457 transitions. [2018-09-30 20:09:11,377 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 3457 transitions. Word has length 16 [2018-09-30 20:09:11,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:09:11,377 INFO L480 AbstractCegarLoop]: Abstraction has 1479 states and 3457 transitions. [2018-09-30 20:09:11,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 20:09:11,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 3457 transitions. [2018-09-30 20:09:11,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:09:11,378 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:09:11,378 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:09:11,379 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:09:11,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:09:11,379 INFO L82 PathProgramCache]: Analyzing trace with hash 165170812, now seen corresponding path program 1 times [2018-09-30 20:09:11,379 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:09:11,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:09:11,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:11,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:09:11,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:09:11,493 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-30 20:09:11,493 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:09:11,493 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:09:11,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:09:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:09:11,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:09:11,684 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-30 20:09:11,704 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:09:11,705 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 20:09:11,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 20:09:11,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 20:09:11,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-30 20:09:11,706 INFO L87 Difference]: Start difference. First operand 1479 states and 3457 transitions. Second operand 17 states. [2018-09-30 20:09:26,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:09:26,966 INFO L93 Difference]: Finished difference Result 3363 states and 7697 transitions. [2018-09-30 20:09:26,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-30 20:09:26,966 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 20:09:26,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:09:26,970 INFO L225 Difference]: With dead ends: 3363 [2018-09-30 20:09:26,970 INFO L226 Difference]: Without dead ends: 3355 [2018-09-30 20:09:26,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3712 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1635, Invalid=9495, Unknown=0, NotChecked=0, Total=11130 [2018-09-30 20:09:26,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2018-09-30 20:09:28,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 1535. [2018-09-30 20:09:28,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535 states. [2018-09-30 20:09:28,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 3580 transitions. [2018-09-30 20:09:28,677 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 3580 transitions. Word has length 16 [2018-09-30 20:09:28,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:09:28,677 INFO L480 AbstractCegarLoop]: Abstraction has 1535 states and 3580 transitions. [2018-09-30 20:09:28,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 20:09:28,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 3580 transitions. [2018-09-30 20:09:28,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:09:28,678 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:09:28,678 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:09:28,679 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:09:28,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:09:28,679 INFO L82 PathProgramCache]: Analyzing trace with hash 723989304, now seen corresponding path program 1 times [2018-09-30 20:09:28,679 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:09:28,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:09:28,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:28,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:09:28,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:09:29,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:09:29,444 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:09:29,444 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:09:29,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:09:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:09:29,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:09:29,872 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-30 20:09:29,892 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:09:29,893 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2018-09-30 20:09:29,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 20:09:29,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 20:09:29,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-09-30 20:09:29,894 INFO L87 Difference]: Start difference. First operand 1535 states and 3580 transitions. Second operand 18 states. [2018-09-30 20:09:46,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:09:46,718 INFO L93 Difference]: Finished difference Result 2910 states and 6684 transitions. [2018-09-30 20:09:46,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-30 20:09:46,719 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 16 [2018-09-30 20:09:46,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:09:46,722 INFO L225 Difference]: With dead ends: 2910 [2018-09-30 20:09:46,722 INFO L226 Difference]: Without dead ends: 2902 [2018-09-30 20:09:46,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3369 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1407, Invalid=8693, Unknown=0, NotChecked=0, Total=10100 [2018-09-30 20:09:46,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2018-09-30 20:09:48,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 1226. [2018-09-30 20:09:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2018-09-30 20:09:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 2816 transitions. [2018-09-30 20:09:48,190 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 2816 transitions. Word has length 16 [2018-09-30 20:09:48,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:09:48,191 INFO L480 AbstractCegarLoop]: Abstraction has 1226 states and 2816 transitions. [2018-09-30 20:09:48,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 20:09:48,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 2816 transitions. [2018-09-30 20:09:48,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:09:48,191 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:09:48,191 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:09:48,192 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:09:48,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:09:48,192 INFO L82 PathProgramCache]: Analyzing trace with hash 876461633, now seen corresponding path program 1 times [2018-09-30 20:09:48,192 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:09:48,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:09:48,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:48,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:09:48,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:09:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:09:48,358 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-30 20:09:48,359 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:09:48,359 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:09:48,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:09:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:09:48,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:09:48,732 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-30 20:09:48,753 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:09:48,753 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-30 20:09:48,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 20:09:48,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 20:09:48,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-30 20:09:48,754 INFO L87 Difference]: Start difference. First operand 1226 states and 2816 transitions. Second operand 17 states. [2018-09-30 20:10:02,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:10:02,552 INFO L93 Difference]: Finished difference Result 2474 states and 5593 transitions. [2018-09-30 20:10:02,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-30 20:10:02,552 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 20:10:02,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:10:02,555 INFO L225 Difference]: With dead ends: 2474 [2018-09-30 20:10:02,555 INFO L226 Difference]: Without dead ends: 2466 [2018-09-30 20:10:02,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2722 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1240, Invalid=6950, Unknown=0, NotChecked=0, Total=8190 [2018-09-30 20:10:02,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states. [2018-09-30 20:10:03,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 1069. [2018-09-30 20:10:03,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2018-09-30 20:10:03,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 2444 transitions. [2018-09-30 20:10:03,907 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 2444 transitions. Word has length 16 [2018-09-30 20:10:03,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:10:03,907 INFO L480 AbstractCegarLoop]: Abstraction has 1069 states and 2444 transitions. [2018-09-30 20:10:03,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 20:10:03,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 2444 transitions. [2018-09-30 20:10:03,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:10:03,907 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:10:03,907 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:10:03,908 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:10:03,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:10:03,908 INFO L82 PathProgramCache]: Analyzing trace with hash -345007351, now seen corresponding path program 1 times [2018-09-30 20:10:03,908 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:10:03,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:10:03,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:10:03,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:10:03,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:10:03,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:10:03,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:10:03,980 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:10:03,980 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:10:03,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:10:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:10:03,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:10:04,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:10:04,023 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:10:04,023 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 20:10:04,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:10:04,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:10:04,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:10:04,024 INFO L87 Difference]: Start difference. First operand 1069 states and 2444 transitions. Second operand 8 states. [2018-09-30 20:10:07,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:10:07,631 INFO L93 Difference]: Finished difference Result 1522 states and 3375 transitions. [2018-09-30 20:10:07,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-30 20:10:07,631 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 20:10:07,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:10:07,633 INFO L225 Difference]: With dead ends: 1522 [2018-09-30 20:10:07,633 INFO L226 Difference]: Without dead ends: 1514 [2018-09-30 20:10:07,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-09-30 20:10:07,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2018-09-30 20:10:09,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1225. [2018-09-30 20:10:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-09-30 20:10:09,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 2809 transitions. [2018-09-30 20:10:09,138 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 2809 transitions. Word has length 16 [2018-09-30 20:10:09,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:10:09,139 INFO L480 AbstractCegarLoop]: Abstraction has 1225 states and 2809 transitions. [2018-09-30 20:10:09,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:10:09,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 2809 transitions. [2018-09-30 20:10:09,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:10:09,140 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:10:09,140 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:10:09,140 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:10:09,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:10:09,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521947, now seen corresponding path program 1 times [2018-09-30 20:10:09,141 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:10:09,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:10:09,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:10:09,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:10:09,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:10:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:10:09,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:10:09,278 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:10:09,278 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:10:09,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:10:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:10:09,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:10:09,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:10:09,316 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:10:09,316 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 20:10:09,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:10:09,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:10:09,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:10:09,317 INFO L87 Difference]: Start difference. First operand 1225 states and 2809 transitions. Second operand 8 states. [2018-09-30 20:10:13,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:10:13,137 INFO L93 Difference]: Finished difference Result 1661 states and 3674 transitions. [2018-09-30 20:10:13,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 20:10:13,138 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 20:10:13,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:10:13,140 INFO L225 Difference]: With dead ends: 1661 [2018-09-30 20:10:13,140 INFO L226 Difference]: Without dead ends: 1653 [2018-09-30 20:10:13,141 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-09-30 20:10:13,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2018-09-30 20:10:14,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1237. [2018-09-30 20:10:14,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2018-09-30 20:10:14,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 2833 transitions. [2018-09-30 20:10:14,621 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 2833 transitions. Word has length 16 [2018-09-30 20:10:14,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:10:14,622 INFO L480 AbstractCegarLoop]: Abstraction has 1237 states and 2833 transitions. [2018-09-30 20:10:14,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:10:14,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 2833 transitions. [2018-09-30 20:10:14,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:10:14,622 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:10:14,623 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:10:14,623 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:10:14,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:10:14,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521668, now seen corresponding path program 1 times [2018-09-30 20:10:14,623 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:10:14,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:10:14,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:10:14,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:10:14,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:10:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:10:14,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:10:14,713 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:10:14,713 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:10:14,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:10:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:10:14,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:10:14,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:10:14,754 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:10:14,754 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 20:10:14,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:10:14,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:10:14,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:10:14,754 INFO L87 Difference]: Start difference. First operand 1237 states and 2833 transitions. Second operand 8 states. [2018-09-30 20:10:19,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:10:19,491 INFO L93 Difference]: Finished difference Result 1772 states and 3936 transitions. [2018-09-30 20:10:19,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 20:10:19,492 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-30 20:10:19,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:10:19,494 INFO L225 Difference]: With dead ends: 1772 [2018-09-30 20:10:19,494 INFO L226 Difference]: Without dead ends: 1764 [2018-09-30 20:10:19,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-09-30 20:10:19,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2018-09-30 20:10:21,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1318. [2018-09-30 20:10:21,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1318 states. [2018-09-30 20:10:21,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 3019 transitions. [2018-09-30 20:10:21,080 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 3019 transitions. Word has length 16 [2018-09-30 20:10:21,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:10:21,080 INFO L480 AbstractCegarLoop]: Abstraction has 1318 states and 3019 transitions. [2018-09-30 20:10:21,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:10:21,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 3019 transitions. [2018-09-30 20:10:21,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:10:21,081 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:10:21,081 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:10:21,081 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr8ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:10:21,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:10:21,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1133346772, now seen corresponding path program 1 times [2018-09-30 20:10:21,082 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:10:21,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:10:21,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:10:21,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:10:21,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:10:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:10:21,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:10:21,161 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:10:21,162 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:10:21,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:10:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:10:21,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:10:21,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:10:21,201 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:10:21,201 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 20:10:21,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:10:21,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:10:21,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:10:21,201 INFO L87 Difference]: Start difference. First operand 1318 states and 3019 transitions. Second operand 8 states. Received shutdown request... [2018-09-30 20:10:22,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 20:10:22,984 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 20:10:22,989 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 20:10:22,989 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:10:22 BoogieIcfgContainer [2018-09-30 20:10:22,989 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:10:22,990 INFO L168 Benchmark]: Toolchain (without parser) took 249820.14 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 437.3 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -96.3 MB). Peak memory consumption was 340.9 MB. Max. memory is 7.1 GB. [2018-09-30 20:10:22,992 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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-30 20:10:22,992 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.50 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-30 20:10:22,993 INFO L168 Benchmark]: Boogie Preprocessor took 51.35 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-30 20:10:22,993 INFO L168 Benchmark]: RCFGBuilder took 819.46 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-30 20:10:22,994 INFO L168 Benchmark]: TraceAbstraction took 248898.24 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 437.3 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -128.1 MB). Peak memory consumption was 309.2 MB. Max. memory is 7.1 GB. [2018-09-30 20:10:22,997 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.21 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 44.50 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 51.35 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 819.46 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 248898.24 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 437.3 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -128.1 MB). Peak memory consumption was 309.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 264]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 264). Cancelled while BasicCegarLoop was constructing difference of abstraction (1318states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 240]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 240). Cancelled while BasicCegarLoop was constructing difference of abstraction (1318states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 205]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 205). Cancelled while BasicCegarLoop was constructing difference of abstraction (1318states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 284]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 284). Cancelled while BasicCegarLoop was constructing difference of abstraction (1318states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 247]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 247). Cancelled while BasicCegarLoop was constructing difference of abstraction (1318states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 229]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 229). Cancelled while BasicCegarLoop was constructing difference of abstraction (1318states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 364]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 364). Cancelled while BasicCegarLoop was constructing difference of abstraction (1318states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 294]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 294). Cancelled while BasicCegarLoop was constructing difference of abstraction (1318states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 332]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 332). Cancelled while BasicCegarLoop was constructing difference of abstraction (1318states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 54). Cancelled while BasicCegarLoop was constructing difference of abstraction (1318states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 222]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 222). Cancelled while BasicCegarLoop was constructing difference of abstraction (1318states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 277]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 277). Cancelled while BasicCegarLoop was constructing difference of abstraction (1318states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 250]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 250). Cancelled while BasicCegarLoop was constructing difference of abstraction (1318states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 154). Cancelled while BasicCegarLoop was constructing difference of abstraction (1318states) and FLOYD_HOARE automaton (currently 12 states, 8 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 248.8s OverallTime, 40 OverallIterations, 2 TraceHistogramMax, 213.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11904 SDtfs, 40391 SDslu, 48000 SDs, 0 SdLazy, 117250 SolverSat, 8773 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 107.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1997 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 1697 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 51452 ImplicationChecksByTransitivity, 42.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1535occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 23.4s AutomataMinimizationTime, 39 MinimizatonAttempts, 26099 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 740 NumberOfCodeBlocks, 740 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 686 ConstructedInterpolants, 78 QuantifiedInterpolants, 45030 SizeOfPredicates, 84 NumberOfNonLiveVariables, 555 ConjunctsInSsa, 147 ConjunctsInUnsatCore, 54 InterpolantComputations, 28 PerfectInterpolantSequences, 38/79 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_20-10-23-014.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_20-10-23-014.csv Completed graceful shutdown