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-d19836b [2018-09-26 21:12:08,046 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:12:08,048 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:12:08,060 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:12:08,060 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:12:08,061 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:12:08,063 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:12:08,065 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:12:08,066 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:12:08,067 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:12:08,068 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:12:08,069 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:12:08,070 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:12:08,071 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:12:08,072 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:12:08,073 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:12:08,074 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:12:08,076 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:12:08,078 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:12:08,080 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:12:08,081 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:12:08,082 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:12:08,086 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:12:08,086 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:12:08,086 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:12:08,087 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:12:08,091 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:12:08,093 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:12:08,094 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:12:08,098 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:12:08,098 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:12:08,099 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:12:08,099 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:12:08,099 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:12:08,101 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:12:08,102 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:12:08,104 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-26 21:12:08,133 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:12:08,133 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:12:08,135 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:12:08,135 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:12:08,136 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:12:08,136 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:12:08,136 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:12:08,136 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:12:08,137 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:12:08,137 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:12:08,137 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:12:08,137 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:12:08,138 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:12:08,139 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:12:08,139 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:12:08,139 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:12:08,139 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:12:08,140 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:12:08,141 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:12:08,141 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:12:08,141 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:12:08,141 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:12:08,141 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:12:08,142 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:12:08,142 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:12:08,142 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:12:08,142 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:12:08,143 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:12:08,143 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:12:08,143 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:12:08,188 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:12:08,208 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:12:08,215 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:12:08,217 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:12:08,218 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:12:08,219 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl [2018-09-26 21:12:08,219 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl' [2018-09-26 21:12:08,305 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:12:08,308 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:12:08,309 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:12:08,309 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:12:08,309 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:12:08,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:08" (1/1) ... [2018-09-26 21:12:08,347 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:08" (1/1) ... [2018-09-26 21:12:08,352 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 21:12:08,352 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 21:12:08,352 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 21:12:08,355 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:12:08,356 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:12:08,356 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:12:08,356 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:12:08,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:08" (1/1) ... [2018-09-26 21:12:08,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:08" (1/1) ... [2018-09-26 21:12:08,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:08" (1/1) ... [2018-09-26 21:12:08,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:08" (1/1) ... [2018-09-26 21:12:08,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:08" (1/1) ... [2018-09-26 21:12:08,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:08" (1/1) ... [2018-09-26 21:12:08,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:08" (1/1) ... [2018-09-26 21:12:08,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:12:08,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:12:08,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:12:08,421 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:12:08,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:12:08,496 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-26 21:12:08,496 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-26 21:12:08,497 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-26 21:12:09,403 INFO L343 CfgBuilder]: Using library mode [2018-09-26 21:12:09,404 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:12:09 BoogieIcfgContainer [2018-09-26 21:12:09,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:12:09,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:12:09,405 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:12:09,408 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:12:09,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:12:08" (1/2) ... [2018-09-26 21:12:09,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85d9011 and model type threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:12:09, skipping insertion in model container [2018-09-26 21:12:09,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:12:09" (2/2) ... [2018-09-26 21:12:09,412 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out.bpl [2018-09-26 21:12:09,421 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:12:09,430 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-09-26 21:12:09,477 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:12:09,478 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:12:09,478 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:12:09,478 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:12:09,479 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:12:09,479 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:12:09,479 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:12:09,479 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:12:09,479 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:12:09,501 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-09-26 21:12:09,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 21:12:09,508 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:09,509 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:09,517 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:09,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:09,525 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times [2018-09-26 21:12:09,528 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:09,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:09,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:09,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:09,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:09,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:09,823 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:09,823 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:12:09,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 21:12:09,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 21:12:09,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 21:12:09,849 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states. [2018-09-26 21:12:11,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:11,859 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions. [2018-09-26 21:12:11,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 21:12:11,861 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-26 21:12:11,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:11,878 INFO L225 Difference]: With dead ends: 163 [2018-09-26 21:12:11,878 INFO L226 Difference]: Without dead ends: 158 [2018-09-26 21:12:11,882 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-26 21:12:11,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-26 21:12:11,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93. [2018-09-26 21:12:11,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 21:12:11,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions. [2018-09-26 21:12:11,943 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7 [2018-09-26 21:12:11,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:11,944 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions. [2018-09-26 21:12:11,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 21:12:11,944 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions. [2018-09-26 21:12:11,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 21:12:11,946 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:11,946 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:11,947 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:11,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:11,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times [2018-09-26 21:12:11,947 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:11,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:11,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:11,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:11,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:12,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:12,042 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:12,043 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:12:12,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 21:12:12,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 21:12:12,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 21:12:12,046 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states. [2018-09-26 21:12:12,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:12,967 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions. [2018-09-26 21:12:12,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 21:12:12,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-26 21:12:12,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:12,971 INFO L225 Difference]: With dead ends: 188 [2018-09-26 21:12:12,972 INFO L226 Difference]: Without dead ends: 183 [2018-09-26 21:12:12,973 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-26 21:12:12,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-26 21:12:12,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118. [2018-09-26 21:12:12,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-26 21:12:12,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions. [2018-09-26 21:12:12,997 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7 [2018-09-26 21:12:12,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:12,997 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions. [2018-09-26 21:12:12,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 21:12:12,997 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions. [2018-09-26 21:12:12,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 21:12:12,999 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:12,999 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:13,000 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:13,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:13,000 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times [2018-09-26 21:12:13,000 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:13,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:13,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:13,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:13,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:13,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:13,123 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:13,124 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 21:12:13,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:12:13,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:12:13,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 21:12:13,125 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states. [2018-09-26 21:12:14,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:14,859 INFO L93 Difference]: Finished difference Result 361 states and 808 transitions. [2018-09-26 21:12:14,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 21:12:14,860 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-26 21:12:14,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:14,864 INFO L225 Difference]: With dead ends: 361 [2018-09-26 21:12:14,865 INFO L226 Difference]: Without dead ends: 349 [2018-09-26 21:12:14,866 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-26 21:12:14,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-09-26 21:12:14,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 174. [2018-09-26 21:12:14,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-09-26 21:12:14,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 387 transitions. [2018-09-26 21:12:14,905 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 387 transitions. Word has length 9 [2018-09-26 21:12:14,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:14,906 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 387 transitions. [2018-09-26 21:12:14,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:12:14,906 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 387 transitions. [2018-09-26 21:12:14,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 21:12:14,907 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:14,908 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:14,908 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:14,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:14,909 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times [2018-09-26 21:12:14,909 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:14,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:14,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:14,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:14,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:15,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:15,028 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:15,028 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-26 21:12:15,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 21:12:15,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 21:12:15,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 21:12:15,030 INFO L87 Difference]: Start difference. First operand 174 states and 387 transitions. Second operand 7 states. [2018-09-26 21:12:16,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:16,287 INFO L93 Difference]: Finished difference Result 307 states and 694 transitions. [2018-09-26 21:12:16,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 21:12:16,290 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-09-26 21:12:16,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:16,295 INFO L225 Difference]: With dead ends: 307 [2018-09-26 21:12:16,295 INFO L226 Difference]: Without dead ends: 302 [2018-09-26 21:12:16,296 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-26 21:12:16,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-09-26 21:12:16,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 203. [2018-09-26 21:12:16,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-26 21:12:16,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2018-09-26 21:12:16,338 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9 [2018-09-26 21:12:16,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:16,338 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2018-09-26 21:12:16,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 21:12:16,339 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2018-09-26 21:12:16,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:12:16,341 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:16,341 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:16,342 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:16,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:16,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times [2018-09-26 21:12:16,342 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:16,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:16,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:16,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:16,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:16,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:16,646 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:16,646 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:12:16,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:12:16,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:12:16,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:12:16,648 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 8 states. [2018-09-26 21:12:21,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:21,171 INFO L93 Difference]: Finished difference Result 741 states and 1656 transitions. [2018-09-26 21:12:21,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 21:12:21,172 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:12:21,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:21,177 INFO L225 Difference]: With dead ends: 741 [2018-09-26 21:12:21,178 INFO L226 Difference]: Without dead ends: 733 [2018-09-26 21:12:21,179 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-26 21:12:21,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-09-26 21:12:21,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 315. [2018-09-26 21:12:21,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-09-26 21:12:21,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 743 transitions. [2018-09-26 21:12:21,248 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 743 transitions. Word has length 12 [2018-09-26 21:12:21,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:21,248 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 743 transitions. [2018-09-26 21:12:21,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:12:21,249 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 743 transitions. [2018-09-26 21:12:21,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:12:21,251 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:21,251 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:21,252 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:21,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:21,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times [2018-09-26 21:12:21,252 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:21,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:21,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:21,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:21,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:21,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:21,443 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:21,443 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:12:21,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:12:21,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:12:21,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:12:21,444 INFO L87 Difference]: Start difference. First operand 315 states and 743 transitions. Second operand 8 states. [2018-09-26 21:12:26,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:26,456 INFO L93 Difference]: Finished difference Result 797 states and 1784 transitions. [2018-09-26 21:12:26,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 21:12:26,457 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:12:26,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:26,463 INFO L225 Difference]: With dead ends: 797 [2018-09-26 21:12:26,464 INFO L226 Difference]: Without dead ends: 789 [2018-09-26 21:12:26,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-09-26 21:12:26,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-09-26 21:12:26,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 319. [2018-09-26 21:12:26,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-09-26 21:12:26,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 751 transitions. [2018-09-26 21:12:26,526 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 751 transitions. Word has length 12 [2018-09-26 21:12:26,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:26,526 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 751 transitions. [2018-09-26 21:12:26,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:12:26,527 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 751 transitions. [2018-09-26 21:12:26,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:12:26,528 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:26,528 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:26,529 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:26,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:26,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times [2018-09-26 21:12:26,529 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:26,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:26,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:26,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:26,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:26,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:26,684 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:26,684 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:12:26,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:12:26,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:12:26,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:12:26,685 INFO L87 Difference]: Start difference. First operand 319 states and 751 transitions. Second operand 8 states. [2018-09-26 21:12:28,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:28,513 INFO L93 Difference]: Finished difference Result 684 states and 1538 transitions. [2018-09-26 21:12:28,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 21:12:28,514 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:12:28,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:28,519 INFO L225 Difference]: With dead ends: 684 [2018-09-26 21:12:28,519 INFO L226 Difference]: Without dead ends: 676 [2018-09-26 21:12:28,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-09-26 21:12:28,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2018-09-26 21:12:28,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 330. [2018-09-26 21:12:28,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-09-26 21:12:28,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 778 transitions. [2018-09-26 21:12:28,582 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 778 transitions. Word has length 12 [2018-09-26 21:12:28,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:28,583 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 778 transitions. [2018-09-26 21:12:28,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:12:28,583 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 778 transitions. [2018-09-26 21:12:28,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:12:28,584 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:28,584 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:28,585 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:28,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:28,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times [2018-09-26 21:12:28,585 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:28,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:28,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:28,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:28,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:28,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:28,898 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:28,898 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:12:28,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:12:28,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:12:28,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:12:28,900 INFO L87 Difference]: Start difference. First operand 330 states and 778 transitions. Second operand 8 states. [2018-09-26 21:12:30,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:30,224 INFO L93 Difference]: Finished difference Result 605 states and 1360 transitions. [2018-09-26 21:12:30,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 21:12:30,225 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:12:30,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:30,229 INFO L225 Difference]: With dead ends: 605 [2018-09-26 21:12:30,230 INFO L226 Difference]: Without dead ends: 597 [2018-09-26 21:12:30,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-09-26 21:12:30,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-09-26 21:12:30,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 337. [2018-09-26 21:12:30,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-09-26 21:12:30,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 794 transitions. [2018-09-26 21:12:30,298 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 794 transitions. Word has length 12 [2018-09-26 21:12:30,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:30,298 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 794 transitions. [2018-09-26 21:12:30,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:12:30,299 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 794 transitions. [2018-09-26 21:12:30,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:12:30,300 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:30,300 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:30,300 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:30,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:30,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1088621469, now seen corresponding path program 1 times [2018-09-26 21:12:30,301 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:30,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:30,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:30,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:30,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:30,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:30,395 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:30,395 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:12:30,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:12:30,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:12:30,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:12:30,397 INFO L87 Difference]: Start difference. First operand 337 states and 794 transitions. Second operand 8 states. [2018-09-26 21:12:32,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:32,618 INFO L93 Difference]: Finished difference Result 935 states and 2104 transitions. [2018-09-26 21:12:32,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 21:12:32,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:12:32,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:32,624 INFO L225 Difference]: With dead ends: 935 [2018-09-26 21:12:32,625 INFO L226 Difference]: Without dead ends: 927 [2018-09-26 21:12:32,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2018-09-26 21:12:32,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-09-26 21:12:32,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 343. [2018-09-26 21:12:32,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-09-26 21:12:32,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 808 transitions. [2018-09-26 21:12:32,713 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 808 transitions. Word has length 12 [2018-09-26 21:12:32,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:32,713 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 808 transitions. [2018-09-26 21:12:32,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:12:32,714 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 808 transitions. [2018-09-26 21:12:32,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:12:32,714 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:32,714 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:32,715 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:32,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:32,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1085821115, now seen corresponding path program 1 times [2018-09-26 21:12:32,716 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:32,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:32,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:32,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:32,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:32,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:32,794 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:32,795 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:12:32,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:12:32,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:12:32,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:12:32,795 INFO L87 Difference]: Start difference. First operand 343 states and 808 transitions. Second operand 8 states. [2018-09-26 21:12:34,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:34,821 INFO L93 Difference]: Finished difference Result 923 states and 2061 transitions. [2018-09-26 21:12:34,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 21:12:34,821 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:12:34,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:34,827 INFO L225 Difference]: With dead ends: 923 [2018-09-26 21:12:34,828 INFO L226 Difference]: Without dead ends: 915 [2018-09-26 21:12:34,829 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-26 21:12:34,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-09-26 21:12:34,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 354. [2018-09-26 21:12:34,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-09-26 21:12:34,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 835 transitions. [2018-09-26 21:12:34,919 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 835 transitions. Word has length 12 [2018-09-26 21:12:34,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:34,920 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 835 transitions. [2018-09-26 21:12:34,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:12:34,920 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 835 transitions. [2018-09-26 21:12:34,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:12:34,921 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:34,921 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:34,921 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:34,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:34,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1085923260, now seen corresponding path program 1 times [2018-09-26 21:12:34,922 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:34,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:34,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:34,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:34,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:35,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:35,006 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:35,007 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:12:35,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:12:35,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:12:35,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:12:35,008 INFO L87 Difference]: Start difference. First operand 354 states and 835 transitions. Second operand 8 states. [2018-09-26 21:12:36,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:36,810 INFO L93 Difference]: Finished difference Result 837 states and 1868 transitions. [2018-09-26 21:12:36,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 21:12:36,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:12:36,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:36,816 INFO L225 Difference]: With dead ends: 837 [2018-09-26 21:12:36,816 INFO L226 Difference]: Without dead ends: 829 [2018-09-26 21:12:36,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-09-26 21:12:36,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-09-26 21:12:36,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 339. [2018-09-26 21:12:36,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-09-26 21:12:36,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 800 transitions. [2018-09-26 21:12:36,922 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 800 transitions. Word has length 12 [2018-09-26 21:12:36,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:36,923 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 800 transitions. [2018-09-26 21:12:36,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:12:36,923 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 800 transitions. [2018-09-26 21:12:36,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:12:36,924 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:36,924 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:36,925 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:36,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:36,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1383194877, now seen corresponding path program 1 times [2018-09-26 21:12:36,925 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:36,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:36,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:36,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:36,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:37,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:37,121 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:37,121 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:12:37,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:12:37,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:12:37,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:12:37,122 INFO L87 Difference]: Start difference. First operand 339 states and 800 transitions. Second operand 8 states. [2018-09-26 21:12:39,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:39,351 INFO L93 Difference]: Finished difference Result 996 states and 2227 transitions. [2018-09-26 21:12:39,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 21:12:39,352 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:12:39,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:39,357 INFO L225 Difference]: With dead ends: 996 [2018-09-26 21:12:39,357 INFO L226 Difference]: Without dead ends: 988 [2018-09-26 21:12:39,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 21:12:39,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-09-26 21:12:39,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 381. [2018-09-26 21:12:39,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-26 21:12:39,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions. [2018-09-26 21:12:39,490 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12 [2018-09-26 21:12:39,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:39,492 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions. [2018-09-26 21:12:39,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:12:39,492 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions. [2018-09-26 21:12:39,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:12:39,493 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:39,493 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:39,494 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:39,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:39,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1383297022, now seen corresponding path program 1 times [2018-09-26 21:12:39,494 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:39,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:39,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:39,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:39,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:39,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:39,791 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:39,791 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:12:39,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:12:39,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:12:39,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:12:39,792 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states. [2018-09-26 21:12:41,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:41,796 INFO L93 Difference]: Finished difference Result 913 states and 2034 transitions. [2018-09-26 21:12:41,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 21:12:41,798 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:12:41,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:41,803 INFO L225 Difference]: With dead ends: 913 [2018-09-26 21:12:41,803 INFO L226 Difference]: Without dead ends: 905 [2018-09-26 21:12:41,804 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-26 21:12:41,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-09-26 21:12:41,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 371. [2018-09-26 21:12:41,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-09-26 21:12:41,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 890 transitions. [2018-09-26 21:12:41,944 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 890 transitions. Word has length 12 [2018-09-26 21:12:41,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:41,944 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 890 transitions. [2018-09-26 21:12:41,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:12:41,944 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 890 transitions. [2018-09-26 21:12:41,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:12:41,945 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:41,945 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:41,946 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:41,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:41,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1392211258, now seen corresponding path program 1 times [2018-09-26 21:12:41,947 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:41,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:41,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:41,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:41,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:42,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:42,036 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:42,036 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:12:42,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:12:42,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:12:42,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:12:42,037 INFO L87 Difference]: Start difference. First operand 371 states and 890 transitions. Second operand 8 states. [2018-09-26 21:12:43,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:43,684 INFO L93 Difference]: Finished difference Result 886 states and 2009 transitions. [2018-09-26 21:12:43,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 21:12:43,684 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:12:43,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:43,688 INFO L225 Difference]: With dead ends: 886 [2018-09-26 21:12:43,688 INFO L226 Difference]: Without dead ends: 878 [2018-09-26 21:12:43,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-09-26 21:12:43,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2018-09-26 21:12:43,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 372. [2018-09-26 21:12:43,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-09-26 21:12:43,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 891 transitions. [2018-09-26 21:12:43,808 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 891 transitions. Word has length 12 [2018-09-26 21:12:43,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:43,808 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 891 transitions. [2018-09-26 21:12:43,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:12:43,809 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 891 transitions. [2018-09-26 21:12:43,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:12:43,809 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:43,809 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:43,810 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:43,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:43,810 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times [2018-09-26 21:12:43,810 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:43,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:43,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:43,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:43,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:43,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:43,888 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:43,889 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:12:43,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:12:43,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:12:43,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 21:12:43,890 INFO L87 Difference]: Start difference. First operand 372 states and 891 transitions. Second operand 9 states. [2018-09-26 21:12:45,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:45,788 INFO L93 Difference]: Finished difference Result 801 states and 1838 transitions. [2018-09-26 21:12:45,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 21:12:45,788 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 21:12:45,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:45,793 INFO L225 Difference]: With dead ends: 801 [2018-09-26 21:12:45,794 INFO L226 Difference]: Without dead ends: 793 [2018-09-26 21:12:45,794 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-26 21:12:45,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-09-26 21:12:45,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 393. [2018-09-26 21:12:45,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-09-26 21:12:45,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 949 transitions. [2018-09-26 21:12:45,993 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 949 transitions. Word has length 12 [2018-09-26 21:12:45,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:45,994 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 949 transitions. [2018-09-26 21:12:45,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:12:45,994 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 949 transitions. [2018-09-26 21:12:45,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:12:45,995 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:45,995 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:45,995 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:45,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:45,996 INFO L82 PathProgramCache]: Analyzing trace with hash 192619318, now seen corresponding path program 1 times [2018-09-26 21:12:45,996 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:45,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:45,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:45,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:45,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:46,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:46,707 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:46,708 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:12:46,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:12:46,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:12:46,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 21:12:46,709 INFO L87 Difference]: Start difference. First operand 393 states and 949 transitions. Second operand 9 states. [2018-09-26 21:12:49,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:49,110 INFO L93 Difference]: Finished difference Result 962 states and 2211 transitions. [2018-09-26 21:12:49,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 21:12:49,111 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 21:12:49,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:49,115 INFO L225 Difference]: With dead ends: 962 [2018-09-26 21:12:49,116 INFO L226 Difference]: Without dead ends: 954 [2018-09-26 21:12:49,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2018-09-26 21:12:49,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2018-09-26 21:12:49,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 409. [2018-09-26 21:12:49,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-09-26 21:12:49,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 997 transitions. [2018-09-26 21:12:49,280 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 997 transitions. Word has length 12 [2018-09-26 21:12:49,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:49,280 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 997 transitions. [2018-09-26 21:12:49,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:12:49,280 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 997 transitions. [2018-09-26 21:12:49,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:12:49,281 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:49,281 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:49,281 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:49,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:49,282 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times [2018-09-26 21:12:49,282 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:49,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:49,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:49,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:49,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:49,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:49,366 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:49,367 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:12:49,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:12:49,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:12:49,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 21:12:49,368 INFO L87 Difference]: Start difference. First operand 409 states and 997 transitions. Second operand 9 states. [2018-09-26 21:12:51,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:51,934 INFO L93 Difference]: Finished difference Result 1000 states and 2329 transitions. [2018-09-26 21:12:51,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 21:12:51,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 21:12:51,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:51,941 INFO L225 Difference]: With dead ends: 1000 [2018-09-26 21:12:51,941 INFO L226 Difference]: Without dead ends: 992 [2018-09-26 21:12:51,942 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-26 21:12:51,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-09-26 21:12:52,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 430. [2018-09-26 21:12:52,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-09-26 21:12:52,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1052 transitions. [2018-09-26 21:12:52,129 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1052 transitions. Word has length 12 [2018-09-26 21:12:52,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:52,130 INFO L480 AbstractCegarLoop]: Abstraction has 430 states and 1052 transitions. [2018-09-26 21:12:52,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:12:52,130 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1052 transitions. [2018-09-26 21:12:52,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:12:52,131 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:52,131 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:52,131 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:52,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:52,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1320238459, now seen corresponding path program 1 times [2018-09-26 21:12:52,132 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:52,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:52,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:52,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:52,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:52,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:52,230 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:52,230 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:12:52,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:12:52,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:12:52,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 21:12:52,231 INFO L87 Difference]: Start difference. First operand 430 states and 1052 transitions. Second operand 9 states. [2018-09-26 21:12:54,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:54,969 INFO L93 Difference]: Finished difference Result 1065 states and 2466 transitions. [2018-09-26 21:12:54,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 21:12:54,969 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 21:12:54,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:54,975 INFO L225 Difference]: With dead ends: 1065 [2018-09-26 21:12:54,975 INFO L226 Difference]: Without dead ends: 1057 [2018-09-26 21:12:54,976 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-26 21:12:54,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2018-09-26 21:12:55,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 471. [2018-09-26 21:12:55,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-09-26 21:12:55,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1168 transitions. [2018-09-26 21:12:55,186 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1168 transitions. Word has length 12 [2018-09-26 21:12:55,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:55,186 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 1168 transitions. [2018-09-26 21:12:55,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:12:55,186 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1168 transitions. [2018-09-26 21:12:55,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:12:55,187 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:55,188 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:55,188 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:55,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:55,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1320340604, now seen corresponding path program 1 times [2018-09-26 21:12:55,189 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:55,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:55,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:55,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:55,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:55,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:55,267 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:55,267 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:12:55,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:12:55,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:12:55,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 21:12:55,268 INFO L87 Difference]: Start difference. First operand 471 states and 1168 transitions. Second operand 9 states. [2018-09-26 21:12:58,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:12:58,551 INFO L93 Difference]: Finished difference Result 1227 states and 2851 transitions. [2018-09-26 21:12:58,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 21:12:58,551 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 21:12:58,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:12:58,556 INFO L225 Difference]: With dead ends: 1227 [2018-09-26 21:12:58,556 INFO L226 Difference]: Without dead ends: 1219 [2018-09-26 21:12:58,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=365, Invalid=967, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 21:12:58,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-09-26 21:12:58,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 438. [2018-09-26 21:12:58,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-09-26 21:12:58,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1072 transitions. [2018-09-26 21:12:58,764 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1072 transitions. Word has length 12 [2018-09-26 21:12:58,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:12:58,764 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 1072 transitions. [2018-09-26 21:12:58,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:12:58,764 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1072 transitions. [2018-09-26 21:12:58,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:12:58,764 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:12:58,765 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:12:58,765 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:12:58,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:12:58,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times [2018-09-26 21:12:58,765 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:12:58,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:12:58,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:58,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:12:58,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:12:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:12:58,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:12:58,848 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:12:58,848 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:12:58,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:12:58,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:12:58,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 21:12:58,849 INFO L87 Difference]: Start difference. First operand 438 states and 1072 transitions. Second operand 9 states. [2018-09-26 21:13:01,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:01,770 INFO L93 Difference]: Finished difference Result 1076 states and 2511 transitions. [2018-09-26 21:13:01,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 21:13:01,770 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 21:13:01,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:01,776 INFO L225 Difference]: With dead ends: 1076 [2018-09-26 21:13:01,776 INFO L226 Difference]: Without dead ends: 1068 [2018-09-26 21:13:01,776 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-26 21:13:01,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2018-09-26 21:13:02,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 445. [2018-09-26 21:13:02,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-09-26 21:13:02,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1088 transitions. [2018-09-26 21:13:02,015 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1088 transitions. Word has length 12 [2018-09-26 21:13:02,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:02,015 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 1088 transitions. [2018-09-26 21:13:02,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:13:02,015 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1088 transitions. [2018-09-26 21:13:02,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:13:02,016 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:02,016 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:02,016 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:02,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:02,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1838990990, now seen corresponding path program 1 times [2018-09-26 21:13:02,016 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:02,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:02,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:02,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:02,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:02,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:02,113 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:13:02,114 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:13:02,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:13:02,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:13:02,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 21:13:02,114 INFO L87 Difference]: Start difference. First operand 445 states and 1088 transitions. Second operand 9 states. [2018-09-26 21:13:04,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:04,656 INFO L93 Difference]: Finished difference Result 1111 states and 2606 transitions. [2018-09-26 21:13:04,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 21:13:04,657 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 21:13:04,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:04,662 INFO L225 Difference]: With dead ends: 1111 [2018-09-26 21:13:04,662 INFO L226 Difference]: Without dead ends: 1103 [2018-09-26 21:13:04,663 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-26 21:13:04,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2018-09-26 21:13:04,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 520. [2018-09-26 21:13:04,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-09-26 21:13:04,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1295 transitions. [2018-09-26 21:13:04,985 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1295 transitions. Word has length 12 [2018-09-26 21:13:04,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:04,985 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 1295 transitions. [2018-09-26 21:13:04,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:13:04,985 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1295 transitions. [2018-09-26 21:13:04,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:13:04,986 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:04,986 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:04,986 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:04,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:04,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1838888845, now seen corresponding path program 1 times [2018-09-26 21:13:04,986 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:04,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:04,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:04,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:04,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:05,114 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:13:05,115 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:13:05,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:13:05,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:13:05,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 21:13:05,116 INFO L87 Difference]: Start difference. First operand 520 states and 1295 transitions. Second operand 9 states. [2018-09-26 21:13:08,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:08,578 INFO L93 Difference]: Finished difference Result 1304 states and 3059 transitions. [2018-09-26 21:13:08,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 21:13:08,582 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 21:13:08,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:08,588 INFO L225 Difference]: With dead ends: 1304 [2018-09-26 21:13:08,588 INFO L226 Difference]: Without dead ends: 1296 [2018-09-26 21:13:08,589 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-26 21:13:08,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-09-26 21:13:08,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 487. [2018-09-26 21:13:08,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-09-26 21:13:08,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1199 transitions. [2018-09-26 21:13:08,965 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1199 transitions. Word has length 12 [2018-09-26 21:13:08,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:08,965 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 1199 transitions. [2018-09-26 21:13:08,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:13:08,965 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1199 transitions. [2018-09-26 21:13:08,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:13:08,966 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:08,966 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:08,967 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:08,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:08,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1731038698, now seen corresponding path program 1 times [2018-09-26 21:13:08,967 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:08,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:08,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:08,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:08,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:09,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:09,058 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:13:09,058 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:13:09,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:13:09,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:13:09,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 21:13:09,059 INFO L87 Difference]: Start difference. First operand 487 states and 1199 transitions. Second operand 9 states. [2018-09-26 21:13:12,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:12,868 INFO L93 Difference]: Finished difference Result 1370 states and 3217 transitions. [2018-09-26 21:13:12,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 21:13:12,870 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 21:13:12,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:12,878 INFO L225 Difference]: With dead ends: 1370 [2018-09-26 21:13:12,878 INFO L226 Difference]: Without dead ends: 1362 [2018-09-26 21:13:12,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870 [2018-09-26 21:13:12,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2018-09-26 21:13:13,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 479. [2018-09-26 21:13:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-09-26 21:13:13,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1179 transitions. [2018-09-26 21:13:13,197 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1179 transitions. Word has length 12 [2018-09-26 21:13:13,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:13,197 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 1179 transitions. [2018-09-26 21:13:13,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:13:13,197 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1179 transitions. [2018-09-26 21:13:13,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:13:13,198 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:13,198 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:13,199 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:13,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:13,199 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times [2018-09-26 21:13:13,199 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:13,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:13,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:13,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:13,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:13,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:13,284 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:13:13,284 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-26 21:13:13,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 21:13:13,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 21:13:13,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 21:13:13,286 INFO L87 Difference]: Start difference. First operand 479 states and 1179 transitions. Second operand 9 states. [2018-09-26 21:13:16,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:16,157 INFO L93 Difference]: Finished difference Result 1298 states and 3068 transitions. [2018-09-26 21:13:16,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 21:13:16,157 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-09-26 21:13:16,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:16,162 INFO L225 Difference]: With dead ends: 1298 [2018-09-26 21:13:16,162 INFO L226 Difference]: Without dead ends: 1290 [2018-09-26 21:13:16,163 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-26 21:13:16,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-09-26 21:13:16,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 602. [2018-09-26 21:13:16,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-09-26 21:13:16,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions. [2018-09-26 21:13:16,590 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12 [2018-09-26 21:13:16,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:16,590 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions. [2018-09-26 21:13:16,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 21:13:16,590 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions. [2018-09-26 21:13:16,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 21:13:16,591 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:16,591 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:16,591 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:16,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:16,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1080362888, now seen corresponding path program 1 times [2018-09-26 21:13:16,592 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:16,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:16,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:16,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:16,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:16,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:16,637 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:13:16,637 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:13:16,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:13:16,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:13:16,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 21:13:16,638 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states. [2018-09-26 21:13:17,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:17,601 INFO L93 Difference]: Finished difference Result 1242 states and 3091 transitions. [2018-09-26 21:13:17,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:13:17,601 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-26 21:13:17,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:17,604 INFO L225 Difference]: With dead ends: 1242 [2018-09-26 21:13:17,604 INFO L226 Difference]: Without dead ends: 673 [2018-09-26 21:13:17,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-09-26 21:13:17,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-09-26 21:13:18,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 612. [2018-09-26 21:13:18,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-09-26 21:13:18,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1463 transitions. [2018-09-26 21:13:18,056 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1463 transitions. Word has length 13 [2018-09-26 21:13:18,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:18,056 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 1463 transitions. [2018-09-26 21:13:18,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:13:18,056 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1463 transitions. [2018-09-26 21:13:18,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 21:13:18,057 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:18,057 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:18,058 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:18,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:18,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1652407871, now seen corresponding path program 1 times [2018-09-26 21:13:18,058 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:18,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:18,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:18,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:18,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:18,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:18,157 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:13:18,157 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:13:18,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:18,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:13:18,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-26 21:13:18,879 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:13:18,879 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-26 21:13:18,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 21:13:18,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 21:13:18,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-09-26 21:13:18,880 INFO L87 Difference]: Start difference. First operand 612 states and 1463 transitions. Second operand 16 states. [2018-09-26 21:13:20,474 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-26 21:13:24,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:24,797 INFO L93 Difference]: Finished difference Result 854 states and 1987 transitions. [2018-09-26 21:13:24,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 21:13:24,797 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2018-09-26 21:13:24,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:24,800 INFO L225 Difference]: With dead ends: 854 [2018-09-26 21:13:24,800 INFO L226 Difference]: Without dead ends: 849 [2018-09-26 21:13:24,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-09-26 21:13:24,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-09-26 21:13:25,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 690. [2018-09-26 21:13:25,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-09-26 21:13:25,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1639 transitions. [2018-09-26 21:13:25,766 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1639 transitions. Word has length 13 [2018-09-26 21:13:25,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:25,766 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1639 transitions. [2018-09-26 21:13:25,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 21:13:25,766 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1639 transitions. [2018-09-26 21:13:25,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 21:13:25,767 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:25,767 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:25,768 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:25,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:25,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1456173380, now seen corresponding path program 1 times [2018-09-26 21:13:25,768 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:25,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:25,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:25,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:25,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:25,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:25,917 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:13:25,917 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:13:25,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 21:13:25,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 21:13:25,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 21:13:25,918 INFO L87 Difference]: Start difference. First operand 690 states and 1639 transitions. Second operand 5 states. [2018-09-26 21:13:26,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:26,852 INFO L93 Difference]: Finished difference Result 1308 states and 3113 transitions. [2018-09-26 21:13:26,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:13:26,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-09-26 21:13:26,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:26,854 INFO L225 Difference]: With dead ends: 1308 [2018-09-26 21:13:26,854 INFO L226 Difference]: Without dead ends: 709 [2018-09-26 21:13:26,855 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-26 21:13:26,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-09-26 21:13:27,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 690. [2018-09-26 21:13:27,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-09-26 21:13:27,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions. [2018-09-26 21:13:27,517 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13 [2018-09-26 21:13:27,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:27,517 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions. [2018-09-26 21:13:27,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 21:13:27,517 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions. [2018-09-26 21:13:27,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:13:27,518 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:27,518 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:27,518 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:27,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:27,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1952744875, now seen corresponding path program 1 times [2018-09-26 21:13:27,519 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:27,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:27,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:27,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:27,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:28,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:28,157 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:13:28,157 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:13:28,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:28,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:13:28,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:28,426 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:13:28,427 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-26 21:13:28,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 21:13:28,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 21:13:28,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-26 21:13:28,427 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 17 states. [2018-09-26 21:13:35,931 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-26 21:13:38,678 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-26 21:13:40,992 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-26 21:13:44,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:44,357 INFO L93 Difference]: Finished difference Result 2011 states and 4412 transitions. [2018-09-26 21:13:44,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-26 21:13:44,358 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-26 21:13:44,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:44,361 INFO L225 Difference]: With dead ends: 2011 [2018-09-26 21:13:44,361 INFO L226 Difference]: Without dead ends: 2003 [2018-09-26 21:13:44,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9561 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=3074, Invalid=22366, Unknown=0, NotChecked=0, Total=25440 [2018-09-26 21:13:44,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2018-09-26 21:13:45,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1151. [2018-09-26 21:13:45,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2018-09-26 21:13:45,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 2622 transitions. [2018-09-26 21:13:45,510 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 2622 transitions. Word has length 16 [2018-09-26 21:13:45,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:45,510 INFO L480 AbstractCegarLoop]: Abstraction has 1151 states and 2622 transitions. [2018-09-26 21:13:45,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 21:13:45,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 2622 transitions. [2018-09-26 21:13:45,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:13:45,511 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:45,512 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:45,512 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:45,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:45,512 INFO L82 PathProgramCache]: Analyzing trace with hash -51223093, now seen corresponding path program 1 times [2018-09-26 21:13:45,512 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:45,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:45,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:45,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:45,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:45,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:45,618 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:13:45,618 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-26 21:13:45,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:45,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:13:45,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:45,835 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:13:45,835 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-26 21:13:45,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 21:13:45,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 21:13:45,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-26 21:13:45,836 INFO L87 Difference]: Start difference. First operand 1151 states and 2622 transitions. Second operand 17 states. [2018-09-26 21:13:58,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:13:58,626 INFO L93 Difference]: Finished difference Result 2797 states and 6168 transitions. [2018-09-26 21:13:58,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-09-26 21:13:58,626 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-26 21:13:58,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:13:58,632 INFO L225 Difference]: With dead ends: 2797 [2018-09-26 21:13:58,632 INFO L226 Difference]: Without dead ends: 2789 [2018-09-26 21:13:58,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6171 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2430, Invalid=14862, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 21:13:58,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2789 states. [2018-09-26 21:13:59,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2789 to 1186. [2018-09-26 21:13:59,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2018-09-26 21:13:59,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 2705 transitions. [2018-09-26 21:13:59,905 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 2705 transitions. Word has length 16 [2018-09-26 21:13:59,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:13:59,905 INFO L480 AbstractCegarLoop]: Abstraction has 1186 states and 2705 transitions. [2018-09-26 21:13:59,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 21:13:59,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 2705 transitions. [2018-09-26 21:13:59,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:13:59,906 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:13:59,906 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:13:59,906 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:13:59,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:13:59,907 INFO L82 PathProgramCache]: Analyzing trace with hash -666637335, now seen corresponding path program 1 times [2018-09-26 21:13:59,907 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:13:59,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:13:59,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:59,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:13:59,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:13:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:13:59,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:13:59,996 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:13:59,996 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-26 21:14:00,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:14:00,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:00,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:14:00,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:14:00,281 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:14:00,282 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-26 21:14:00,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 21:14:00,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 21:14:00,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-26 21:14:00,283 INFO L87 Difference]: Start difference. First operand 1186 states and 2705 transitions. Second operand 17 states. [2018-09-26 21:14:11,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:14:11,848 INFO L93 Difference]: Finished difference Result 2492 states and 5544 transitions. [2018-09-26 21:14:11,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-09-26 21:14:11,849 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-26 21:14:11,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:14:11,855 INFO L225 Difference]: With dead ends: 2492 [2018-09-26 21:14:11,855 INFO L226 Difference]: Without dead ends: 2484 [2018-09-26 21:14:11,860 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-26 21:14:11,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2018-09-26 21:14:13,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 1219. [2018-09-26 21:14:13,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1219 states. [2018-09-26 21:14:13,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 2792 transitions. [2018-09-26 21:14:13,825 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 2792 transitions. Word has length 16 [2018-09-26 21:14:13,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:14:13,825 INFO L480 AbstractCegarLoop]: Abstraction has 1219 states and 2792 transitions. [2018-09-26 21:14:13,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 21:14:13,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 2792 transitions. [2018-09-26 21:14:13,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:14:13,826 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:14:13,826 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:14:13,826 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:14:13,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:14:13,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1212722005, now seen corresponding path program 1 times [2018-09-26 21:14:13,827 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:14:13,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:14:13,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:13,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:14:13,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:13,922 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-26 21:14:13,923 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:14:13,923 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-26 21:14:13,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:14:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:13,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:14:14,112 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-26 21:14:14,132 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-26 21:14:14,132 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2018-09-26 21:14:14,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 21:14:14,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 21:14:14,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-09-26 21:14:14,133 INFO L87 Difference]: Start difference. First operand 1219 states and 2792 transitions. Second operand 17 states. [2018-09-26 21:14:30,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:14:30,699 INFO L93 Difference]: Finished difference Result 3178 states and 7226 transitions. [2018-09-26 21:14:30,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-09-26 21:14:30,699 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-26 21:14:30,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:14:30,707 INFO L225 Difference]: With dead ends: 3178 [2018-09-26 21:14:30,707 INFO L226 Difference]: Without dead ends: 3170 [2018-09-26 21:14:30,710 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9560 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2932, Invalid=21248, Unknown=0, NotChecked=0, Total=24180 [2018-09-26 21:14:30,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2018-09-26 21:14:31,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 1242. [2018-09-26 21:14:31,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1242 states. [2018-09-26 21:14:32,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 2857 transitions. [2018-09-26 21:14:32,001 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 2857 transitions. Word has length 16 [2018-09-26 21:14:32,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:14:32,001 INFO L480 AbstractCegarLoop]: Abstraction has 1242 states and 2857 transitions. [2018-09-26 21:14:32,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 21:14:32,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 2857 transitions. [2018-09-26 21:14:32,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:14:32,002 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:14:32,002 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:14:32,003 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:14:32,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:14:32,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1212619860, now seen corresponding path program 1 times [2018-09-26 21:14:32,003 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:14:32,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:14:32,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:32,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:14:32,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:32,119 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-26 21:14:32,119 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:14:32,120 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-26 21:14:32,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:14:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:32,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:14:32,278 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-26 21:14:32,310 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-26 21:14:32,310 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2018-09-26 21:14:32,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 21:14:32,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 21:14:32,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-09-26 21:14:32,311 INFO L87 Difference]: Start difference. First operand 1242 states and 2857 transitions. Second operand 17 states. [2018-09-26 21:14:45,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:14:45,618 INFO L93 Difference]: Finished difference Result 2638 states and 5927 transitions. [2018-09-26 21:14:45,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-26 21:14:45,619 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-26 21:14:45,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:14:45,624 INFO L225 Difference]: With dead ends: 2638 [2018-09-26 21:14:45,624 INFO L226 Difference]: Without dead ends: 2630 [2018-09-26 21:14:45,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5685 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1807, Invalid=13199, Unknown=0, NotChecked=0, Total=15006 [2018-09-26 21:14:45,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2018-09-26 21:14:47,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 1469. [2018-09-26 21:14:47,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2018-09-26 21:14:47,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 3433 transitions. [2018-09-26 21:14:47,393 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 3433 transitions. Word has length 16 [2018-09-26 21:14:47,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:14:47,394 INFO L480 AbstractCegarLoop]: Abstraction has 1469 states and 3433 transitions. [2018-09-26 21:14:47,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 21:14:47,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 3433 transitions. [2018-09-26 21:14:47,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:14:47,395 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:14:47,395 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:14:47,395 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:14:47,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:14:47,396 INFO L82 PathProgramCache]: Analyzing trace with hash 780585054, now seen corresponding path program 1 times [2018-09-26 21:14:47,396 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:14:47,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:14:47,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:47,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:14:47,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:14:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:47,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:14:47,698 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:14:47,699 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-26 21:14:47,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:14:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:14:47,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:14:47,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:14:47,861 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:14:47,861 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-26 21:14:47,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 21:14:47,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 21:14:47,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-26 21:14:47,862 INFO L87 Difference]: Start difference. First operand 1469 states and 3433 transitions. Second operand 17 states. [2018-09-26 21:15:01,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:15:01,223 INFO L93 Difference]: Finished difference Result 2854 states and 6510 transitions. [2018-09-26 21:15:01,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 21:15:01,224 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-26 21:15:01,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:15:01,227 INFO L225 Difference]: With dead ends: 2854 [2018-09-26 21:15:01,227 INFO L226 Difference]: Without dead ends: 2846 [2018-09-26 21:15:01,228 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-26 21:15:01,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2846 states. [2018-09-26 21:15:02,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2846 to 1479. [2018-09-26 21:15:02,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1479 states. [2018-09-26 21:15:02,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 3457 transitions. [2018-09-26 21:15:02,831 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 3457 transitions. Word has length 16 [2018-09-26 21:15:02,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:15:02,831 INFO L480 AbstractCegarLoop]: Abstraction has 1479 states and 3457 transitions. [2018-09-26 21:15:02,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 21:15:02,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 3457 transitions. [2018-09-26 21:15:02,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:15:02,832 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:15:02,832 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:15:02,833 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:15:02,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:15:02,833 INFO L82 PathProgramCache]: Analyzing trace with hash 165170812, now seen corresponding path program 1 times [2018-09-26 21:15:02,833 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:15:02,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:15:02,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:02,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:15:02,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:02,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:15:02,918 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:15:02,918 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-26 21:15:02,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:15:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:02,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:15:03,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:15:03,149 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:15:03,150 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-26 21:15:03,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 21:15:03,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 21:15:03,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-26 21:15:03,150 INFO L87 Difference]: Start difference. First operand 1479 states and 3457 transitions. Second operand 17 states. [2018-09-26 21:15:18,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:15:18,346 INFO L93 Difference]: Finished difference Result 3363 states and 7697 transitions. [2018-09-26 21:15:18,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 21:15:18,346 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-26 21:15:18,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:15:18,350 INFO L225 Difference]: With dead ends: 3363 [2018-09-26 21:15:18,350 INFO L226 Difference]: Without dead ends: 3355 [2018-09-26 21:15:18,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3712 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1635, Invalid=9495, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 21:15:18,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2018-09-26 21:15:20,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 1535. [2018-09-26 21:15:20,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535 states. [2018-09-26 21:15:20,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 3580 transitions. [2018-09-26 21:15:20,019 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 3580 transitions. Word has length 16 [2018-09-26 21:15:20,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:15:20,019 INFO L480 AbstractCegarLoop]: Abstraction has 1535 states and 3580 transitions. [2018-09-26 21:15:20,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 21:15:20,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 3580 transitions. [2018-09-26 21:15:20,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:15:20,020 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:15:20,020 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:15:20,021 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:15:20,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:15:20,021 INFO L82 PathProgramCache]: Analyzing trace with hash 723989304, now seen corresponding path program 1 times [2018-09-26 21:15:20,021 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:15:20,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:15:20,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:20,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:15:20,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:20,317 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-26 21:15:20,317 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:15:20,317 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-26 21:15:20,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:15:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:20,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:15:20,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:15:20,532 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:15:20,532 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2018-09-26 21:15:20,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 21:15:20,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 21:15:20,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-09-26 21:15:20,533 INFO L87 Difference]: Start difference. First operand 1535 states and 3580 transitions. Second operand 18 states. [2018-09-26 21:15:36,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:15:36,968 INFO L93 Difference]: Finished difference Result 2910 states and 6684 transitions. [2018-09-26 21:15:36,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 21:15:36,968 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 16 [2018-09-26 21:15:36,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:15:36,972 INFO L225 Difference]: With dead ends: 2910 [2018-09-26 21:15:36,972 INFO L226 Difference]: Without dead ends: 2902 [2018-09-26 21:15:36,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3369 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1407, Invalid=8693, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 21:15:36,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2018-09-26 21:15:38,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 1226. [2018-09-26 21:15:38,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2018-09-26 21:15:38,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 2816 transitions. [2018-09-26 21:15:38,360 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 2816 transitions. Word has length 16 [2018-09-26 21:15:38,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:15:38,360 INFO L480 AbstractCegarLoop]: Abstraction has 1226 states and 2816 transitions. [2018-09-26 21:15:38,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 21:15:38,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 2816 transitions. [2018-09-26 21:15:38,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:15:38,361 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:15:38,361 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:15:38,361 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:15:38,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:15:38,361 INFO L82 PathProgramCache]: Analyzing trace with hash 876461633, now seen corresponding path program 1 times [2018-09-26 21:15:38,362 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:15:38,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:15:38,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:38,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:15:38,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:38,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:15:38,447 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:15:38,447 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-26 21:15:38,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:15:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:38,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:15:38,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:15:38,669 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:15:38,669 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-09-26 21:15:38,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 21:15:38,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 21:15:38,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-09-26 21:15:38,670 INFO L87 Difference]: Start difference. First operand 1226 states and 2816 transitions. Second operand 17 states. [2018-09-26 21:15:52,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:15:52,429 INFO L93 Difference]: Finished difference Result 2474 states and 5593 transitions. [2018-09-26 21:15:52,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 21:15:52,429 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-26 21:15:52,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:15:52,432 INFO L225 Difference]: With dead ends: 2474 [2018-09-26 21:15:52,432 INFO L226 Difference]: Without dead ends: 2466 [2018-09-26 21:15:52,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2722 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1240, Invalid=6950, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 21:15:52,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states. [2018-09-26 21:15:53,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 1069. [2018-09-26 21:15:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2018-09-26 21:15:53,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 2444 transitions. [2018-09-26 21:15:53,722 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 2444 transitions. Word has length 16 [2018-09-26 21:15:53,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:15:53,722 INFO L480 AbstractCegarLoop]: Abstraction has 1069 states and 2444 transitions. [2018-09-26 21:15:53,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 21:15:53,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 2444 transitions. [2018-09-26 21:15:53,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:15:53,723 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:15:53,723 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:15:53,723 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:15:53,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:15:53,724 INFO L82 PathProgramCache]: Analyzing trace with hash -345007351, now seen corresponding path program 1 times [2018-09-26 21:15:53,724 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:15:53,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:15:53,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:53,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:15:53,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:53,792 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-26 21:15:53,793 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:15:53,793 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-26 21:15:53,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:15:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:53,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:15:53,810 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-26 21:15:53,833 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:15:53,833 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-26 21:15:53,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:15:53,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:15:53,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:15:53,834 INFO L87 Difference]: Start difference. First operand 1069 states and 2444 transitions. Second operand 8 states. [2018-09-26 21:15:57,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:15:57,322 INFO L93 Difference]: Finished difference Result 1522 states and 3375 transitions. [2018-09-26 21:15:57,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 21:15:57,323 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 21:15:57,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:15:57,325 INFO L225 Difference]: With dead ends: 1522 [2018-09-26 21:15:57,325 INFO L226 Difference]: Without dead ends: 1514 [2018-09-26 21:15:57,325 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-26 21:15:57,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2018-09-26 21:15:58,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1225. [2018-09-26 21:15:58,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-09-26 21:15:58,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 2809 transitions. [2018-09-26 21:15:58,831 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 2809 transitions. Word has length 16 [2018-09-26 21:15:58,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:15:58,832 INFO L480 AbstractCegarLoop]: Abstraction has 1225 states and 2809 transitions. [2018-09-26 21:15:58,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:15:58,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 2809 transitions. [2018-09-26 21:15:58,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:15:58,833 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:15:58,833 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:15:58,833 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:15:58,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:15:58,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521947, now seen corresponding path program 1 times [2018-09-26 21:15:58,834 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:15:58,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:15:58,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:58,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:15:58,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:15:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:58,931 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-26 21:15:58,931 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:15:58,932 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-26 21:15:58,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:15:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:15:58,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:15:58,950 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-26 21:15:58,972 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:15:58,972 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-26 21:15:58,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:15:58,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:15:58,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:15:58,973 INFO L87 Difference]: Start difference. First operand 1225 states and 2809 transitions. Second operand 8 states. [2018-09-26 21:16:02,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:16:02,856 INFO L93 Difference]: Finished difference Result 1661 states and 3674 transitions. [2018-09-26 21:16:02,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 21:16:02,856 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 21:16:02,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:16:02,858 INFO L225 Difference]: With dead ends: 1661 [2018-09-26 21:16:02,858 INFO L226 Difference]: Without dead ends: 1653 [2018-09-26 21:16:02,859 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-26 21:16:02,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2018-09-26 21:16:04,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1237. [2018-09-26 21:16:04,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2018-09-26 21:16:04,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 2833 transitions. [2018-09-26 21:16:04,465 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 2833 transitions. Word has length 16 [2018-09-26 21:16:04,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:16:04,465 INFO L480 AbstractCegarLoop]: Abstraction has 1237 states and 2833 transitions. [2018-09-26 21:16:04,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:16:04,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 2833 transitions. [2018-09-26 21:16:04,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:16:04,466 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:16:04,466 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:16:04,466 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:16:04,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:16:04,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521668, now seen corresponding path program 1 times [2018-09-26 21:16:04,467 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:16:04,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:16:04,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:16:04,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:16:04,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:16:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:16:04,536 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-26 21:16:04,536 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:16:04,536 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-26 21:16:04,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:16:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:16:04,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:16:04,556 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-26 21:16:04,583 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:16:04,583 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-26 21:16:04,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:16:04,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:16:04,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:16:04,584 INFO L87 Difference]: Start difference. First operand 1237 states and 2833 transitions. Second operand 8 states. [2018-09-26 21:16:09,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:16:09,140 INFO L93 Difference]: Finished difference Result 1772 states and 3936 transitions. [2018-09-26 21:16:09,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 21:16:09,140 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 21:16:09,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:16:09,142 INFO L225 Difference]: With dead ends: 1772 [2018-09-26 21:16:09,142 INFO L226 Difference]: Without dead ends: 1764 [2018-09-26 21:16:09,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-09-26 21:16:09,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2018-09-26 21:16:10,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1318. [2018-09-26 21:16:10,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1318 states. [2018-09-26 21:16:10,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 3019 transitions. [2018-09-26 21:16:10,643 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 3019 transitions. Word has length 16 [2018-09-26 21:16:10,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:16:10,644 INFO L480 AbstractCegarLoop]: Abstraction has 1318 states and 3019 transitions. [2018-09-26 21:16:10,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:16:10,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 3019 transitions. [2018-09-26 21:16:10,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:16:10,644 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:16:10,644 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:16:10,644 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:16:10,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:16:10,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1133346772, now seen corresponding path program 1 times [2018-09-26 21:16:10,645 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:16:10,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:16:10,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:16:10,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:16:10,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:16:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:16:10,767 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-26 21:16:10,767 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:16:10,767 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-26 21:16:10,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:16:10,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:16:10,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:16:10,784 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-26 21:16:10,805 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:16:10,805 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-26 21:16:10,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:16:10,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:16:10,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:16:10,806 INFO L87 Difference]: Start difference. First operand 1318 states and 3019 transitions. Second operand 8 states. [2018-09-26 21:16:14,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:16:14,903 INFO L93 Difference]: Finished difference Result 1789 states and 3956 transitions. [2018-09-26 21:16:14,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 21:16:14,903 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-09-26 21:16:14,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:16:14,905 INFO L225 Difference]: With dead ends: 1789 [2018-09-26 21:16:14,905 INFO L226 Difference]: Without dead ends: 1781 [2018-09-26 21:16:14,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-09-26 21:16:14,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2018-09-26 21:16:16,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1345. [2018-09-26 21:16:16,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1345 states. [2018-09-26 21:16:16,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 3076 transitions. [2018-09-26 21:16:16,568 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 3076 transitions. Word has length 16 [2018-09-26 21:16:16,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:16:16,568 INFO L480 AbstractCegarLoop]: Abstraction has 1345 states and 3076 transitions. [2018-09-26 21:16:16,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:16:16,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 3076 transitions. [2018-09-26 21:16:16,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:16:16,569 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:16:16,569 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:16:16,569 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:16:16,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:16:16,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1133347051, now seen corresponding path program 1 times [2018-09-26 21:16:16,569 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:16:16,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:16:16,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:16:16,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:16:16,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:16:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:16:16,653 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-26 21:16:16,654 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:16:16,654 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:16:16,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:16:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:16:16,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:16:16,673 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-26 21:16:16,693 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:16:16,693 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-26 21:16:16,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:16:16,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:16:16,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:16:16,696 INFO L87 Difference]: Start difference. First operand 1345 states and 3076 transitions. Second operand 8 states. Received shutdown request... [2018-09-26 21:16:20,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 21:16:20,405 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 21:16:20,410 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 21:16:20,411 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:16:20 BoogieIcfgContainer [2018-09-26 21:16:20,411 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:16:20,411 INFO L168 Benchmark]: Toolchain (without parser) took 252106.08 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 548.9 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -402.1 MB). Peak memory consumption was 146.8 MB. Max. memory is 7.1 GB. [2018-09-26 21:16:20,412 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:16:20,413 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.40 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:16:20,413 INFO L168 Benchmark]: Boogie Preprocessor took 64.58 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:16:20,413 INFO L168 Benchmark]: RCFGBuilder took 983.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-26 21:16:20,414 INFO L168 Benchmark]: TraceAbstraction took 251006.05 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 548.9 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -433.8 MB). Peak memory consumption was 115.1 MB. Max. memory is 7.1 GB. [2018-09-26 21:16:20,417 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 46.40 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.58 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 983.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 251006.05 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 548.9 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -433.8 MB). Peak memory consumption was 115.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 54). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 20 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1177 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 277]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 277). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 20 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1177 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 294]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 294). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 20 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1177 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 284]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 284). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 20 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1177 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 154). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 20 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1177 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 205]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 205). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 20 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1177 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 264]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 264). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 20 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1177 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 229]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 229). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 20 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1177 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 332]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 332). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 20 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1177 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 222]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 222). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 20 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1177 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 364]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 364). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 20 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1177 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 250]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 250). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 20 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1177 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 240]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 240). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 20 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1177 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 247]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 247). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 20 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (1177 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 250.9s OverallTime, 41 OverallIterations, 2 TraceHistogramMax, 215.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12345 SDtfs, 41135 SDslu, 49305 SDs, 0 SdLazy, 119463 SolverSat, 8879 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 108.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2038 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 1720 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 51542 ImplicationChecksByTransitivity, 39.7s 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: 25.4s AutomataMinimizationTime, 40 MinimizatonAttempts, 26535 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 772 NumberOfCodeBlocks, 772 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 716 ConstructedInterpolants, 78 QuantifiedInterpolants, 46500 SizeOfPredicates, 88 NumberOfNonLiveVariables, 595 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 56 InterpolantComputations, 28 PerfectInterpolantSequences, 40/83 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_21-16-20-428.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-26_21-16-20-428.csv Completed graceful shutdown