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-9f4048f
[2018-10-04 12:13:51,891 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-10-04 12:13:51,893 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-10-04 12:13:51,905 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-10-04 12:13:51,905 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-10-04 12:13:51,907 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-10-04 12:13:51,908 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-10-04 12:13:51,910 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-10-04 12:13:51,912 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-10-04 12:13:51,912 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-10-04 12:13:51,913 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-10-04 12:13:51,914 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-10-04 12:13:51,915 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-10-04 12:13:51,916 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-10-04 12:13:51,917 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-10-04 12:13:51,918 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-10-04 12:13:51,919 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-10-04 12:13:51,921 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-10-04 12:13:51,923 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-10-04 12:13:51,924 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-10-04 12:13:51,926 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-10-04 12:13:51,927 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-10-04 12:13:51,930 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-10-04 12:13:51,930 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-10-04 12:13:51,930 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-10-04 12:13:51,931 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-10-04 12:13:51,932 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-10-04 12:13:51,933 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-10-04 12:13:51,934 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-10-04 12:13:51,935 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-10-04 12:13:51,935 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-10-04 12:13:51,936 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-10-04 12:13:51,936 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-10-04 12:13:51,937 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values
[2018-10-04 12:13:51,938 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-10-04 12:13:51,938 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-10-04 12:13:51,939 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-10-04 12:13:51,954 INFO L110 SettingsManager]: Loading preferences was successful
[2018-10-04 12:13:51,954 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-10-04 12:13:51,955 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-10-04 12:13:51,955 INFO L133 SettingsManager]: * to procedures, called more than once=true
[2018-10-04 12:13:51,956 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-10-04 12:13:51,956 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2018-10-04 12:13:51,956 INFO L133 SettingsManager]: * Use SBE=true
[2018-10-04 12:13:51,956 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-10-04 12:13:51,956 INFO L133 SettingsManager]: * sizeof long=4
[2018-10-04 12:13:51,957 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-10-04 12:13:51,957 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-10-04 12:13:51,957 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-10-04 12:13:51,957 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2018-10-04 12:13:51,957 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-10-04 12:13:51,958 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2018-10-04 12:13:51,958 INFO L133 SettingsManager]: * sizeof long double=12
[2018-10-04 12:13:51,958 INFO L133 SettingsManager]: * Check if freed pointer was valid=false
[2018-10-04 12:13:51,958 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2018-10-04 12:13:51,958 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-10-04 12:13:51,959 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2018-10-04 12:13:51,959 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-10-04 12:13:51,959 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-10-04 12:13:51,959 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-10-04 12:13:51,959 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-10-04 12:13:51,960 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-10-04 12:13:51,960 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-10-04 12:13:51,960 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL
[2018-10-04 12:13:51,960 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2018-10-04 12:13:51,961 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-10-04 12:13:51,961 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-10-04 12:13:52,031 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-10-04 12:13:52,050 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-10-04 12:13:52,056 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-10-04 12:13:52,058 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser...
[2018-10-04 12:13:52,059 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized
[2018-10-04 12:13:52,060 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl
[2018-10-04 12:13:52,060 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out.bpl'
[2018-10-04 12:13:52,145 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-10-04 12:13:52,147 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-10-04 12:13:52,148 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2018-10-04 12:13:52,148 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2018-10-04 12:13:52,148 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized
[2018-10-04 12:13:52,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:52" (1/1) ...
[2018-10-04 12:13:52,186 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:52" (1/1) ...
[2018-10-04 12:13:52,192 WARN L165 Inliner]: Program contained no entry procedure!
[2018-10-04 12:13:52,192 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start]
[2018-10-04 12:13:52,192 WARN L175 Inliner]: Fallback enabled. All procedures will be processed.
[2018-10-04 12:13:52,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2018-10-04 12:13:52,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-10-04 12:13:52,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-10-04 12:13:52,196 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-10-04 12:13:52,208 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:52" (1/1) ...
[2018-10-04 12:13:52,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:52" (1/1) ...
[2018-10-04 12:13:52,214 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:52" (1/1) ...
[2018-10-04 12:13:52,214 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:52" (1/1) ...
[2018-10-04 12:13:52,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:52" (1/1) ...
[2018-10-04 12:13:52,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:52" (1/1) ...
[2018-10-04 12:13:52,244 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:52" (1/1) ...
[2018-10-04 12:13:52,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-10-04 12:13:52,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-10-04 12:13:52,253 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-10-04 12:13:52,253 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-10-04 12:13:52,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:52" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-10-04 12:13:52,338 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration
[2018-10-04 12:13:52,338 INFO L130 BoogieDeclarations]: Found specification of procedure product
[2018-10-04 12:13:52,338 INFO L138 BoogieDeclarations]: Found implementation of procedure product
[2018-10-04 12:13:53,277 INFO L338 CfgBuilder]: Using library mode
[2018-10-04 12:13:53,277 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:13:53 BoogieIcfgContainer
[2018-10-04 12:13:53,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-10-04 12:13:53,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-10-04 12:13:53,279 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-10-04 12:13:53,282 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-10-04 12:13:53,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:13:52" (1/2) ...
[2018-10-04 12:13:53,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6371e3ef and model type threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:13:53, skipping insertion in model container
[2018-10-04 12:13:53,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:13:53" (2/2) ...
[2018-10-04 12:13:53,285 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out.bpl
[2018-10-04 12:13:53,294 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-10-04 12:13:53,303 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations.
[2018-10-04 12:13:53,348 INFO L133 ementStrategyFactory]: Using default assertion order modulation
[2018-10-04 12:13:53,349 INFO L381 AbstractCegarLoop]: Interprodecural is true
[2018-10-04 12:13:53,349 INFO L382 AbstractCegarLoop]: Hoare is true
[2018-10-04 12:13:53,349 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-10-04 12:13:53,349 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2018-10-04 12:13:53,349 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-10-04 12:13:53,350 INFO L386 AbstractCegarLoop]: Difference is false
[2018-10-04 12:13:53,350 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-10-04 12:13:53,350 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-10-04 12:13:53,368 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states.
[2018-10-04 12:13:53,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2018-10-04 12:13:53,376 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:13:53,377 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:13:53,378 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:13:53,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:13:53,390 INFO L82 PathProgramCache]: Analyzing trace with hash -2113132074, now seen corresponding path program 1 times
[2018-10-04 12:13:53,392 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:13:53,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:13:53,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:13:53,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:13:53,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:13:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:13:53,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:13:53,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:13:53,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-10-04 12:13:53,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-10-04 12:13:53,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-10-04 12:13:53,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-10-04 12:13:53,714 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 6 states.
[2018-10-04 12:13:55,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:13:55,636 INFO L93 Difference]: Finished difference Result 163 states and 353 transitions.
[2018-10-04 12:13:55,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-10-04 12:13:55,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7
[2018-10-04 12:13:55,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:13:55,658 INFO L225 Difference]: With dead ends: 163
[2018-10-04 12:13:55,658 INFO L226 Difference]: Without dead ends: 158
[2018-10-04 12:13:55,662 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-10-04 12:13:55,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states.
[2018-10-04 12:13:55,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 93.
[2018-10-04 12:13:55,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states.
[2018-10-04 12:13:55,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 195 transitions.
[2018-10-04 12:13:55,718 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 195 transitions. Word has length 7
[2018-10-04 12:13:55,718 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:13:55,719 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 195 transitions.
[2018-10-04 12:13:55,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-10-04 12:13:55,719 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 195 transitions.
[2018-10-04 12:13:55,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2018-10-04 12:13:55,720 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:13:55,721 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:13:55,722 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:13:55,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:13:55,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1894705935, now seen corresponding path program 1 times
[2018-10-04 12:13:55,723 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:13:55,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:13:55,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:13:55,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:13:55,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:13:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:13:55,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:13:55,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:13:55,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-10-04 12:13:55,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-10-04 12:13:55,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-10-04 12:13:55,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-10-04 12:13:55,830 INFO L87 Difference]: Start difference. First operand 93 states and 195 transitions. Second operand 6 states.
[2018-10-04 12:13:56,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:13:56,845 INFO L93 Difference]: Finished difference Result 188 states and 413 transitions.
[2018-10-04 12:13:56,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-10-04 12:13:56,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7
[2018-10-04 12:13:56,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:13:56,850 INFO L225 Difference]: With dead ends: 188
[2018-10-04 12:13:56,851 INFO L226 Difference]: Without dead ends: 183
[2018-10-04 12:13:56,852 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-10-04 12:13:56,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states.
[2018-10-04 12:13:56,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 118.
[2018-10-04 12:13:56,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states.
[2018-10-04 12:13:56,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 255 transitions.
[2018-10-04 12:13:56,875 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 255 transitions. Word has length 7
[2018-10-04 12:13:56,875 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:13:56,876 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 255 transitions.
[2018-10-04 12:13:56,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-10-04 12:13:56,876 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 255 transitions.
[2018-10-04 12:13:56,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2018-10-04 12:13:56,877 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:13:56,877 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:13:56,878 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:13:56,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:13:56,879 INFO L82 PathProgramCache]: Analyzing trace with hash 672968560, now seen corresponding path program 1 times
[2018-10-04 12:13:56,879 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:13:56,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:13:56,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:13:56,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:13:56,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:13:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:13:56,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:13:56,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:13:56,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-10-04 12:13:56,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-10-04 12:13:56,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-10-04 12:13:56,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-10-04 12:13:56,995 INFO L87 Difference]: Start difference. First operand 118 states and 255 transitions. Second operand 7 states.
[2018-10-04 12:13:58,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:13:58,754 INFO L93 Difference]: Finished difference Result 361 states and 808 transitions.
[2018-10-04 12:13:58,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-10-04 12:13:58,755 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9
[2018-10-04 12:13:58,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:13:58,759 INFO L225 Difference]: With dead ends: 361
[2018-10-04 12:13:58,760 INFO L226 Difference]: Without dead ends: 349
[2018-10-04 12:13:58,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240
[2018-10-04 12:13:58,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states.
[2018-10-04 12:13:58,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 174.
[2018-10-04 12:13:58,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states.
[2018-10-04 12:13:58,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 387 transitions.
[2018-10-04 12:13:58,799 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 387 transitions. Word has length 9
[2018-10-04 12:13:58,799 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:13:58,799 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 387 transitions.
[2018-10-04 12:13:58,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-10-04 12:13:58,801 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 387 transitions.
[2018-10-04 12:13:58,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2018-10-04 12:13:58,802 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:13:58,803 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:13:58,803 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:13:58,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:13:58,804 INFO L82 PathProgramCache]: Analyzing trace with hash 2061636985, now seen corresponding path program 1 times
[2018-10-04 12:13:58,804 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:13:58,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:13:58,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:13:58,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:13:58,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:13:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:13:58,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:13:58,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:13:58,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-10-04 12:13:58,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-10-04 12:13:58,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-10-04 12:13:58,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-10-04 12:13:58,926 INFO L87 Difference]: Start difference. First operand 174 states and 387 transitions. Second operand 7 states.
[2018-10-04 12:14:00,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:14:00,249 INFO L93 Difference]: Finished difference Result 307 states and 694 transitions.
[2018-10-04 12:14:00,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-10-04 12:14:00,253 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9
[2018-10-04 12:14:00,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:14:00,256 INFO L225 Difference]: With dead ends: 307
[2018-10-04 12:14:00,256 INFO L226 Difference]: Without dead ends: 302
[2018-10-04 12:14:00,257 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-10-04 12:14:00,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states.
[2018-10-04 12:14:00,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 203.
[2018-10-04 12:14:00,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states.
[2018-10-04 12:14:00,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions.
[2018-10-04 12:14:00,296 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 9
[2018-10-04 12:14:00,296 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:14:00,297 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions.
[2018-10-04 12:14:00,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-10-04 12:14:00,297 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions.
[2018-10-04 12:14:00,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-04 12:14:00,299 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:14:00,299 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:14:00,300 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:14:00,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:14:00,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1603442246, now seen corresponding path program 1 times
[2018-10-04 12:14:00,301 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:14:00,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:14:00,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:00,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:14:00,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:14:00,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:14:00,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:14:00,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-04 12:14:00,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-04 12:14:00,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-04 12:14:00,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2018-10-04 12:14:00,405 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 8 states.
[2018-10-04 12:14:04,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:14:04,079 INFO L93 Difference]: Finished difference Result 741 states and 1656 transitions.
[2018-10-04 12:14:04,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states.
[2018-10-04 12:14:04,080 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12
[2018-10-04 12:14:04,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:14:04,086 INFO L225 Difference]: With dead ends: 741
[2018-10-04 12:14:04,086 INFO L226 Difference]: Without dead ends: 733
[2018-10-04 12:14:04,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930
[2018-10-04 12:14:04,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states.
[2018-10-04 12:14:04,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 315.
[2018-10-04 12:14:04,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states.
[2018-10-04 12:14:04,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 743 transitions.
[2018-10-04 12:14:04,143 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 743 transitions. Word has length 12
[2018-10-04 12:14:04,143 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:14:04,143 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 743 transitions.
[2018-10-04 12:14:04,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-04 12:14:04,143 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 743 transitions.
[2018-10-04 12:14:04,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-04 12:14:04,145 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:14:04,145 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:14:04,146 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:14:04,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:14:04,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1573889574, now seen corresponding path program 1 times
[2018-10-04 12:14:04,147 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:14:04,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:14:04,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:04,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:14:04,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:14:04,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:14:04,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:14:04,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-04 12:14:04,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-04 12:14:04,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-04 12:14:04,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2018-10-04 12:14:04,242 INFO L87 Difference]: Start difference. First operand 315 states and 743 transitions. Second operand 8 states.
[2018-10-04 12:14:10,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:14:10,391 INFO L93 Difference]: Finished difference Result 797 states and 1784 transitions.
[2018-10-04 12:14:10,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states.
[2018-10-04 12:14:10,392 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12
[2018-10-04 12:14:10,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:14:10,399 INFO L225 Difference]: With dead ends: 797
[2018-10-04 12:14:10,399 INFO L226 Difference]: Without dead ends: 789
[2018-10-04 12:14:10,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756
[2018-10-04 12:14:10,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states.
[2018-10-04 12:14:10,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 319.
[2018-10-04 12:14:10,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states.
[2018-10-04 12:14:10,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 751 transitions.
[2018-10-04 12:14:10,478 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 751 transitions. Word has length 12
[2018-10-04 12:14:10,478 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:14:10,479 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 751 transitions.
[2018-10-04 12:14:10,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-04 12:14:10,479 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 751 transitions.
[2018-10-04 12:14:10,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-04 12:14:10,480 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:14:10,480 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:14:10,481 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:14:10,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:14:10,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1576689928, now seen corresponding path program 1 times
[2018-10-04 12:14:10,481 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:14:10,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:14:10,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:10,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:14:10,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:14:10,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:14:10,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:14:10,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-04 12:14:10,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-04 12:14:10,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-04 12:14:10,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2018-10-04 12:14:10,676 INFO L87 Difference]: Start difference. First operand 319 states and 751 transitions. Second operand 8 states.
[2018-10-04 12:14:12,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:14:12,544 INFO L93 Difference]: Finished difference Result 684 states and 1538 transitions.
[2018-10-04 12:14:12,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2018-10-04 12:14:12,545 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12
[2018-10-04 12:14:12,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:14:12,550 INFO L225 Difference]: With dead ends: 684
[2018-10-04 12:14:12,550 INFO L226 Difference]: Without dead ends: 676
[2018-10-04 12:14:12,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506
[2018-10-04 12:14:12,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states.
[2018-10-04 12:14:12,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 330.
[2018-10-04 12:14:12,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states.
[2018-10-04 12:14:12,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 778 transitions.
[2018-10-04 12:14:12,615 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 778 transitions. Word has length 12
[2018-10-04 12:14:12,615 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:14:12,615 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 778 transitions.
[2018-10-04 12:14:12,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-04 12:14:12,616 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 778 transitions.
[2018-10-04 12:14:12,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-04 12:14:12,617 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:14:12,617 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:14:12,617 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:14:12,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:14:12,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1576587783, now seen corresponding path program 1 times
[2018-10-04 12:14:12,618 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:14:12,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:14:12,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:12,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:14:12,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:14:12,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:14:12,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:14:12,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-04 12:14:12,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-04 12:14:12,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-04 12:14:12,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2018-10-04 12:14:12,885 INFO L87 Difference]: Start difference. First operand 330 states and 778 transitions. Second operand 8 states.
[2018-10-04 12:14:14,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:14:14,175 INFO L93 Difference]: Finished difference Result 605 states and 1360 transitions.
[2018-10-04 12:14:14,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2018-10-04 12:14:14,176 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12
[2018-10-04 12:14:14,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:14:14,181 INFO L225 Difference]: With dead ends: 605
[2018-10-04 12:14:14,181 INFO L226 Difference]: Without dead ends: 597
[2018-10-04 12:14:14,182 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-10-04 12:14:14,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states.
[2018-10-04 12:14:14,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 337.
[2018-10-04 12:14:14,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states.
[2018-10-04 12:14:14,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 794 transitions.
[2018-10-04 12:14:14,247 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 794 transitions. Word has length 12
[2018-10-04 12:14:14,247 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:14:14,248 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 794 transitions.
[2018-10-04 12:14:14,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-04 12:14:14,248 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 794 transitions.
[2018-10-04 12:14:14,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-04 12:14:14,249 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:14:14,249 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:14:14,250 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:14:14,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:14:14,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1088621469, now seen corresponding path program 1 times
[2018-10-04 12:14:14,250 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:14:14,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:14:14,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:14,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:14:14,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:14:14,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:14:14,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:14:14,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-04 12:14:14,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-04 12:14:14,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-04 12:14:14,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2018-10-04 12:14:14,338 INFO L87 Difference]: Start difference. First operand 337 states and 794 transitions. Second operand 8 states.
[2018-10-04 12:14:16,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:14:16,526 INFO L93 Difference]: Finished difference Result 935 states and 2104 transitions.
[2018-10-04 12:14:16,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2018-10-04 12:14:16,526 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12
[2018-10-04 12:14:16,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:14:16,533 INFO L225 Difference]: With dead ends: 935
[2018-10-04 12:14:16,534 INFO L226 Difference]: Without dead ends: 927
[2018-10-04 12:14:16,535 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-10-04 12:14:16,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states.
[2018-10-04 12:14:16,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 343.
[2018-10-04 12:14:16,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states.
[2018-10-04 12:14:16,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 808 transitions.
[2018-10-04 12:14:16,618 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 808 transitions. Word has length 12
[2018-10-04 12:14:16,618 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:14:16,618 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 808 transitions.
[2018-10-04 12:14:16,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-04 12:14:16,618 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 808 transitions.
[2018-10-04 12:14:16,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-04 12:14:16,619 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:14:16,619 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:14:16,620 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:14:16,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:14:16,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1085821115, now seen corresponding path program 1 times
[2018-10-04 12:14:16,621 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:14:16,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:14:16,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:16,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:14:16,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:14:16,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:14:16,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:14:16,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-04 12:14:16,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-04 12:14:16,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-04 12:14:16,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2018-10-04 12:14:16,698 INFO L87 Difference]: Start difference. First operand 343 states and 808 transitions. Second operand 8 states.
[2018-10-04 12:14:18,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:14:18,748 INFO L93 Difference]: Finished difference Result 923 states and 2061 transitions.
[2018-10-04 12:14:18,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2018-10-04 12:14:18,749 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12
[2018-10-04 12:14:18,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:14:18,755 INFO L225 Difference]: With dead ends: 923
[2018-10-04 12:14:18,755 INFO L226 Difference]: Without dead ends: 915
[2018-10-04 12:14:18,756 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-10-04 12:14:18,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states.
[2018-10-04 12:14:18,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 354.
[2018-10-04 12:14:18,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states.
[2018-10-04 12:14:18,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 835 transitions.
[2018-10-04 12:14:18,859 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 835 transitions. Word has length 12
[2018-10-04 12:14:18,859 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:14:18,859 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 835 transitions.
[2018-10-04 12:14:18,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-04 12:14:18,859 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 835 transitions.
[2018-10-04 12:14:18,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-04 12:14:18,860 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:14:18,860 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:14:18,861 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:14:18,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:14:18,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1085923260, now seen corresponding path program 1 times
[2018-10-04 12:14:18,861 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:14:18,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:14:18,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:18,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:14:18,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:14:19,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:14:19,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:14:19,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-04 12:14:19,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-04 12:14:19,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-04 12:14:19,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2018-10-04 12:14:19,076 INFO L87 Difference]: Start difference. First operand 354 states and 835 transitions. Second operand 8 states.
[2018-10-04 12:14:20,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:14:20,861 INFO L93 Difference]: Finished difference Result 837 states and 1868 transitions.
[2018-10-04 12:14:20,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2018-10-04 12:14:20,862 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12
[2018-10-04 12:14:20,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:14:20,867 INFO L225 Difference]: With dead ends: 837
[2018-10-04 12:14:20,867 INFO L226 Difference]: Without dead ends: 829
[2018-10-04 12:14:20,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342
[2018-10-04 12:14:20,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states.
[2018-10-04 12:14:20,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 339.
[2018-10-04 12:14:20,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states.
[2018-10-04 12:14:20,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 800 transitions.
[2018-10-04 12:14:20,965 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 800 transitions. Word has length 12
[2018-10-04 12:14:20,966 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:14:20,966 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 800 transitions.
[2018-10-04 12:14:20,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-04 12:14:20,966 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 800 transitions.
[2018-10-04 12:14:20,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-04 12:14:20,967 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:14:20,967 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:14:20,968 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:14:20,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:14:20,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1383194877, now seen corresponding path program 1 times
[2018-10-04 12:14:20,968 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:14:20,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:14:20,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:20,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:14:20,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:14:21,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:14:21,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:14:21,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-04 12:14:21,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-04 12:14:21,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-04 12:14:21,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2018-10-04 12:14:21,051 INFO L87 Difference]: Start difference. First operand 339 states and 800 transitions. Second operand 8 states.
[2018-10-04 12:14:23,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:14:23,354 INFO L93 Difference]: Finished difference Result 996 states and 2227 transitions.
[2018-10-04 12:14:23,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states.
[2018-10-04 12:14:23,360 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12
[2018-10-04 12:14:23,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:14:23,365 INFO L225 Difference]: With dead ends: 996
[2018-10-04 12:14:23,365 INFO L226 Difference]: Without dead ends: 988
[2018-10-04 12:14:23,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056
[2018-10-04 12:14:23,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states.
[2018-10-04 12:14:23,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 381.
[2018-10-04 12:14:23,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states.
[2018-10-04 12:14:23,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 915 transitions.
[2018-10-04 12:14:23,498 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 915 transitions. Word has length 12
[2018-10-04 12:14:23,499 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:14:23,499 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 915 transitions.
[2018-10-04 12:14:23,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-04 12:14:23,500 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 915 transitions.
[2018-10-04 12:14:23,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-04 12:14:23,500 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:14:23,501 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:14:23,501 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:14:23,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:14:23,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1383297022, now seen corresponding path program 1 times
[2018-10-04 12:14:23,502 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:14:23,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:14:23,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:23,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:14:23,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:14:23,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:14:23,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:14:23,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-04 12:14:23,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-04 12:14:23,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-04 12:14:23,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2018-10-04 12:14:23,804 INFO L87 Difference]: Start difference. First operand 381 states and 915 transitions. Second operand 8 states.
[2018-10-04 12:14:25,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:14:25,905 INFO L93 Difference]: Finished difference Result 913 states and 2034 transitions.
[2018-10-04 12:14:25,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2018-10-04 12:14:25,906 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12
[2018-10-04 12:14:25,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:14:25,910 INFO L225 Difference]: With dead ends: 913
[2018-10-04 12:14:25,910 INFO L226 Difference]: Without dead ends: 905
[2018-10-04 12:14:25,912 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-10-04 12:14:25,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states.
[2018-10-04 12:14:26,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 371.
[2018-10-04 12:14:26,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states.
[2018-10-04 12:14:26,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 890 transitions.
[2018-10-04 12:14:26,007 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 890 transitions. Word has length 12
[2018-10-04 12:14:26,007 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:14:26,007 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 890 transitions.
[2018-10-04 12:14:26,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-04 12:14:26,008 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 890 transitions.
[2018-10-04 12:14:26,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-04 12:14:26,008 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:14:26,008 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:14:26,009 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:14:26,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:14:26,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1392211258, now seen corresponding path program 1 times
[2018-10-04 12:14:26,009 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:14:26,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:14:26,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:26,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:14:26,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:14:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:14:26,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:14:26,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-04 12:14:26,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-04 12:14:26,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-04 12:14:26,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2018-10-04 12:14:26,090 INFO L87 Difference]: Start difference. First operand 371 states and 890 transitions. Second operand 8 states.
[2018-10-04 12:14:27,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:14:27,747 INFO L93 Difference]: Finished difference Result 886 states and 2009 transitions.
[2018-10-04 12:14:27,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2018-10-04 12:14:27,748 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12
[2018-10-04 12:14:27,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:14:27,751 INFO L225 Difference]: With dead ends: 886
[2018-10-04 12:14:27,752 INFO L226 Difference]: Without dead ends: 878
[2018-10-04 12:14:27,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462
[2018-10-04 12:14:27,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states.
[2018-10-04 12:14:27,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 372.
[2018-10-04 12:14:27,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states.
[2018-10-04 12:14:27,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 891 transitions.
[2018-10-04 12:14:27,868 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 891 transitions. Word has length 12
[2018-10-04 12:14:27,868 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:14:27,868 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 891 transitions.
[2018-10-04 12:14:27,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-04 12:14:27,868 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 891 transitions.
[2018-10-04 12:14:27,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-04 12:14:27,869 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:14:27,869 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:14:27,869 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:14:27,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:14:27,870 INFO L82 PathProgramCache]: Analyzing trace with hash 195419672, now seen corresponding path program 1 times
[2018-10-04 12:14:27,870 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:14:27,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:14:27,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:27,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:14:27,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:14:27,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:14:27,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:14:27,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-04 12:14:27,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-10-04 12:14:27,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-10-04 12:14:27,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2018-10-04 12:14:27,968 INFO L87 Difference]: Start difference. First operand 372 states and 891 transitions. Second operand 9 states.
[2018-10-04 12:14:29,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:14:29,866 INFO L93 Difference]: Finished difference Result 801 states and 1838 transitions.
[2018-10-04 12:14:29,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-10-04 12:14:29,866 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12
[2018-10-04 12:14:29,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:14:29,871 INFO L225 Difference]: With dead ends: 801
[2018-10-04 12:14:29,871 INFO L226 Difference]: Without dead ends: 793
[2018-10-04 12:14:29,872 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-10-04 12:14:29,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states.
[2018-10-04 12:14:30,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 393.
[2018-10-04 12:14:30,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states.
[2018-10-04 12:14:30,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 949 transitions.
[2018-10-04 12:14:30,070 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 949 transitions. Word has length 12
[2018-10-04 12:14:30,071 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:14:30,071 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 949 transitions.
[2018-10-04 12:14:30,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-10-04 12:14:30,071 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 949 transitions.
[2018-10-04 12:14:30,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-04 12:14:30,072 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:14:30,072 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:14:30,072 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:14:30,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:14:30,073 INFO L82 PathProgramCache]: Analyzing trace with hash 192619318, now seen corresponding path program 1 times
[2018-10-04 12:14:30,073 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:14:30,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:14:30,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:30,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:14:30,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:14:30,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:14:30,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:14:30,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-04 12:14:30,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-10-04 12:14:30,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-10-04 12:14:30,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2018-10-04 12:14:30,785 INFO L87 Difference]: Start difference. First operand 393 states and 949 transitions. Second operand 9 states.
[2018-10-04 12:14:33,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:14:33,161 INFO L93 Difference]: Finished difference Result 962 states and 2211 transitions.
[2018-10-04 12:14:33,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-10-04 12:14:33,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12
[2018-10-04 12:14:33,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:14:33,167 INFO L225 Difference]: With dead ends: 962
[2018-10-04 12:14:33,168 INFO L226 Difference]: Without dead ends: 954
[2018-10-04 12:14:33,168 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-10-04 12:14:33,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states.
[2018-10-04 12:14:33,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 409.
[2018-10-04 12:14:33,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states.
[2018-10-04 12:14:33,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 997 transitions.
[2018-10-04 12:14:33,343 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 997 transitions. Word has length 12
[2018-10-04 12:14:33,343 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:14:33,343 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 997 transitions.
[2018-10-04 12:14:33,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-10-04 12:14:33,343 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 997 transitions.
[2018-10-04 12:14:33,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-04 12:14:33,344 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:14:33,344 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:14:33,345 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:14:33,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:14:33,345 INFO L82 PathProgramCache]: Analyzing trace with hash 192721463, now seen corresponding path program 1 times
[2018-10-04 12:14:33,345 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:14:33,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:14:33,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:33,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:14:33,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:14:33,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:14:33,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:14:33,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-04 12:14:33,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-10-04 12:14:33,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-10-04 12:14:33,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2018-10-04 12:14:33,434 INFO L87 Difference]: Start difference. First operand 409 states and 997 transitions. Second operand 9 states.
[2018-10-04 12:14:36,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:14:36,025 INFO L93 Difference]: Finished difference Result 1000 states and 2329 transitions.
[2018-10-04 12:14:36,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-10-04 12:14:36,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12
[2018-10-04 12:14:36,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:14:36,030 INFO L225 Difference]: With dead ends: 1000
[2018-10-04 12:14:36,030 INFO L226 Difference]: Without dead ends: 992
[2018-10-04 12:14:36,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812
[2018-10-04 12:14:36,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states.
[2018-10-04 12:14:36,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 430.
[2018-10-04 12:14:36,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states.
[2018-10-04 12:14:36,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1052 transitions.
[2018-10-04 12:14:36,197 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1052 transitions. Word has length 12
[2018-10-04 12:14:36,197 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:14:36,198 INFO L480 AbstractCegarLoop]: Abstraction has 430 states and 1052 transitions.
[2018-10-04 12:14:36,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-10-04 12:14:36,198 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1052 transitions.
[2018-10-04 12:14:36,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-04 12:14:36,199 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:14:36,199 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:14:36,199 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:14:36,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:14:36,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1320238459, now seen corresponding path program 1 times
[2018-10-04 12:14:36,200 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:14:36,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:14:36,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:36,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:14:36,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:14:36,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:14:36,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:14:36,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-04 12:14:36,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-10-04 12:14:36,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-10-04 12:14:36,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2018-10-04 12:14:36,296 INFO L87 Difference]: Start difference. First operand 430 states and 1052 transitions. Second operand 9 states.
[2018-10-04 12:14:39,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:14:39,035 INFO L93 Difference]: Finished difference Result 1065 states and 2466 transitions.
[2018-10-04 12:14:39,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2018-10-04 12:14:39,035 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12
[2018-10-04 12:14:39,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:14:39,041 INFO L225 Difference]: With dead ends: 1065
[2018-10-04 12:14:39,041 INFO L226 Difference]: Without dead ends: 1057
[2018-10-04 12:14:39,042 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-10-04 12:14:39,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states.
[2018-10-04 12:14:39,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 471.
[2018-10-04 12:14:39,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states.
[2018-10-04 12:14:39,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1168 transitions.
[2018-10-04 12:14:39,270 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1168 transitions. Word has length 12
[2018-10-04 12:14:39,271 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:14:39,271 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 1168 transitions.
[2018-10-04 12:14:39,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-10-04 12:14:39,271 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1168 transitions.
[2018-10-04 12:14:39,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-04 12:14:39,272 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:14:39,272 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:14:39,273 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:14:39,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:14:39,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1320340604, now seen corresponding path program 1 times
[2018-10-04 12:14:39,273 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:14:39,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:14:39,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:39,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:14:39,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:14:39,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:14:39,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:14:39,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-04 12:14:39,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-10-04 12:14:39,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-10-04 12:14:39,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2018-10-04 12:14:39,398 INFO L87 Difference]: Start difference. First operand 471 states and 1168 transitions. Second operand 9 states.
[2018-10-04 12:14:42,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:14:42,696 INFO L93 Difference]: Finished difference Result 1227 states and 2851 transitions.
[2018-10-04 12:14:42,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states.
[2018-10-04 12:14:42,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12
[2018-10-04 12:14:42,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:14:42,702 INFO L225 Difference]: With dead ends: 1227
[2018-10-04 12:14:42,702 INFO L226 Difference]: Without dead ends: 1219
[2018-10-04 12:14:42,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=365, Invalid=967, Unknown=0, NotChecked=0, Total=1332
[2018-10-04 12:14:42,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states.
[2018-10-04 12:14:42,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 438.
[2018-10-04 12:14:42,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states.
[2018-10-04 12:14:42,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1072 transitions.
[2018-10-04 12:14:42,904 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1072 transitions. Word has length 12
[2018-10-04 12:14:42,904 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:14:42,905 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 1072 transitions.
[2018-10-04 12:14:42,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-10-04 12:14:42,905 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1072 transitions.
[2018-10-04 12:14:42,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-04 12:14:42,905 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:14:42,905 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:14:42,906 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:14:42,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:14:42,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1428190751, now seen corresponding path program 1 times
[2018-10-04 12:14:42,906 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:14:42,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:14:42,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:42,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:14:42,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:14:42,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:14:42,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:14:42,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-04 12:14:42,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-10-04 12:14:42,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-10-04 12:14:42,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2018-10-04 12:14:42,998 INFO L87 Difference]: Start difference. First operand 438 states and 1072 transitions. Second operand 9 states.
[2018-10-04 12:14:45,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:14:45,812 INFO L93 Difference]: Finished difference Result 1076 states and 2511 transitions.
[2018-10-04 12:14:45,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2018-10-04 12:14:45,813 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12
[2018-10-04 12:14:45,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:14:45,817 INFO L225 Difference]: With dead ends: 1076
[2018-10-04 12:14:45,817 INFO L226 Difference]: Without dead ends: 1068
[2018-10-04 12:14:45,818 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-10-04 12:14:45,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states.
[2018-10-04 12:14:46,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 445.
[2018-10-04 12:14:46,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states.
[2018-10-04 12:14:46,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1088 transitions.
[2018-10-04 12:14:46,063 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1088 transitions. Word has length 12
[2018-10-04 12:14:46,064 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:14:46,064 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 1088 transitions.
[2018-10-04 12:14:46,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-10-04 12:14:46,064 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1088 transitions.
[2018-10-04 12:14:46,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-04 12:14:46,064 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:14:46,065 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:14:46,065 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:14:46,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:14:46,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1838990990, now seen corresponding path program 1 times
[2018-10-04 12:14:46,066 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:14:46,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:14:46,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:46,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:14:46,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:14:46,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:14:46,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:14:46,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-04 12:14:46,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-10-04 12:14:46,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-10-04 12:14:46,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2018-10-04 12:14:46,195 INFO L87 Difference]: Start difference. First operand 445 states and 1088 transitions. Second operand 9 states.
[2018-10-04 12:14:48,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:14:48,753 INFO L93 Difference]: Finished difference Result 1111 states and 2606 transitions.
[2018-10-04 12:14:48,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-10-04 12:14:48,753 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12
[2018-10-04 12:14:48,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:14:48,758 INFO L225 Difference]: With dead ends: 1111
[2018-10-04 12:14:48,758 INFO L226 Difference]: Without dead ends: 1103
[2018-10-04 12:14:48,759 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-10-04 12:14:48,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states.
[2018-10-04 12:14:49,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 520.
[2018-10-04 12:14:49,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states.
[2018-10-04 12:14:49,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1295 transitions.
[2018-10-04 12:14:49,090 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1295 transitions. Word has length 12
[2018-10-04 12:14:49,091 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:14:49,091 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 1295 transitions.
[2018-10-04 12:14:49,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-10-04 12:14:49,091 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1295 transitions.
[2018-10-04 12:14:49,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-04 12:14:49,091 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:14:49,092 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:14:49,092 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:14:49,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:14:49,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1838888845, now seen corresponding path program 1 times
[2018-10-04 12:14:49,092 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:14:49,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:14:49,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:49,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:14:49,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:14:49,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:14:49,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:14:49,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-04 12:14:49,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-10-04 12:14:49,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-10-04 12:14:49,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2018-10-04 12:14:49,406 INFO L87 Difference]: Start difference. First operand 520 states and 1295 transitions. Second operand 9 states.
[2018-10-04 12:14:52,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:14:52,864 INFO L93 Difference]: Finished difference Result 1304 states and 3059 transitions.
[2018-10-04 12:14:52,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2018-10-04 12:14:52,867 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12
[2018-10-04 12:14:52,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:14:52,872 INFO L225 Difference]: With dead ends: 1304
[2018-10-04 12:14:52,872 INFO L226 Difference]: Without dead ends: 1296
[2018-10-04 12:14:52,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600
[2018-10-04 12:14:52,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states.
[2018-10-04 12:14:53,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 487.
[2018-10-04 12:14:53,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states.
[2018-10-04 12:14:53,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1199 transitions.
[2018-10-04 12:14:53,195 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1199 transitions. Word has length 12
[2018-10-04 12:14:53,195 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:14:53,195 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 1199 transitions.
[2018-10-04 12:14:53,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-10-04 12:14:53,196 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1199 transitions.
[2018-10-04 12:14:53,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-04 12:14:53,197 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:14:53,197 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:14:53,197 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:14:53,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:14:53,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1731038698, now seen corresponding path program 1 times
[2018-10-04 12:14:53,198 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:14:53,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:14:53,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:53,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:14:53,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:14:53,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:14:53,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:14:53,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-04 12:14:53,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-10-04 12:14:53,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-10-04 12:14:53,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2018-10-04 12:14:53,302 INFO L87 Difference]: Start difference. First operand 487 states and 1199 transitions. Second operand 9 states.
[2018-10-04 12:14:57,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:14:57,206 INFO L93 Difference]: Finished difference Result 1370 states and 3217 transitions.
[2018-10-04 12:14:57,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2018-10-04 12:14:57,206 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12
[2018-10-04 12:14:57,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:14:57,213 INFO L225 Difference]: With dead ends: 1370
[2018-10-04 12:14:57,214 INFO L226 Difference]: Without dead ends: 1362
[2018-10-04 12:14:57,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870
[2018-10-04 12:14:57,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states.
[2018-10-04 12:14:57,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 479.
[2018-10-04 12:14:57,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states.
[2018-10-04 12:14:57,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1179 transitions.
[2018-10-04 12:14:57,544 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1179 transitions. Word has length 12
[2018-10-04 12:14:57,544 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:14:57,545 INFO L480 AbstractCegarLoop]: Abstraction has 479 states and 1179 transitions.
[2018-10-04 12:14:57,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-10-04 12:14:57,545 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1179 transitions.
[2018-10-04 12:14:57,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2018-10-04 12:14:57,546 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:14:57,546 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:14:57,546 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:14:57,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:14:57,546 INFO L82 PathProgramCache]: Analyzing trace with hash 819460533, now seen corresponding path program 1 times
[2018-10-04 12:14:57,547 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:14:57,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:14:57,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:57,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:14:57,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:14:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:14:57,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:14:57,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:14:57,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-04 12:14:57,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-10-04 12:14:57,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-10-04 12:14:57,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2018-10-04 12:14:57,664 INFO L87 Difference]: Start difference. First operand 479 states and 1179 transitions. Second operand 9 states.
[2018-10-04 12:15:00,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:15:00,537 INFO L93 Difference]: Finished difference Result 1298 states and 3068 transitions.
[2018-10-04 12:15:00,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-10-04 12:15:00,537 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12
[2018-10-04 12:15:00,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:15:00,542 INFO L225 Difference]: With dead ends: 1298
[2018-10-04 12:15:00,543 INFO L226 Difference]: Without dead ends: 1290
[2018-10-04 12:15:00,543 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-10-04 12:15:00,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states.
[2018-10-04 12:15:00,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 602.
[2018-10-04 12:15:00,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states.
[2018-10-04 12:15:00,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1488 transitions.
[2018-10-04 12:15:00,966 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1488 transitions. Word has length 12
[2018-10-04 12:15:00,966 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:15:00,966 INFO L480 AbstractCegarLoop]: Abstraction has 602 states and 1488 transitions.
[2018-10-04 12:15:00,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-10-04 12:15:00,966 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1488 transitions.
[2018-10-04 12:15:00,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2018-10-04 12:15:00,967 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:15:00,967 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:15:00,967 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:15:00,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:15:00,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1080362888, now seen corresponding path program 1 times
[2018-10-04 12:15:00,968 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:15:00,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:15:00,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:15:00,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:15:00,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:15:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:15:01,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:15:01,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:15:01,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-10-04 12:15:01,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-10-04 12:15:01,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-10-04 12:15:01,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-10-04 12:15:01,035 INFO L87 Difference]: Start difference. First operand 602 states and 1488 transitions. Second operand 5 states.
[2018-10-04 12:15:02,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:15:02,028 INFO L93 Difference]: Finished difference Result 1242 states and 3091 transitions.
[2018-10-04 12:15:02,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-10-04 12:15:02,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13
[2018-10-04 12:15:02,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:15:02,030 INFO L225 Difference]: With dead ends: 1242
[2018-10-04 12:15:02,031 INFO L226 Difference]: Without dead ends: 673
[2018-10-04 12:15:02,033 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-10-04 12:15:02,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states.
[2018-10-04 12:15:02,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 612.
[2018-10-04 12:15:02,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states.
[2018-10-04 12:15:02,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1463 transitions.
[2018-10-04 12:15:02,536 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1463 transitions. Word has length 13
[2018-10-04 12:15:02,536 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:15:02,536 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 1463 transitions.
[2018-10-04 12:15:02,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-10-04 12:15:02,536 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1463 transitions.
[2018-10-04 12:15:02,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2018-10-04 12:15:02,537 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:15:02,537 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:15:02,537 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:15:02,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:15:02,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1652407871, now seen corresponding path program 1 times
[2018-10-04 12:15:02,538 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:15:02,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:15:02,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:15:02,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:15:02,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:15:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:15:02,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:15:02,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-04 12:15:02,619 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-04 12:15:02,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:15:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:15:02,664 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-04 12:15:03,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:15:03,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-04 12:15:03,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14
[2018-10-04 12:15:03,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states
[2018-10-04 12:15:03,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2018-10-04 12:15:03,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240
[2018-10-04 12:15:03,746 INFO L87 Difference]: Start difference. First operand 612 states and 1463 transitions. Second operand 16 states.
[2018-10-04 12:15:07,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:15:07,737 INFO L93 Difference]: Finished difference Result 854 states and 1987 transitions.
[2018-10-04 12:15:07,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-10-04 12:15:07,737 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13
[2018-10-04 12:15:07,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:15:07,740 INFO L225 Difference]: With dead ends: 854
[2018-10-04 12:15:07,741 INFO L226 Difference]: Without dead ends: 849
[2018-10-04 12:15:07,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420
[2018-10-04 12:15:07,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states.
[2018-10-04 12:15:08,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 690.
[2018-10-04 12:15:08,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states.
[2018-10-04 12:15:08,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1639 transitions.
[2018-10-04 12:15:08,755 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1639 transitions. Word has length 13
[2018-10-04 12:15:08,755 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:15:08,755 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1639 transitions.
[2018-10-04 12:15:08,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states.
[2018-10-04 12:15:08,755 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1639 transitions.
[2018-10-04 12:15:08,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2018-10-04 12:15:08,756 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:15:08,756 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:15:08,757 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:15:08,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:15:08,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1456173380, now seen corresponding path program 1 times
[2018-10-04 12:15:08,757 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:15:08,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:15:08,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:15:08,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:15:08,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:15:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:15:08,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:15:08,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-04 12:15:08,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-10-04 12:15:08,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-10-04 12:15:08,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-10-04 12:15:08,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-10-04 12:15:08,826 INFO L87 Difference]: Start difference. First operand 690 states and 1639 transitions. Second operand 5 states.
[2018-10-04 12:15:09,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:15:09,745 INFO L93 Difference]: Finished difference Result 1308 states and 3113 transitions.
[2018-10-04 12:15:09,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-10-04 12:15:09,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13
[2018-10-04 12:15:09,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:15:09,747 INFO L225 Difference]: With dead ends: 1308
[2018-10-04 12:15:09,747 INFO L226 Difference]: Without dead ends: 709
[2018-10-04 12:15:09,749 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-10-04 12:15:09,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states.
[2018-10-04 12:15:10,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 690.
[2018-10-04 12:15:10,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states.
[2018-10-04 12:15:10,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1556 transitions.
[2018-10-04 12:15:10,416 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1556 transitions. Word has length 13
[2018-10-04 12:15:10,416 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:15:10,416 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 1556 transitions.
[2018-10-04 12:15:10,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-10-04 12:15:10,416 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1556 transitions.
[2018-10-04 12:15:10,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-10-04 12:15:10,417 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:15:10,417 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:15:10,418 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:15:10,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:15:10,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1952744875, now seen corresponding path program 1 times
[2018-10-04 12:15:10,418 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:15:10,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:15:10,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:15:10,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:15:10,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:15:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:15:10,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:15:10,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-04 12:15:10,576 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-04 12:15:10,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:15:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:15:10,592 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-04 12:15:10,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:15:10,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-04 12:15:10,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16
[2018-10-04 12:15:10,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states
[2018-10-04 12:15:10,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2018-10-04 12:15:10,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272
[2018-10-04 12:15:10,793 INFO L87 Difference]: Start difference. First operand 690 states and 1556 transitions. Second operand 17 states.
[2018-10-04 12:15:18,504 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 35
[2018-10-04 12:15:23,469 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 38
[2018-10-04 12:15:26,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:15:26,772 INFO L93 Difference]: Finished difference Result 2011 states and 4412 transitions.
[2018-10-04 12:15:26,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states.
[2018-10-04 12:15:26,772 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16
[2018-10-04 12:15:26,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:15:26,775 INFO L225 Difference]: With dead ends: 2011
[2018-10-04 12:15:26,775 INFO L226 Difference]: Without dead ends: 2003
[2018-10-04 12:15:26,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9561 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=3074, Invalid=22366, Unknown=0, NotChecked=0, Total=25440
[2018-10-04 12:15:26,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states.
[2018-10-04 12:15:28,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1151.
[2018-10-04 12:15:28,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states.
[2018-10-04 12:15:28,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 2622 transitions.
[2018-10-04 12:15:28,010 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 2622 transitions. Word has length 16
[2018-10-04 12:15:28,010 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:15:28,010 INFO L480 AbstractCegarLoop]: Abstraction has 1151 states and 2622 transitions.
[2018-10-04 12:15:28,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states.
[2018-10-04 12:15:28,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 2622 transitions.
[2018-10-04 12:15:28,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-10-04 12:15:28,012 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:15:28,012 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:15:28,012 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:15:28,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:15:28,012 INFO L82 PathProgramCache]: Analyzing trace with hash -51223093, now seen corresponding path program 1 times
[2018-10-04 12:15:28,013 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:15:28,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:15:28,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:15:28,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:15:28,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:15:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:15:28,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:15:28,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-04 12:15:28,095 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-04 12:15:28,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:15:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:15:28,111 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-04 12:15:28,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:15:28,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-04 12:15:28,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16
[2018-10-04 12:15:28,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states
[2018-10-04 12:15:28,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2018-10-04 12:15:28,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272
[2018-10-04 12:15:28,279 INFO L87 Difference]: Start difference. First operand 1151 states and 2622 transitions. Second operand 17 states.
[2018-10-04 12:15:41,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:15:41,039 INFO L93 Difference]: Finished difference Result 2797 states and 6168 transitions.
[2018-10-04 12:15:41,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states.
[2018-10-04 12:15:41,039 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16
[2018-10-04 12:15:41,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:15:41,046 INFO L225 Difference]: With dead ends: 2797
[2018-10-04 12:15:41,046 INFO L226 Difference]: Without dead ends: 2789
[2018-10-04 12:15:41,052 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6171 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2430, Invalid=14862, Unknown=0, NotChecked=0, Total=17292
[2018-10-04 12:15:41,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2789 states.
[2018-10-04 12:15:42,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2789 to 1186.
[2018-10-04 12:15:42,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states.
[2018-10-04 12:15:42,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 2705 transitions.
[2018-10-04 12:15:42,397 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 2705 transitions. Word has length 16
[2018-10-04 12:15:42,397 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:15:42,397 INFO L480 AbstractCegarLoop]: Abstraction has 1186 states and 2705 transitions.
[2018-10-04 12:15:42,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states.
[2018-10-04 12:15:42,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 2705 transitions.
[2018-10-04 12:15:42,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-10-04 12:15:42,398 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:15:42,398 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:15:42,399 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:15:42,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:15:42,399 INFO L82 PathProgramCache]: Analyzing trace with hash -666637335, now seen corresponding path program 1 times
[2018-10-04 12:15:42,399 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:15:42,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:15:42,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:15:42,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:15:42,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:15:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:15:42,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:15:42,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-04 12:15:42,590 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-04 12:15:42,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:15:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:15:42,628 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-04 12:15:42,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-10-04 12:15:42,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-04 12:15:42,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16
[2018-10-04 12:15:42,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states
[2018-10-04 12:15:42,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2018-10-04 12:15:42,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272
[2018-10-04 12:15:42,879 INFO L87 Difference]: Start difference. First operand 1186 states and 2705 transitions. Second operand 17 states.
[2018-10-04 12:15:54,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:15:54,494 INFO L93 Difference]: Finished difference Result 2492 states and 5544 transitions.
[2018-10-04 12:15:54,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states.
[2018-10-04 12:15:54,494 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16
[2018-10-04 12:15:54,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:15:54,502 INFO L225 Difference]: With dead ends: 2492
[2018-10-04 12:15:54,502 INFO L226 Difference]: Without dead ends: 2484
[2018-10-04 12:15:54,506 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-10-04 12:15:54,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states.
[2018-10-04 12:15:56,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 1219.
[2018-10-04 12:15:56,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1219 states.
[2018-10-04 12:15:56,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 2792 transitions.
[2018-10-04 12:15:56,379 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 2792 transitions. Word has length 16
[2018-10-04 12:15:56,379 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:15:56,379 INFO L480 AbstractCegarLoop]: Abstraction has 1219 states and 2792 transitions.
[2018-10-04 12:15:56,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states.
[2018-10-04 12:15:56,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 2792 transitions.
[2018-10-04 12:15:56,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-10-04 12:15:56,380 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:15:56,380 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:15:56,381 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:15:56,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:15:56,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1212722005, now seen corresponding path program 1 times
[2018-10-04 12:15:56,381 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:15:56,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:15:56,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:15:56,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:15:56,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:15:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:15:56,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:15:56,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-04 12:15:56,459 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-04 12:15:56,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:15:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:15:56,485 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-04 12:15:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:15:56,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-10-04 12:15:56,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16
[2018-10-04 12:15:56,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states
[2018-10-04 12:15:56,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2018-10-04 12:15:56,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272
[2018-10-04 12:15:56,764 INFO L87 Difference]: Start difference. First operand 1219 states and 2792 transitions. Second operand 17 states.
[2018-10-04 12:16:01,716 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30
[2018-10-04 12:16:13,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:16:13,629 INFO L93 Difference]: Finished difference Result 3178 states and 7226 transitions.
[2018-10-04 12:16:13,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states.
[2018-10-04 12:16:13,629 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16
[2018-10-04 12:16:13,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:16:13,637 INFO L225 Difference]: With dead ends: 3178
[2018-10-04 12:16:13,637 INFO L226 Difference]: Without dead ends: 3170
[2018-10-04 12:16:13,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9560 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2932, Invalid=21248, Unknown=0, NotChecked=0, Total=24180
[2018-10-04 12:16:13,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states.
[2018-10-04 12:16:15,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 1242.
[2018-10-04 12:16:15,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1242 states.
[2018-10-04 12:16:15,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 2857 transitions.
[2018-10-04 12:16:15,017 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 2857 transitions. Word has length 16
[2018-10-04 12:16:15,017 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:16:15,017 INFO L480 AbstractCegarLoop]: Abstraction has 1242 states and 2857 transitions.
[2018-10-04 12:16:15,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states.
[2018-10-04 12:16:15,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 2857 transitions.
[2018-10-04 12:16:15,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-10-04 12:16:15,018 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:16:15,018 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:16:15,019 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:16:15,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:16:15,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1212619860, now seen corresponding path program 1 times
[2018-10-04 12:16:15,019 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:16:15,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:16:15,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:16:15,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:16:15,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:16:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:16:15,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:16:15,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-04 12:16:15,096 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-04 12:16:15,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:16:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:16:15,114 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-04 12:16:15,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:16:15,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-10-04 12:16:15,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16
[2018-10-04 12:16:15,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states
[2018-10-04 12:16:15,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2018-10-04 12:16:15,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272
[2018-10-04 12:16:15,279 INFO L87 Difference]: Start difference. First operand 1242 states and 2857 transitions. Second operand 17 states.
[2018-10-04 12:16:28,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:16:28,777 INFO L93 Difference]: Finished difference Result 2638 states and 5927 transitions.
[2018-10-04 12:16:28,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states.
[2018-10-04 12:16:28,777 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16
[2018-10-04 12:16:28,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:16:28,781 INFO L225 Difference]: With dead ends: 2638
[2018-10-04 12:16:28,782 INFO L226 Difference]: Without dead ends: 2630
[2018-10-04 12:16:28,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5685 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1807, Invalid=13199, Unknown=0, NotChecked=0, Total=15006
[2018-10-04 12:16:28,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states.
[2018-10-04 12:16:30,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 1469.
[2018-10-04 12:16:30,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states.
[2018-10-04 12:16:30,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 3433 transitions.
[2018-10-04 12:16:30,548 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 3433 transitions. Word has length 16
[2018-10-04 12:16:30,548 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:16:30,549 INFO L480 AbstractCegarLoop]: Abstraction has 1469 states and 3433 transitions.
[2018-10-04 12:16:30,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states.
[2018-10-04 12:16:30,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 3433 transitions.
[2018-10-04 12:16:30,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-10-04 12:16:30,550 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:16:30,550 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:16:30,550 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:16:30,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:16:30,551 INFO L82 PathProgramCache]: Analyzing trace with hash 780585054, now seen corresponding path program 1 times
[2018-10-04 12:16:30,551 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:16:30,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:16:30,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:16:30,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:16:30,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:16:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:16:30,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:16:30,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-04 12:16:30,632 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-04 12:16:30,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:16:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:16:30,648 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-04 12:16:30,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:16:30,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-04 12:16:30,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16
[2018-10-04 12:16:30,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states
[2018-10-04 12:16:30,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2018-10-04 12:16:30,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272
[2018-10-04 12:16:30,809 INFO L87 Difference]: Start difference. First operand 1469 states and 3433 transitions. Second operand 17 states.
[2018-10-04 12:16:44,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:16:44,552 INFO L93 Difference]: Finished difference Result 2854 states and 6510 transitions.
[2018-10-04 12:16:44,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states.
[2018-10-04 12:16:44,553 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16
[2018-10-04 12:16:44,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:16:44,556 INFO L225 Difference]: With dead ends: 2854
[2018-10-04 12:16:44,556 INFO L226 Difference]: Without dead ends: 2846
[2018-10-04 12:16:44,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1456, Invalid=7664, Unknown=0, NotChecked=0, Total=9120
[2018-10-04 12:16:44,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2846 states.
[2018-10-04 12:16:46,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2846 to 1479.
[2018-10-04 12:16:46,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1479 states.
[2018-10-04 12:16:46,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 3457 transitions.
[2018-10-04 12:16:46,304 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 3457 transitions. Word has length 16
[2018-10-04 12:16:46,304 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:16:46,304 INFO L480 AbstractCegarLoop]: Abstraction has 1479 states and 3457 transitions.
[2018-10-04 12:16:46,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states.
[2018-10-04 12:16:46,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 3457 transitions.
[2018-10-04 12:16:46,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-10-04 12:16:46,305 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:16:46,305 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:16:46,306 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:16:46,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:16:46,306 INFO L82 PathProgramCache]: Analyzing trace with hash 165170812, now seen corresponding path program 1 times
[2018-10-04 12:16:46,306 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:16:46,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:16:46,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:16:46,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:16:46,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:16:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:16:46,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:16:46,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-04 12:16:46,391 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-04 12:16:46,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:16:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:16:46,407 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-04 12:16:46,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:16:46,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-04 12:16:46,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16
[2018-10-04 12:16:46,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states
[2018-10-04 12:16:46,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2018-10-04 12:16:46,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272
[2018-10-04 12:16:46,567 INFO L87 Difference]: Start difference. First operand 1479 states and 3457 transitions. Second operand 17 states.
[2018-10-04 12:17:01,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:17:01,964 INFO L93 Difference]: Finished difference Result 3363 states and 7697 transitions.
[2018-10-04 12:17:01,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states.
[2018-10-04 12:17:01,964 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16
[2018-10-04 12:17:01,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:17:01,968 INFO L225 Difference]: With dead ends: 3363
[2018-10-04 12:17:01,968 INFO L226 Difference]: Without dead ends: 3355
[2018-10-04 12:17:01,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3712 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1635, Invalid=9495, Unknown=0, NotChecked=0, Total=11130
[2018-10-04 12:17:01,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states.
[2018-10-04 12:17:03,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 1535.
[2018-10-04 12:17:03,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535 states.
[2018-10-04 12:17:03,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 3580 transitions.
[2018-10-04 12:17:03,821 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 3580 transitions. Word has length 16
[2018-10-04 12:17:03,821 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:17:03,821 INFO L480 AbstractCegarLoop]: Abstraction has 1535 states and 3580 transitions.
[2018-10-04 12:17:03,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states.
[2018-10-04 12:17:03,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 3580 transitions.
[2018-10-04 12:17:03,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-10-04 12:17:03,822 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:17:03,823 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:17:03,823 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:17:03,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:17:03,823 INFO L82 PathProgramCache]: Analyzing trace with hash 723989304, now seen corresponding path program 1 times
[2018-10-04 12:17:03,823 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:17:03,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:17:03,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:17:03,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:17:03,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:17:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:17:04,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:17:04,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-04 12:17:04,604 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-04 12:17:04,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:17:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:17:04,642 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-04 12:17:04,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:17:04,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-04 12:17:04,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17
[2018-10-04 12:17:04,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states
[2018-10-04 12:17:04,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2018-10-04 12:17:04,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306
[2018-10-04 12:17:04,819 INFO L87 Difference]: Start difference. First operand 1535 states and 3580 transitions. Second operand 18 states.
[2018-10-04 12:17:06,326 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17
[2018-10-04 12:17:09,861 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 19
[2018-10-04 12:17:22,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:17:22,086 INFO L93 Difference]: Finished difference Result 2910 states and 6684 transitions.
[2018-10-04 12:17:22,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states.
[2018-10-04 12:17:22,086 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 16
[2018-10-04 12:17:22,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:17:22,090 INFO L225 Difference]: With dead ends: 2910
[2018-10-04 12:17:22,090 INFO L226 Difference]: Without dead ends: 2902
[2018-10-04 12:17:22,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3369 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1407, Invalid=8693, Unknown=0, NotChecked=0, Total=10100
[2018-10-04 12:17:22,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states.
[2018-10-04 12:17:23,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 1226.
[2018-10-04 12:17:23,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states.
[2018-10-04 12:17:23,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 2816 transitions.
[2018-10-04 12:17:23,706 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 2816 transitions. Word has length 16
[2018-10-04 12:17:23,706 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:17:23,706 INFO L480 AbstractCegarLoop]: Abstraction has 1226 states and 2816 transitions.
[2018-10-04 12:17:23,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states.
[2018-10-04 12:17:23,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 2816 transitions.
[2018-10-04 12:17:23,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-10-04 12:17:23,707 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:17:23,707 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:17:23,707 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:17:23,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:17:23,708 INFO L82 PathProgramCache]: Analyzing trace with hash 876461633, now seen corresponding path program 1 times
[2018-10-04 12:17:23,708 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:17:23,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:17:23,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:17:23,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:17:23,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:17:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:17:23,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:17:23,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-04 12:17:23,780 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-10-04 12:17:23,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:17:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:17:23,811 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-04 12:17:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-04 12:17:24,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-04 12:17:24,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16
[2018-10-04 12:17:24,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states
[2018-10-04 12:17:24,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2018-10-04 12:17:24,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272
[2018-10-04 12:17:24,051 INFO L87 Difference]: Start difference. First operand 1226 states and 2816 transitions. Second operand 17 states.
[2018-10-04 12:17:37,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:17:37,915 INFO L93 Difference]: Finished difference Result 2474 states and 5593 transitions.
[2018-10-04 12:17:37,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states.
[2018-10-04 12:17:37,915 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16
[2018-10-04 12:17:37,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:17:37,918 INFO L225 Difference]: With dead ends: 2474
[2018-10-04 12:17:37,918 INFO L226 Difference]: Without dead ends: 2466
[2018-10-04 12:17:37,919 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-10-04 12:17:37,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states.
[2018-10-04 12:17:39,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 1069.
[2018-10-04 12:17:39,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states.
[2018-10-04 12:17:39,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 2444 transitions.
[2018-10-04 12:17:39,278 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 2444 transitions. Word has length 16
[2018-10-04 12:17:39,279 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:17:39,279 INFO L480 AbstractCegarLoop]: Abstraction has 1069 states and 2444 transitions.
[2018-10-04 12:17:39,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states.
[2018-10-04 12:17:39,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 2444 transitions.
[2018-10-04 12:17:39,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-10-04 12:17:39,279 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:17:39,279 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:17:39,280 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:17:39,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:17:39,280 INFO L82 PathProgramCache]: Analyzing trace with hash -345007351, now seen corresponding path program 1 times
[2018-10-04 12:17:39,280 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:17:39,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:17:39,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:17:39,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:17:39,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:17:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:17:39,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-10-04 12:17:39,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-04 12:17:39,357 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-10-04 12:17:39,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:17:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:17:39,372 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-04 12:17:39,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-10-04 12:17:39,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-04 12:17:39,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7
[2018-10-04 12:17:39,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-04 12:17:39,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-04 12:17:39,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2018-10-04 12:17:39,399 INFO L87 Difference]: Start difference. First operand 1069 states and 2444 transitions. Second operand 8 states.
[2018-10-04 12:17:43,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:17:43,079 INFO L93 Difference]: Finished difference Result 1522 states and 3375 transitions.
[2018-10-04 12:17:43,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2018-10-04 12:17:43,080 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16
[2018-10-04 12:17:43,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:17:43,082 INFO L225 Difference]: With dead ends: 1522
[2018-10-04 12:17:43,082 INFO L226 Difference]: Without dead ends: 1514
[2018-10-04 12:17:43,082 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-10-04 12:17:43,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states.
[2018-10-04 12:17:44,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1225.
[2018-10-04 12:17:44,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states.
[2018-10-04 12:17:44,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 2809 transitions.
[2018-10-04 12:17:44,717 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 2809 transitions. Word has length 16
[2018-10-04 12:17:44,717 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:17:44,717 INFO L480 AbstractCegarLoop]: Abstraction has 1225 states and 2809 transitions.
[2018-10-04 12:17:44,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-04 12:17:44,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 2809 transitions.
[2018-10-04 12:17:44,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-10-04 12:17:44,718 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:17:44,718 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:17:44,719 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:17:44,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:17:44,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521947, now seen corresponding path program 1 times
[2018-10-04 12:17:44,719 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:17:44,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:17:44,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:17:44,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:17:44,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:17:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:17:44,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-10-04 12:17:44,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-04 12:17:44,849 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-10-04 12:17:44,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:17:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:17:44,878 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-04 12:17:44,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-10-04 12:17:44,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-04 12:17:44,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7
[2018-10-04 12:17:44,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-04 12:17:44,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-04 12:17:44,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2018-10-04 12:17:44,915 INFO L87 Difference]: Start difference. First operand 1225 states and 2809 transitions. Second operand 8 states.
[2018-10-04 12:17:49,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:17:49,021 INFO L93 Difference]: Finished difference Result 1661 states and 3674 transitions.
[2018-10-04 12:17:49,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2018-10-04 12:17:49,022 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16
[2018-10-04 12:17:49,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:17:49,024 INFO L225 Difference]: With dead ends: 1661
[2018-10-04 12:17:49,024 INFO L226 Difference]: Without dead ends: 1653
[2018-10-04 12:17:49,024 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-10-04 12:17:49,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states.
[2018-10-04 12:17:50,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1237.
[2018-10-04 12:17:50,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states.
[2018-10-04 12:17:50,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 2833 transitions.
[2018-10-04 12:17:50,670 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 2833 transitions. Word has length 16
[2018-10-04 12:17:50,670 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:17:50,670 INFO L480 AbstractCegarLoop]: Abstraction has 1237 states and 2833 transitions.
[2018-10-04 12:17:50,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-04 12:17:50,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 2833 transitions.
[2018-10-04 12:17:50,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-10-04 12:17:50,671 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:17:50,671 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:17:50,671 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:17:50,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:17:50,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1047521668, now seen corresponding path program 1 times
[2018-10-04 12:17:50,671 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:17:50,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:17:50,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:17:50,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:17:50,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:17:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:17:50,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-10-04 12:17:50,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-04 12:17:50,769 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-10-04 12:17:50,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:17:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:17:50,787 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-04 12:17:50,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-10-04 12:17:50,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-04 12:17:50,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7
[2018-10-04 12:17:50,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-04 12:17:50,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-04 12:17:50,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2018-10-04 12:17:50,812 INFO L87 Difference]: Start difference. First operand 1237 states and 2833 transitions. Second operand 8 states.
[2018-10-04 12:17:55,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:17:55,353 INFO L93 Difference]: Finished difference Result 1772 states and 3936 transitions.
[2018-10-04 12:17:55,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2018-10-04 12:17:55,354 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16
[2018-10-04 12:17:55,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:17:55,356 INFO L225 Difference]: With dead ends: 1772
[2018-10-04 12:17:55,356 INFO L226 Difference]: Without dead ends: 1764
[2018-10-04 12:17:55,356 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650
[2018-10-04 12:17:55,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states.
[2018-10-04 12:17:57,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1318.
[2018-10-04 12:17:57,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1318 states.
[2018-10-04 12:17:57,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 3019 transitions.
[2018-10-04 12:17:57,006 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 3019 transitions. Word has length 16
[2018-10-04 12:17:57,006 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:17:57,006 INFO L480 AbstractCegarLoop]: Abstraction has 1318 states and 3019 transitions.
[2018-10-04 12:17:57,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-04 12:17:57,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 3019 transitions.
[2018-10-04 12:17:57,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-10-04 12:17:57,007 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:17:57,007 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:17:57,007 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:17:57,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:17:57,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1133346772, now seen corresponding path program 1 times
[2018-10-04 12:17:57,007 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:17:57,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:17:57,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:17:57,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:17:57,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:17:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:17:57,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-10-04 12:17:57,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-04 12:17:57,227 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-10-04 12:17:57,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:17:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:17:57,243 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-04 12:17:57,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-10-04 12:17:57,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-04 12:17:57,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7
[2018-10-04 12:17:57,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-04 12:17:57,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-04 12:17:57,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2018-10-04 12:17:57,273 INFO L87 Difference]: Start difference. First operand 1318 states and 3019 transitions. Second operand 8 states.
[2018-10-04 12:18:01,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-04 12:18:01,387 INFO L93 Difference]: Finished difference Result 1789 states and 3956 transitions.
[2018-10-04 12:18:01,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2018-10-04 12:18:01,387 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16
[2018-10-04 12:18:01,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-04 12:18:01,389 INFO L225 Difference]: With dead ends: 1789
[2018-10-04 12:18:01,389 INFO L226 Difference]: Without dead ends: 1781
[2018-10-04 12:18:01,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342
[2018-10-04 12:18:01,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states.
[2018-10-04 12:18:03,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1345.
[2018-10-04 12:18:03,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1345 states.
[2018-10-04 12:18:03,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 3076 transitions.
[2018-10-04 12:18:03,060 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 3076 transitions. Word has length 16
[2018-10-04 12:18:03,060 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-04 12:18:03,060 INFO L480 AbstractCegarLoop]: Abstraction has 1345 states and 3076 transitions.
[2018-10-04 12:18:03,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-04 12:18:03,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 3076 transitions.
[2018-10-04 12:18:03,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-10-04 12:18:03,061 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-04 12:18:03,061 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-04 12:18:03,062 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr1ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]===
[2018-10-04 12:18:03,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-04 12:18:03,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1133347051, now seen corresponding path program 1 times
[2018-10-04 12:18:03,062 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-04 12:18:03,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-04 12:18:03,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:18:03,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:18:03,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-04 12:18:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:18:03,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-10-04 12:18:03,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-04 12:18:03,128 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-10-04 12:18:03,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-04 12:18:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-04 12:18:03,143 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-04 12:18:03,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-10-04 12:18:03,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-04 12:18:03,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7
[2018-10-04 12:18:03,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-04 12:18:03,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-04 12:18:03,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2018-10-04 12:18:03,166 INFO L87 Difference]: Start difference. First operand 1345 states and 3076 transitions. Second operand 8 states.
Received shutdown request...
[2018-10-04 12:18:06,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2018-10-04 12:18:06,581 WARN L549 AbstractCegarLoop]: Verification canceled
[2018-10-04 12:18:06,586 WARN L205 ceAbstractionStarter]: Timeout
[2018-10-04 12:18:06,587 INFO L202 PluginConnector]: Adding new model threadpooling_out.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:18:06 BoogieIcfgContainer
[2018-10-04 12:18:06,587 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-10-04 12:18:06,587 INFO L168 Benchmark]: Toolchain (without parser) took 254441.69 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 393.7 MB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 203.5 MB). Peak memory consumption was 597.2 MB. Max. memory is 7.1 GB.
[2018-10-04 12:18:06,588 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-10-04 12:18:06,589 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-10-04 12:18:06,589 INFO L168 Benchmark]: Boogie Preprocessor took 56.58 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-10-04 12:18:06,590 INFO L168 Benchmark]: RCFGBuilder took 1024.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB.
[2018-10-04 12:18:06,590 INFO L168 Benchmark]: TraceAbstraction took 253308.05 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 393.7 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 171.8 MB). Peak memory consumption was 565.5 MB. Max. memory is 7.1 GB.
[2018-10-04 12:18:06,593 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
* Boogie Procedure Inliner took 47.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
* Boogie Preprocessor took 56.58 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
* RCFGBuilder took 1024.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 253308.05 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 393.7 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 171.8 MB). Peak memory consumption was 565.5 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- 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 (939 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 (939 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 (939 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 (939 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 (939 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 (939 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 (939 states constructedinput type IntersectNwa).
- TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction)
Unable to prove that assertion always holds (line 54). Cancelled while BasicCegarLoop was constructing difference of abstraction (1345states) and FLOYD_HOARE automaton (currently 20 states, 8 states before enhancement), while ReachableStatesComputation was computing reachable states (939 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 (939 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 (939 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 (939 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 (939 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 (939 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 (939 states constructedinput type IntersectNwa).
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 66 locations, 14 error locations. TIMEOUT Result, 253.2s OverallTime, 41 OverallIterations, 2 TraceHistogramMax, 216.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12309 SDtfs, 41093 SDslu, 49205 SDs, 0 SdLazy, 119301 SolverSat, 8873 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 107.3s 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: 26.5s AutomataMinimizationTime, 40 MinimizatonAttempts, 26535 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.7s 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-10-04_12-18-06-610.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-10-04_12-18-06-610.csv
Completed graceful shutdown