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_product_WithoutIf.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-00a8621 [2018-09-30 10:15:04,208 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:15:04,210 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:15:04,222 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:15:04,222 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:15:04,223 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:15:04,225 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:15:04,226 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:15:04,228 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:15:04,229 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:15:04,230 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:15:04,230 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:15:04,231 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:15:04,232 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:15:04,233 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:15:04,234 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:15:04,235 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:15:04,237 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:15:04,239 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:15:04,241 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:15:04,242 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:15:04,243 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:15:04,246 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:15:04,246 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:15:04,246 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:15:04,247 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:15:04,248 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:15:04,249 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:15:04,250 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:15:04,251 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:15:04,251 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:15:04,252 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:15:04,252 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:15:04,253 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:15:04,254 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:15:04,255 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:15:04,256 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 10:15:04,283 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:15:04,283 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:15:04,284 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:15:04,284 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:15:04,285 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:15:04,285 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:15:04,286 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:15:04,286 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:15:04,286 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:15:04,286 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:15:04,286 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:15:04,287 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:15:04,287 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:15:04,287 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:15:04,287 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:15:04,287 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:15:04,288 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:15:04,288 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:15:04,288 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:15:04,288 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:15:04,288 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:15:04,289 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:15:04,289 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:15:04,289 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:15:04,289 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:15:04,289 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:15:04,290 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:15:04,290 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:15:04,290 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:15:04,290 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:15:04,350 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:15:04,365 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:15:04,369 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:15:04,371 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:15:04,371 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:15:04,372 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl [2018-09-30 10:15:04,373 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl' [2018-09-30 10:15:04,433 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:15:04,438 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:15:04,439 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:15:04,439 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:15:04,439 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:15:04,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:15:04" (1/1) ... [2018-09-30 10:15:04,472 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:15:04" (1/1) ... [2018-09-30 10:15:04,477 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 10:15:04,477 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 10:15:04,477 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 10:15:04,479 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:15:04,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:15:04,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:15:04,481 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:15:04,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:15:04" (1/1) ... [2018-09-30 10:15:04,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:15:04" (1/1) ... [2018-09-30 10:15:04,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:15:04" (1/1) ... [2018-09-30 10:15:04,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:15:04" (1/1) ... [2018-09-30 10:15:04,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:15:04" (1/1) ... [2018-09-30 10:15:04,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:15:04" (1/1) ... [2018-09-30 10:15:04,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:15:04" (1/1) ... [2018-09-30 10:15:04,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:15:04,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:15:04,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:15:04,506 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:15:04,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:15:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:15:04,578 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-30 10:15:04,578 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-30 10:15:04,579 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-30 10:15:04,976 INFO L345 CfgBuilder]: Using library mode [2018-09-30 10:15:04,977 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:15:04 BoogieIcfgContainer [2018-09-30 10:15:04,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:15:04,978 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:15:04,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:15:04,981 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:15:04,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:15:04" (1/2) ... [2018-09-30 10:15:04,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b09fc90 and model type threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:15:04, skipping insertion in model container [2018-09-30 10:15:04,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:15:04" (2/2) ... [2018-09-30 10:15:04,985 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithoutIf.bpl [2018-09-30 10:15:04,995 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:15:05,008 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-09-30 10:15:05,069 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:15:05,070 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:15:05,070 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:15:05,070 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:15:05,070 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:15:05,070 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:15:05,071 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:15:05,071 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:15:05,071 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:15:05,090 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-09-30 10:15:05,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-30 10:15:05,105 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:05,108 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-30 10:15:05,110 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:05,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:05,118 INFO L82 PathProgramCache]: Analyzing trace with hash 927686, now seen corresponding path program 1 times [2018-09-30 10:15:05,121 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:05,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:05,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:05,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:05,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:05,335 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:05,335 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:15:05,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:15:05,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:15:05,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:15:05,352 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2018-09-30 10:15:05,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:05,916 INFO L93 Difference]: Finished difference Result 32 states and 51 transitions. [2018-09-30 10:15:05,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 10:15:05,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-09-30 10:15:05,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:05,932 INFO L225 Difference]: With dead ends: 32 [2018-09-30 10:15:05,933 INFO L226 Difference]: Without dead ends: 30 [2018-09-30 10:15:05,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-30 10:15:05,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-30 10:15:05,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-09-30 10:15:05,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-30 10:15:05,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2018-09-30 10:15:05,978 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 4 [2018-09-30 10:15:05,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:05,979 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 37 transitions. [2018-09-30 10:15:05,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:15:05,979 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-09-30 10:15:05,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-30 10:15:05,980 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:05,980 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-30 10:15:05,981 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:05,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:05,981 INFO L82 PathProgramCache]: Analyzing trace with hash 930088, now seen corresponding path program 1 times [2018-09-30 10:15:05,981 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:05,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:05,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:05,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:05,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:06,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:06,061 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:06,061 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 10:15:06,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:15:06,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:15:06,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-30 10:15:06,063 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. Second operand 5 states. [2018-09-30 10:15:06,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:06,412 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2018-09-30 10:15:06,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 10:15:06,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-09-30 10:15:06,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:06,414 INFO L225 Difference]: With dead ends: 38 [2018-09-30 10:15:06,414 INFO L226 Difference]: Without dead ends: 36 [2018-09-30 10:15:06,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-30 10:15:06,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-30 10:15:06,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-09-30 10:15:06,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-30 10:15:06,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 47 transitions. [2018-09-30 10:15:06,423 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 47 transitions. Word has length 4 [2018-09-30 10:15:06,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:06,424 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 47 transitions. [2018-09-30 10:15:06,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:15:06,424 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 47 transitions. [2018-09-30 10:15:06,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 10:15:06,425 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:06,425 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 10:15:06,426 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:06,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:06,426 INFO L82 PathProgramCache]: Analyzing trace with hash 28768015, now seen corresponding path program 1 times [2018-09-30 10:15:06,426 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:06,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:06,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:06,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:06,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:06,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:06,535 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:06,536 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:15:06,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 10:15:06,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 10:15:06,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-30 10:15:06,537 INFO L87 Difference]: Start difference. First operand 30 states and 47 transitions. Second operand 6 states. [2018-09-30 10:15:07,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:07,396 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2018-09-30 10:15:07,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 10:15:07,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-09-30 10:15:07,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:07,399 INFO L225 Difference]: With dead ends: 43 [2018-09-30 10:15:07,399 INFO L226 Difference]: Without dead ends: 41 [2018-09-30 10:15:07,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-09-30 10:15:07,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-30 10:15:07,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-09-30 10:15:07,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-30 10:15:07,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2018-09-30 10:15:07,414 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 5 [2018-09-30 10:15:07,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:07,415 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2018-09-30 10:15:07,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 10:15:07,415 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2018-09-30 10:15:07,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 10:15:07,418 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:07,418 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-09-30 10:15:07,420 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:07,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:07,420 INFO L82 PathProgramCache]: Analyzing trace with hash 28831153, now seen corresponding path program 1 times [2018-09-30 10:15:07,420 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:07,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:07,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:07,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:07,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:07,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:07,476 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:07,477 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 10:15:07,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 10:15:07,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 10:15:07,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-30 10:15:07,478 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand 6 states. [2018-09-30 10:15:07,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:07,787 INFO L93 Difference]: Finished difference Result 54 states and 89 transitions. [2018-09-30 10:15:07,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 10:15:07,789 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-09-30 10:15:07,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:07,790 INFO L225 Difference]: With dead ends: 54 [2018-09-30 10:15:07,790 INFO L226 Difference]: Without dead ends: 52 [2018-09-30 10:15:07,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:15:07,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-30 10:15:07,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2018-09-30 10:15:07,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-30 10:15:07,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 70 transitions. [2018-09-30 10:15:07,812 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 70 transitions. Word has length 5 [2018-09-30 10:15:07,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:07,814 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 70 transitions. [2018-09-30 10:15:07,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 10:15:07,814 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 70 transitions. [2018-09-30 10:15:07,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:15:07,815 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:07,816 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:07,816 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:07,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:07,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1974033510, now seen corresponding path program 1 times [2018-09-30 10:15:07,817 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:07,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:07,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:07,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:07,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:07,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:07,987 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:07,987 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:07,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:08,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:08,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:08,263 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:08,263 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-09-30 10:15:08,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:15:08,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:15:08,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-09-30 10:15:08,264 INFO L87 Difference]: Start difference. First operand 43 states and 70 transitions. Second operand 14 states. [2018-09-30 10:15:09,582 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-09-30 10:15:09,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:09,931 INFO L93 Difference]: Finished difference Result 107 states and 168 transitions. [2018-09-30 10:15:09,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-30 10:15:09,932 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2018-09-30 10:15:09,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:09,934 INFO L225 Difference]: With dead ends: 107 [2018-09-30 10:15:09,934 INFO L226 Difference]: Without dead ends: 106 [2018-09-30 10:15:09,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2018-09-30 10:15:09,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-30 10:15:09,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 64. [2018-09-30 10:15:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-30 10:15:09,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 109 transitions. [2018-09-30 10:15:09,950 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 109 transitions. Word has length 8 [2018-09-30 10:15:09,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:09,951 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 109 transitions. [2018-09-30 10:15:09,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:15:09,951 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 109 transitions. [2018-09-30 10:15:09,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:15:09,952 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:09,952 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:09,953 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:09,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:09,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1974032228, now seen corresponding path program 1 times [2018-09-30 10:15:09,953 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:09,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:09,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:09,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:09,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:10,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:10,091 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:10,091 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:15:10,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:15:10,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:15:10,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:15:10,093 INFO L87 Difference]: Start difference. First operand 64 states and 109 transitions. Second operand 8 states. [2018-09-30 10:15:10,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:10,459 INFO L93 Difference]: Finished difference Result 95 states and 152 transitions. [2018-09-30 10:15:10,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 10:15:10,460 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 10:15:10,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:10,461 INFO L225 Difference]: With dead ends: 95 [2018-09-30 10:15:10,461 INFO L226 Difference]: Without dead ends: 93 [2018-09-30 10:15:10,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-09-30 10:15:10,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-30 10:15:10,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 77. [2018-09-30 10:15:10,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-30 10:15:10,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 134 transitions. [2018-09-30 10:15:10,479 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 134 transitions. Word has length 8 [2018-09-30 10:15:10,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:10,480 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 134 transitions. [2018-09-30 10:15:10,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:15:10,480 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 134 transitions. [2018-09-30 10:15:10,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:15:10,481 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:10,481 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:10,482 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:10,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:10,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445341, now seen corresponding path program 1 times [2018-09-30 10:15:10,482 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:10,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:10,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:10,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:10,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:10,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:10,560 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:10,560 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:10,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:10,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:10,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:10,788 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:10,789 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-09-30 10:15:10,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 10:15:10,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 10:15:10,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-09-30 10:15:10,790 INFO L87 Difference]: Start difference. First operand 77 states and 134 transitions. Second operand 13 states. [2018-09-30 10:15:12,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:12,558 INFO L93 Difference]: Finished difference Result 150 states and 246 transitions. [2018-09-30 10:15:12,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 10:15:12,568 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-09-30 10:15:12,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:12,569 INFO L225 Difference]: With dead ends: 150 [2018-09-30 10:15:12,569 INFO L226 Difference]: Without dead ends: 148 [2018-09-30 10:15:12,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=329, Invalid=1003, Unknown=0, NotChecked=0, Total=1332 [2018-09-30 10:15:12,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-09-30 10:15:12,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 106. [2018-09-30 10:15:12,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-09-30 10:15:12,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 185 transitions. [2018-09-30 10:15:12,632 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 185 transitions. Word has length 8 [2018-09-30 10:15:12,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:12,632 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 185 transitions. [2018-09-30 10:15:12,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 10:15:12,636 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 185 transitions. [2018-09-30 10:15:12,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:15:12,637 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:12,637 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:12,640 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:12,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:12,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445053, now seen corresponding path program 1 times [2018-09-30 10:15:12,640 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:12,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:12,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:12,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:12,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:12,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:12,741 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:12,741 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:12,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:12,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:12,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:12,997 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:12,998 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2018-09-30 10:15:12,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 10:15:12,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 10:15:12,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-09-30 10:15:12,999 INFO L87 Difference]: Start difference. First operand 106 states and 185 transitions. Second operand 13 states. [2018-09-30 10:15:14,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:14,089 INFO L93 Difference]: Finished difference Result 137 states and 241 transitions. [2018-09-30 10:15:14,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 10:15:14,093 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-09-30 10:15:14,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:14,094 INFO L225 Difference]: With dead ends: 137 [2018-09-30 10:15:14,094 INFO L226 Difference]: Without dead ends: 135 [2018-09-30 10:15:14,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-09-30 10:15:14,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-30 10:15:14,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 111. [2018-09-30 10:15:14,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-30 10:15:14,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 194 transitions. [2018-09-30 10:15:14,124 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 194 transitions. Word has length 8 [2018-09-30 10:15:14,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:14,131 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 194 transitions. [2018-09-30 10:15:14,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 10:15:14,131 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 194 transitions. [2018-09-30 10:15:14,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:15:14,132 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:14,133 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:14,134 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:14,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:14,134 INFO L82 PathProgramCache]: Analyzing trace with hash 2040447037, now seen corresponding path program 1 times [2018-09-30 10:15:14,135 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:14,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:14,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:14,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:14,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:14,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:14,289 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:14,290 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:14,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:14,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:14,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:14,494 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:14,494 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-09-30 10:15:14,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-30 10:15:14,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-30 10:15:14,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-09-30 10:15:14,495 INFO L87 Difference]: Start difference. First operand 111 states and 194 transitions. Second operand 12 states. [2018-09-30 10:15:15,262 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-30 10:15:15,605 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-30 10:15:16,456 WARN L178 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-09-30 10:15:16,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:16,730 INFO L93 Difference]: Finished difference Result 211 states and 359 transitions. [2018-09-30 10:15:16,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 10:15:16,730 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2018-09-30 10:15:16,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:16,731 INFO L225 Difference]: With dead ends: 211 [2018-09-30 10:15:16,732 INFO L226 Difference]: Without dead ends: 209 [2018-09-30 10:15:16,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=292, Invalid=764, Unknown=0, NotChecked=0, Total=1056 [2018-09-30 10:15:16,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-09-30 10:15:16,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 173. [2018-09-30 10:15:16,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-30 10:15:16,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 304 transitions. [2018-09-30 10:15:16,763 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 304 transitions. Word has length 8 [2018-09-30 10:15:16,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:16,764 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 304 transitions. [2018-09-30 10:15:16,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-30 10:15:16,764 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 304 transitions. [2018-09-30 10:15:16,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:15:16,765 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:16,765 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:16,765 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:16,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:16,765 INFO L82 PathProgramCache]: Analyzing trace with hash -84509544, now seen corresponding path program 1 times [2018-09-30 10:15:16,766 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:16,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:16,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:16,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:16,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:16,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:16,838 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:16,838 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:16,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:16,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:16,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:16,934 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:16,934 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-09-30 10:15:16,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 10:15:16,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 10:15:16,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-09-30 10:15:16,935 INFO L87 Difference]: Start difference. First operand 173 states and 304 transitions. Second operand 10 states. [2018-09-30 10:15:17,535 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2018-09-30 10:15:18,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:18,148 INFO L93 Difference]: Finished difference Result 246 states and 415 transitions. [2018-09-30 10:15:18,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 10:15:18,149 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2018-09-30 10:15:18,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:18,150 INFO L225 Difference]: With dead ends: 246 [2018-09-30 10:15:18,151 INFO L226 Difference]: Without dead ends: 245 [2018-09-30 10:15:18,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-09-30 10:15:18,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-09-30 10:15:18,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 201. [2018-09-30 10:15:18,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-30 10:15:18,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 358 transitions. [2018-09-30 10:15:18,186 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 358 transitions. Word has length 8 [2018-09-30 10:15:18,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:18,187 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 358 transitions. [2018-09-30 10:15:18,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 10:15:18,187 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 358 transitions. [2018-09-30 10:15:18,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:15:18,187 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:18,188 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:18,188 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:18,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:18,188 INFO L82 PathProgramCache]: Analyzing trace with hash -84508262, now seen corresponding path program 1 times [2018-09-30 10:15:18,189 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:18,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:18,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:18,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:18,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:18,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:18,350 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:18,350 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:18,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:18,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:18,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:18,394 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:18,395 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-09-30 10:15:18,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:15:18,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:15:18,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:15:18,397 INFO L87 Difference]: Start difference. First operand 201 states and 358 transitions. Second operand 7 states. [2018-09-30 10:15:18,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:18,934 INFO L93 Difference]: Finished difference Result 252 states and 436 transitions. [2018-09-30 10:15:18,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 10:15:18,935 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:15:18,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:18,936 INFO L225 Difference]: With dead ends: 252 [2018-09-30 10:15:18,937 INFO L226 Difference]: Without dead ends: 250 [2018-09-30 10:15:18,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-09-30 10:15:18,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-09-30 10:15:18,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 210. [2018-09-30 10:15:18,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-09-30 10:15:18,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 375 transitions. [2018-09-30 10:15:18,971 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 375 transitions. Word has length 8 [2018-09-30 10:15:18,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:18,971 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 375 transitions. [2018-09-30 10:15:18,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:15:18,971 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 375 transitions. [2018-09-30 10:15:18,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:15:18,972 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:18,972 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:18,972 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:18,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:18,973 INFO L82 PathProgramCache]: Analyzing trace with hash -75921375, now seen corresponding path program 1 times [2018-09-30 10:15:18,973 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:18,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:18,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:18,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:18,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:19,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:19,040 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:19,040 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:19,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:19,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:19,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:19,148 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:19,149 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-09-30 10:15:19,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 10:15:19,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 10:15:19,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-09-30 10:15:19,150 INFO L87 Difference]: Start difference. First operand 210 states and 375 transitions. Second operand 10 states. [2018-09-30 10:15:19,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:19,467 INFO L93 Difference]: Finished difference Result 260 states and 452 transitions. [2018-09-30 10:15:19,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 10:15:19,475 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2018-09-30 10:15:19,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:19,476 INFO L225 Difference]: With dead ends: 260 [2018-09-30 10:15:19,476 INFO L226 Difference]: Without dead ends: 259 [2018-09-30 10:15:19,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-09-30 10:15:19,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-09-30 10:15:19,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 229. [2018-09-30 10:15:19,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-09-30 10:15:19,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 409 transitions. [2018-09-30 10:15:19,513 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 409 transitions. Word has length 8 [2018-09-30 10:15:19,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:19,514 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 409 transitions. [2018-09-30 10:15:19,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 10:15:19,514 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 409 transitions. [2018-09-30 10:15:19,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:15:19,515 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:19,515 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:19,515 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:19,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:19,515 INFO L82 PathProgramCache]: Analyzing trace with hash -75920285, now seen corresponding path program 1 times [2018-09-30 10:15:19,516 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:19,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:19,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:19,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:19,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:19,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:19,608 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:19,608 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-30 10:15:19,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:15:19,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:15:19,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:15:19,609 INFO L87 Difference]: Start difference. First operand 229 states and 409 transitions. Second operand 7 states. [2018-09-30 10:15:20,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:20,249 INFO L93 Difference]: Finished difference Result 316 states and 557 transitions. [2018-09-30 10:15:20,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:15:20,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:15:20,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:20,252 INFO L225 Difference]: With dead ends: 316 [2018-09-30 10:15:20,252 INFO L226 Difference]: Without dead ends: 314 [2018-09-30 10:15:20,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-09-30 10:15:20,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-09-30 10:15:20,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 245. [2018-09-30 10:15:20,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-09-30 10:15:20,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 438 transitions. [2018-09-30 10:15:20,295 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 438 transitions. Word has length 8 [2018-09-30 10:15:20,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:20,296 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 438 transitions. [2018-09-30 10:15:20,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:15:20,296 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 438 transitions. [2018-09-30 10:15:20,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:15:20,297 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:20,297 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:20,297 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:20,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:20,298 INFO L82 PathProgramCache]: Analyzing trace with hash -35778354, now seen corresponding path program 1 times [2018-09-30 10:15:20,298 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:20,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:20,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:20,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:20,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:20,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:20,363 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:20,363 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:20,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:20,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:20,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:20,419 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:20,419 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-09-30 10:15:20,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:15:20,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:15:20,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:15:20,420 INFO L87 Difference]: Start difference. First operand 245 states and 438 transitions. Second operand 7 states. [2018-09-30 10:15:20,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:20,878 INFO L93 Difference]: Finished difference Result 428 states and 767 transitions. [2018-09-30 10:15:20,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 10:15:20,879 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-09-30 10:15:20,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:20,883 INFO L225 Difference]: With dead ends: 428 [2018-09-30 10:15:20,883 INFO L226 Difference]: Without dead ends: 426 [2018-09-30 10:15:20,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-09-30 10:15:20,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-09-30 10:15:20,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 345. [2018-09-30 10:15:20,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-09-30 10:15:20,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 622 transitions. [2018-09-30 10:15:20,944 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 622 transitions. Word has length 8 [2018-09-30 10:15:20,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:20,945 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 622 transitions. [2018-09-30 10:15:20,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:15:20,945 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 622 transitions. [2018-09-30 10:15:20,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 10:15:20,945 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:20,946 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:20,946 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:20,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:20,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1740000584, now seen corresponding path program 1 times [2018-09-30 10:15:20,946 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:20,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:20,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:20,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:20,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:21,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:21,163 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:21,163 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:21,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:21,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:21,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:21,225 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:21,225 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-09-30 10:15:21,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 10:15:21,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 10:15:21,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-09-30 10:15:21,226 INFO L87 Difference]: Start difference. First operand 345 states and 622 transitions. Second operand 10 states. [2018-09-30 10:15:22,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:22,431 INFO L93 Difference]: Finished difference Result 466 states and 826 transitions. [2018-09-30 10:15:22,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 10:15:22,432 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-09-30 10:15:22,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:22,435 INFO L225 Difference]: With dead ends: 466 [2018-09-30 10:15:22,435 INFO L226 Difference]: Without dead ends: 464 [2018-09-30 10:15:22,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2018-09-30 10:15:22,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-09-30 10:15:22,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 351. [2018-09-30 10:15:22,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-09-30 10:15:22,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 634 transitions. [2018-09-30 10:15:22,518 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 634 transitions. Word has length 11 [2018-09-30 10:15:22,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:22,519 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 634 transitions. [2018-09-30 10:15:22,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 10:15:22,519 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 634 transitions. [2018-09-30 10:15:22,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 10:15:22,520 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:22,520 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:22,520 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:22,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:22,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1701828094, now seen corresponding path program 1 times [2018-09-30 10:15:22,521 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:22,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:22,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:22,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:22,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:23,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:23,088 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:23,089 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:23,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:23,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:23,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:23,221 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-09-30 10:15:23,221 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 14 [2018-09-30 10:15:23,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:15:23,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:15:23,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-09-30 10:15:23,222 INFO L87 Difference]: Start difference. First operand 351 states and 634 transitions. Second operand 14 states. [2018-09-30 10:15:25,175 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-09-30 10:15:25,878 WARN L178 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2018-09-30 10:15:26,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:26,076 INFO L93 Difference]: Finished difference Result 859 states and 1521 transitions. [2018-09-30 10:15:26,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-30 10:15:26,077 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 11 [2018-09-30 10:15:26,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:26,080 INFO L225 Difference]: With dead ends: 859 [2018-09-30 10:15:26,080 INFO L226 Difference]: Without dead ends: 509 [2018-09-30 10:15:26,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=375, Invalid=1881, Unknown=0, NotChecked=0, Total=2256 [2018-09-30 10:15:26,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-09-30 10:15:26,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 388. [2018-09-30 10:15:26,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-09-30 10:15:26,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 697 transitions. [2018-09-30 10:15:26,166 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 697 transitions. Word has length 11 [2018-09-30 10:15:26,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:26,166 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 697 transitions. [2018-09-30 10:15:26,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:15:26,167 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 697 transitions. [2018-09-30 10:15:26,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 10:15:26,167 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:26,167 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:26,168 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:26,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:26,168 INFO L82 PathProgramCache]: Analyzing trace with hash 707064552, now seen corresponding path program 1 times [2018-09-30 10:15:26,168 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:26,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:26,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:26,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:26,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:26,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:26,339 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:26,339 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-30 10:15:26,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:15:26,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:15:26,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:15:26,340 INFO L87 Difference]: Start difference. First operand 388 states and 697 transitions. Second operand 8 states. [2018-09-30 10:15:26,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:26,990 INFO L93 Difference]: Finished difference Result 481 states and 848 transitions. [2018-09-30 10:15:26,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:15:26,991 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-09-30 10:15:26,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:26,993 INFO L225 Difference]: With dead ends: 481 [2018-09-30 10:15:26,993 INFO L226 Difference]: Without dead ends: 479 [2018-09-30 10:15:26,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2018-09-30 10:15:26,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-09-30 10:15:27,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 394. [2018-09-30 10:15:27,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-09-30 10:15:27,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 703 transitions. [2018-09-30 10:15:27,096 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 703 transitions. Word has length 11 [2018-09-30 10:15:27,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:27,100 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 703 transitions. [2018-09-30 10:15:27,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:15:27,101 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 703 transitions. [2018-09-30 10:15:27,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 10:15:27,101 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:27,102 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:27,102 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:27,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:27,102 INFO L82 PathProgramCache]: Analyzing trace with hash 739509354, now seen corresponding path program 1 times [2018-09-30 10:15:27,102 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:27,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:27,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:27,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:27,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:27,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:27,578 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:27,578 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:27,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:27,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:28,159 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-09-30 10:15:28,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:28,944 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:28,945 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-09-30 10:15:28,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 10:15:28,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 10:15:28,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-09-30 10:15:28,946 INFO L87 Difference]: Start difference. First operand 394 states and 703 transitions. Second operand 13 states. [2018-09-30 10:15:30,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:30,301 INFO L93 Difference]: Finished difference Result 952 states and 1676 transitions. [2018-09-30 10:15:30,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 10:15:30,301 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-09-30 10:15:30,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:30,304 INFO L225 Difference]: With dead ends: 952 [2018-09-30 10:15:30,304 INFO L226 Difference]: Without dead ends: 559 [2018-09-30 10:15:30,306 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2018-09-30 10:15:30,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-09-30 10:15:30,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 473. [2018-09-30 10:15:30,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-09-30 10:15:30,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 835 transitions. [2018-09-30 10:15:30,391 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 835 transitions. Word has length 11 [2018-09-30 10:15:30,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:30,391 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 835 transitions. [2018-09-30 10:15:30,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 10:15:30,392 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 835 transitions. [2018-09-30 10:15:30,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 10:15:30,392 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:30,392 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:30,393 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:30,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:30,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1106731073, now seen corresponding path program 1 times [2018-09-30 10:15:30,393 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:30,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:30,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:30,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:30,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:30,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:30,498 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:15:30,498 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-30 10:15:30,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:15:30,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:15:30,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:15:30,499 INFO L87 Difference]: Start difference. First operand 473 states and 835 transitions. Second operand 8 states. [2018-09-30 10:15:30,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:30,879 INFO L93 Difference]: Finished difference Result 524 states and 904 transitions. [2018-09-30 10:15:30,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:15:30,886 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-09-30 10:15:30,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:30,889 INFO L225 Difference]: With dead ends: 524 [2018-09-30 10:15:30,889 INFO L226 Difference]: Without dead ends: 522 [2018-09-30 10:15:30,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-09-30 10:15:30,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-09-30 10:15:30,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 485. [2018-09-30 10:15:30,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-09-30 10:15:31,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 855 transitions. [2018-09-30 10:15:31,000 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 855 transitions. Word has length 11 [2018-09-30 10:15:31,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:31,001 INFO L480 AbstractCegarLoop]: Abstraction has 485 states and 855 transitions. [2018-09-30 10:15:31,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:15:31,001 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 855 transitions. [2018-09-30 10:15:31,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 10:15:31,002 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:31,002 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:31,002 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:31,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:31,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1098144186, now seen corresponding path program 1 times [2018-09-30 10:15:31,003 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:31,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:31,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:31,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:31,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:31,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:31,471 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:31,471 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:31,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:31,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:31,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:31,857 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:31,858 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-09-30 10:15:31,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:15:31,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:15:31,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:15:31,861 INFO L87 Difference]: Start difference. First operand 485 states and 855 transitions. Second operand 9 states. [2018-09-30 10:15:33,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:33,034 INFO L93 Difference]: Finished difference Result 556 states and 964 transitions. [2018-09-30 10:15:33,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 10:15:33,040 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-09-30 10:15:33,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:33,042 INFO L225 Difference]: With dead ends: 556 [2018-09-30 10:15:33,043 INFO L226 Difference]: Without dead ends: 554 [2018-09-30 10:15:33,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-09-30 10:15:33,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-09-30 10:15:33,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 489. [2018-09-30 10:15:33,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-09-30 10:15:33,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 861 transitions. [2018-09-30 10:15:33,146 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 861 transitions. Word has length 11 [2018-09-30 10:15:33,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:33,147 INFO L480 AbstractCegarLoop]: Abstraction has 489 states and 861 transitions. [2018-09-30 10:15:33,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:15:33,147 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 861 transitions. [2018-09-30 10:15:33,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 10:15:33,147 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:33,148 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:33,148 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:33,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:33,148 INFO L82 PathProgramCache]: Analyzing trace with hash -772910566, now seen corresponding path program 1 times [2018-09-30 10:15:33,148 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:33,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:33,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:33,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:33,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:33,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:33,262 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:33,262 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:33,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:33,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:33,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:33,390 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:33,390 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 12 [2018-09-30 10:15:33,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 10:15:33,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 10:15:33,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-09-30 10:15:33,391 INFO L87 Difference]: Start difference. First operand 489 states and 861 transitions. Second operand 13 states. [2018-09-30 10:15:34,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:34,540 INFO L93 Difference]: Finished difference Result 631 states and 1077 transitions. [2018-09-30 10:15:34,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 10:15:34,540 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-09-30 10:15:34,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:34,543 INFO L225 Difference]: With dead ends: 631 [2018-09-30 10:15:34,544 INFO L226 Difference]: Without dead ends: 629 [2018-09-30 10:15:34,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=200, Invalid=792, Unknown=0, NotChecked=0, Total=992 [2018-09-30 10:15:34,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-09-30 10:15:34,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 513. [2018-09-30 10:15:34,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-09-30 10:15:34,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 904 transitions. [2018-09-30 10:15:34,651 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 904 transitions. Word has length 11 [2018-09-30 10:15:34,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:34,651 INFO L480 AbstractCegarLoop]: Abstraction has 513 states and 904 transitions. [2018-09-30 10:15:34,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 10:15:34,651 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 904 transitions. [2018-09-30 10:15:34,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 10:15:34,652 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:34,652 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:34,652 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:34,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:34,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1674153000, now seen corresponding path program 2 times [2018-09-30 10:15:34,653 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:34,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:34,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:34,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:34,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:34,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:34,754 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:34,754 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:34,766 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:15:34,772 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:15:34,772 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:15:34,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:34,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:34,797 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:34,797 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-30 10:15:34,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:15:34,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:15:34,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:15:34,798 INFO L87 Difference]: Start difference. First operand 513 states and 904 transitions. Second operand 7 states. [2018-09-30 10:15:35,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:35,292 INFO L93 Difference]: Finished difference Result 601 states and 1040 transitions. [2018-09-30 10:15:35,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:15:35,294 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-30 10:15:35,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:35,297 INFO L225 Difference]: With dead ends: 601 [2018-09-30 10:15:35,297 INFO L226 Difference]: Without dead ends: 599 [2018-09-30 10:15:35,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-09-30 10:15:35,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-09-30 10:15:35,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 509. [2018-09-30 10:15:35,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-09-30 10:15:35,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 898 transitions. [2018-09-30 10:15:35,431 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 898 transitions. Word has length 11 [2018-09-30 10:15:35,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:35,432 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 898 transitions. [2018-09-30 10:15:35,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:15:35,432 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 898 transitions. [2018-09-30 10:15:35,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 10:15:35,433 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:35,433 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:35,433 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:35,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:35,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1682742259, now seen corresponding path program 1 times [2018-09-30 10:15:35,433 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:35,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:35,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:35,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:15:35,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:35,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:35,539 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:35,539 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:35,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:35,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:35,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:35,576 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:35,577 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-30 10:15:35,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:15:35,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:15:35,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:15:35,577 INFO L87 Difference]: Start difference. First operand 509 states and 898 transitions. Second operand 7 states. [2018-09-30 10:15:36,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:36,063 INFO L93 Difference]: Finished difference Result 624 states and 1088 transitions. [2018-09-30 10:15:36,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 10:15:36,064 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-30 10:15:36,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:36,066 INFO L225 Difference]: With dead ends: 624 [2018-09-30 10:15:36,066 INFO L226 Difference]: Without dead ends: 622 [2018-09-30 10:15:36,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-09-30 10:15:36,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2018-09-30 10:15:36,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 538. [2018-09-30 10:15:36,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-09-30 10:15:36,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 949 transitions. [2018-09-30 10:15:36,170 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 949 transitions. Word has length 11 [2018-09-30 10:15:36,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:36,170 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 949 transitions. [2018-09-30 10:15:36,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:15:36,170 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 949 transitions. [2018-09-30 10:15:36,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 10:15:36,171 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:36,171 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:36,171 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:36,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:36,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1927251354, now seen corresponding path program 1 times [2018-09-30 10:15:36,172 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:36,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:36,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:36,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:36,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:36,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:36,234 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:36,234 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:36,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:36,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:36,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:36,278 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:36,278 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-30 10:15:36,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:15:36,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:15:36,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:15:36,279 INFO L87 Difference]: Start difference. First operand 538 states and 949 transitions. Second operand 7 states. [2018-09-30 10:15:36,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:36,673 INFO L93 Difference]: Finished difference Result 584 states and 1012 transitions. [2018-09-30 10:15:36,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 10:15:36,674 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-30 10:15:36,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:36,676 INFO L225 Difference]: With dead ends: 584 [2018-09-30 10:15:36,676 INFO L226 Difference]: Without dead ends: 582 [2018-09-30 10:15:36,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-30 10:15:36,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-09-30 10:15:36,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 543. [2018-09-30 10:15:36,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-09-30 10:15:36,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 956 transitions. [2018-09-30 10:15:36,783 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 956 transitions. Word has length 11 [2018-09-30 10:15:36,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:36,783 INFO L480 AbstractCegarLoop]: Abstraction has 543 states and 956 transitions. [2018-09-30 10:15:36,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:15:36,784 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 956 transitions. [2018-09-30 10:15:36,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 10:15:36,784 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:36,785 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:36,785 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:36,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:36,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1918662095, now seen corresponding path program 1 times [2018-09-30 10:15:36,785 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:36,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:36,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:36,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:36,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:36,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:36,949 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:36,949 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:36,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:36,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:36,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:36,987 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:36,988 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-30 10:15:36,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:15:36,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:15:36,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:15:36,988 INFO L87 Difference]: Start difference. First operand 543 states and 956 transitions. Second operand 7 states. [2018-09-30 10:15:37,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:37,412 INFO L93 Difference]: Finished difference Result 618 states and 1074 transitions. [2018-09-30 10:15:37,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 10:15:37,413 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-30 10:15:37,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:37,415 INFO L225 Difference]: With dead ends: 618 [2018-09-30 10:15:37,415 INFO L226 Difference]: Without dead ends: 616 [2018-09-30 10:15:37,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-09-30 10:15:37,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-09-30 10:15:37,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 529. [2018-09-30 10:15:37,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-09-30 10:15:37,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 929 transitions. [2018-09-30 10:15:37,515 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 929 transitions. Word has length 11 [2018-09-30 10:15:37,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:37,515 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 929 transitions. [2018-09-30 10:15:37,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:15:37,515 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 929 transitions. [2018-09-30 10:15:37,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 10:15:37,516 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:37,516 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:37,516 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:37,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:37,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1878520164, now seen corresponding path program 1 times [2018-09-30 10:15:37,517 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:37,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:37,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:37,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:37,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:37,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:37,581 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:37,581 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:37,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:37,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:37,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:37,618 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:37,618 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-30 10:15:37,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:15:37,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:15:37,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-30 10:15:37,619 INFO L87 Difference]: Start difference. First operand 529 states and 929 transitions. Second operand 7 states. [2018-09-30 10:15:38,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:38,033 INFO L93 Difference]: Finished difference Result 613 states and 1066 transitions. [2018-09-30 10:15:38,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:15:38,034 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-30 10:15:38,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:38,036 INFO L225 Difference]: With dead ends: 613 [2018-09-30 10:15:38,036 INFO L226 Difference]: Without dead ends: 611 [2018-09-30 10:15:38,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-09-30 10:15:38,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-09-30 10:15:38,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 523. [2018-09-30 10:15:38,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-09-30 10:15:38,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 914 transitions. [2018-09-30 10:15:38,134 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 914 transitions. Word has length 11 [2018-09-30 10:15:38,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:38,134 INFO L480 AbstractCegarLoop]: Abstraction has 523 states and 914 transitions. [2018-09-30 10:15:38,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:15:38,135 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 914 transitions. [2018-09-30 10:15:38,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:38,135 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:38,135 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:38,136 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:38,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:38,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1730497723, now seen corresponding path program 1 times [2018-09-30 10:15:38,136 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:38,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:38,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:38,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:38,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:38,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:38,410 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:38,410 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:38,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:38,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:38,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:38,490 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:38,490 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2018-09-30 10:15:38,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-30 10:15:38,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-30 10:15:38,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-09-30 10:15:38,491 INFO L87 Difference]: Start difference. First operand 523 states and 914 transitions. Second operand 12 states. [2018-09-30 10:15:39,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:39,576 INFO L93 Difference]: Finished difference Result 875 states and 1523 transitions. [2018-09-30 10:15:39,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 10:15:39,577 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-09-30 10:15:39,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:39,580 INFO L225 Difference]: With dead ends: 875 [2018-09-30 10:15:39,580 INFO L226 Difference]: Without dead ends: 873 [2018-09-30 10:15:39,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2018-09-30 10:15:39,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2018-09-30 10:15:39,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 651. [2018-09-30 10:15:39,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-09-30 10:15:39,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1146 transitions. [2018-09-30 10:15:39,695 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1146 transitions. Word has length 12 [2018-09-30 10:15:39,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:39,695 INFO L480 AbstractCegarLoop]: Abstraction has 651 states and 1146 transitions. [2018-09-30 10:15:39,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-30 10:15:39,696 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1146 transitions. [2018-09-30 10:15:39,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:15:39,696 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:39,696 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:39,696 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:39,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:39,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1895489947, now seen corresponding path program 1 times [2018-09-30 10:15:39,697 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:39,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:39,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:39,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:39,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:39,791 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:39,792 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:39,792 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:39,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:39,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:39,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:39,894 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:39,894 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-09-30 10:15:39,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 10:15:39,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 10:15:39,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-09-30 10:15:39,895 INFO L87 Difference]: Start difference. First operand 651 states and 1146 transitions. Second operand 13 states. [2018-09-30 10:15:41,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:41,239 INFO L93 Difference]: Finished difference Result 1281 states and 2254 transitions. [2018-09-30 10:15:41,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 10:15:41,239 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-09-30 10:15:41,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:41,243 INFO L225 Difference]: With dead ends: 1281 [2018-09-30 10:15:41,244 INFO L226 Difference]: Without dead ends: 1279 [2018-09-30 10:15:41,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=260, Invalid=1000, Unknown=0, NotChecked=0, Total=1260 [2018-09-30 10:15:41,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2018-09-30 10:15:41,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 923. [2018-09-30 10:15:41,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-09-30 10:15:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1627 transitions. [2018-09-30 10:15:41,419 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1627 transitions. Word has length 12 [2018-09-30 10:15:41,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:41,419 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1627 transitions. [2018-09-30 10:15:41,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 10:15:41,419 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1627 transitions. [2018-09-30 10:15:41,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 10:15:41,420 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:41,420 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:41,420 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:41,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:41,421 INFO L82 PathProgramCache]: Analyzing trace with hash -397030605, now seen corresponding path program 1 times [2018-09-30 10:15:41,421 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:41,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:41,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:41,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:41,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:41,501 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:41,501 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:41,501 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:41,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:41,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:41,544 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:41,564 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:41,564 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-09-30 10:15:41,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 10:15:41,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 10:15:41,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-09-30 10:15:41,565 INFO L87 Difference]: Start difference. First operand 923 states and 1627 transitions. Second operand 11 states. [2018-09-30 10:15:42,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:42,244 INFO L93 Difference]: Finished difference Result 1054 states and 1838 transitions. [2018-09-30 10:15:42,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:15:42,245 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-09-30 10:15:42,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:42,248 INFO L225 Difference]: With dead ends: 1054 [2018-09-30 10:15:42,248 INFO L226 Difference]: Without dead ends: 1052 [2018-09-30 10:15:42,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2018-09-30 10:15:42,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2018-09-30 10:15:42,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 933. [2018-09-30 10:15:42,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-09-30 10:15:42,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1644 transitions. [2018-09-30 10:15:42,448 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1644 transitions. Word has length 14 [2018-09-30 10:15:42,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:42,448 INFO L480 AbstractCegarLoop]: Abstraction has 933 states and 1644 transitions. [2018-09-30 10:15:42,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 10:15:42,448 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1644 transitions. [2018-09-30 10:15:42,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 10:15:42,449 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:42,450 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:42,450 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:42,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:42,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1593749093, now seen corresponding path program 2 times [2018-09-30 10:15:42,450 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:42,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:42,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:42,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:42,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:42,741 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:42,741 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:42,741 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:42,749 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:15:42,755 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:15:42,755 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:15:42,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:42,822 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:42,843 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:42,843 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-09-30 10:15:42,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-30 10:15:42,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-30 10:15:42,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-09-30 10:15:42,844 INFO L87 Difference]: Start difference. First operand 933 states and 1644 transitions. Second operand 12 states. [2018-09-30 10:15:44,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:44,004 INFO L93 Difference]: Finished difference Result 1125 states and 1938 transitions. [2018-09-30 10:15:44,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 10:15:44,005 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-09-30 10:15:44,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:44,009 INFO L225 Difference]: With dead ends: 1125 [2018-09-30 10:15:44,009 INFO L226 Difference]: Without dead ends: 1123 [2018-09-30 10:15:44,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=229, Invalid=827, Unknown=0, NotChecked=0, Total=1056 [2018-09-30 10:15:44,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2018-09-30 10:15:44,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 923. [2018-09-30 10:15:44,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-09-30 10:15:44,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1627 transitions. [2018-09-30 10:15:44,178 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1627 transitions. Word has length 14 [2018-09-30 10:15:44,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:44,178 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1627 transitions. [2018-09-30 10:15:44,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-30 10:15:44,178 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1627 transitions. [2018-09-30 10:15:44,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 10:15:44,179 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:44,179 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:44,179 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:44,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:44,180 INFO L82 PathProgramCache]: Analyzing trace with hash -213121378, now seen corresponding path program 1 times [2018-09-30 10:15:44,180 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:44,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:44,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:44,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:15:44,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:44,305 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:44,306 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:44,306 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:44,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:44,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:44,512 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:44,535 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:44,535 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 13 [2018-09-30 10:15:44,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:15:44,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:15:44,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-09-30 10:15:44,536 INFO L87 Difference]: Start difference. First operand 923 states and 1627 transitions. Second operand 14 states. [2018-09-30 10:15:45,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:45,963 INFO L93 Difference]: Finished difference Result 1125 states and 1949 transitions. [2018-09-30 10:15:45,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-30 10:15:45,964 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-09-30 10:15:45,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:45,967 INFO L225 Difference]: With dead ends: 1125 [2018-09-30 10:15:45,968 INFO L226 Difference]: Without dead ends: 1123 [2018-09-30 10:15:45,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=266, Invalid=1066, Unknown=0, NotChecked=0, Total=1332 [2018-09-30 10:15:45,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2018-09-30 10:15:46,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 919. [2018-09-30 10:15:46,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2018-09-30 10:15:46,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1620 transitions. [2018-09-30 10:15:46,151 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1620 transitions. Word has length 14 [2018-09-30 10:15:46,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:46,152 INFO L480 AbstractCegarLoop]: Abstraction has 919 states and 1620 transitions. [2018-09-30 10:15:46,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:15:46,152 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1620 transitions. [2018-09-30 10:15:46,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 10:15:46,152 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:46,152 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:46,153 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:46,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:46,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1838595071, now seen corresponding path program 1 times [2018-09-30 10:15:46,153 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:46,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:46,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:46,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:46,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:46,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:46,264 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:46,264 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:46,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:46,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:46,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:46,332 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:46,332 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-09-30 10:15:46,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-30 10:15:46,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-30 10:15:46,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-09-30 10:15:46,333 INFO L87 Difference]: Start difference. First operand 919 states and 1620 transitions. Second operand 12 states. [2018-09-30 10:15:47,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:47,170 INFO L93 Difference]: Finished difference Result 1117 states and 1948 transitions. [2018-09-30 10:15:47,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 10:15:47,171 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-09-30 10:15:47,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:47,174 INFO L225 Difference]: With dead ends: 1117 [2018-09-30 10:15:47,175 INFO L226 Difference]: Without dead ends: 1115 [2018-09-30 10:15:47,175 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-09-30 10:15:47,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2018-09-30 10:15:47,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 883. [2018-09-30 10:15:47,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2018-09-30 10:15:47,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1560 transitions. [2018-09-30 10:15:47,357 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1560 transitions. Word has length 14 [2018-09-30 10:15:47,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:47,357 INFO L480 AbstractCegarLoop]: Abstraction has 883 states and 1560 transitions. [2018-09-30 10:15:47,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-30 10:15:47,357 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1560 transitions. [2018-09-30 10:15:47,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 10:15:47,358 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:47,358 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:47,358 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:47,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:47,359 INFO L82 PathProgramCache]: Analyzing trace with hash -47479579, now seen corresponding path program 1 times [2018-09-30 10:15:47,359 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:47,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:47,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:47,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:47,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:47,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:47,501 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:47,501 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:47,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:47,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:47,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:47,587 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:47,587 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-09-30 10:15:47,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 10:15:47,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 10:15:47,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-09-30 10:15:47,588 INFO L87 Difference]: Start difference. First operand 883 states and 1560 transitions. Second operand 11 states. [2018-09-30 10:15:48,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:48,380 INFO L93 Difference]: Finished difference Result 995 states and 1722 transitions. [2018-09-30 10:15:48,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:15:48,381 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-09-30 10:15:48,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:48,384 INFO L225 Difference]: With dead ends: 995 [2018-09-30 10:15:48,384 INFO L226 Difference]: Without dead ends: 993 [2018-09-30 10:15:48,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-09-30 10:15:48,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2018-09-30 10:15:48,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 877. [2018-09-30 10:15:48,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2018-09-30 10:15:48,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1548 transitions. [2018-09-30 10:15:48,560 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1548 transitions. Word has length 14 [2018-09-30 10:15:48,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:48,560 INFO L480 AbstractCegarLoop]: Abstraction has 877 states and 1548 transitions. [2018-09-30 10:15:48,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 10:15:48,560 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1548 transitions. [2018-09-30 10:15:48,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:15:48,561 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:48,561 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 10:15:48,562 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:48,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:48,562 INFO L82 PathProgramCache]: Analyzing trace with hash 2027388784, now seen corresponding path program 1 times [2018-09-30 10:15:48,562 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:48,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:48,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:48,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:48,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:48,714 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:48,715 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:48,715 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:48,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:48,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:48,842 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:48,863 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:48,863 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-09-30 10:15:48,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 10:15:48,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 10:15:48,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-09-30 10:15:48,864 INFO L87 Difference]: Start difference. First operand 877 states and 1548 transitions. Second operand 17 states. [2018-09-30 10:15:51,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:51,382 INFO L93 Difference]: Finished difference Result 2105 states and 3670 transitions. [2018-09-30 10:15:51,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-30 10:15:51,383 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2018-09-30 10:15:51,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:51,387 INFO L225 Difference]: With dead ends: 2105 [2018-09-30 10:15:51,387 INFO L226 Difference]: Without dead ends: 1229 [2018-09-30 10:15:51,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=635, Invalid=2557, Unknown=0, NotChecked=0, Total=3192 [2018-09-30 10:15:51,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2018-09-30 10:15:51,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1014. [2018-09-30 10:15:51,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-09-30 10:15:51,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1752 transitions. [2018-09-30 10:15:51,611 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1752 transitions. Word has length 15 [2018-09-30 10:15:51,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:51,612 INFO L480 AbstractCegarLoop]: Abstraction has 1014 states and 1752 transitions. [2018-09-30 10:15:51,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 10:15:51,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1752 transitions. [2018-09-30 10:15:51,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:15:51,613 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:51,613 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:51,613 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:51,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:51,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1084233543, now seen corresponding path program 1 times [2018-09-30 10:15:51,614 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:51,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:51,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:51,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:51,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:51,727 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:51,728 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:51,728 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:51,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:51,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:51,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:51,837 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:51,837 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-09-30 10:15:51,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 10:15:51,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 10:15:51,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-09-30 10:15:51,838 INFO L87 Difference]: Start difference. First operand 1014 states and 1752 transitions. Second operand 15 states. [2018-09-30 10:15:52,612 WARN L178 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2018-09-30 10:15:54,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:54,051 INFO L93 Difference]: Finished difference Result 2110 states and 3623 transitions. [2018-09-30 10:15:54,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-30 10:15:54,051 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-30 10:15:54,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:54,055 INFO L225 Difference]: With dead ends: 2110 [2018-09-30 10:15:54,055 INFO L226 Difference]: Without dead ends: 1097 [2018-09-30 10:15:54,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=426, Invalid=2024, Unknown=0, NotChecked=0, Total=2450 [2018-09-30 10:15:54,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-09-30 10:15:54,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 951. [2018-09-30 10:15:54,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2018-09-30 10:15:54,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1643 transitions. [2018-09-30 10:15:54,269 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1643 transitions. Word has length 15 [2018-09-30 10:15:54,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:54,269 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 1643 transitions. [2018-09-30 10:15:54,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 10:15:54,269 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1643 transitions. [2018-09-30 10:15:54,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:15:54,270 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:54,270 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:54,270 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:54,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:54,271 INFO L82 PathProgramCache]: Analyzing trace with hash -185533858, now seen corresponding path program 1 times [2018-09-30 10:15:54,271 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:54,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:54,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:54,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:54,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:54,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:54,443 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:54,443 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:54,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:54,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:54,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:54,684 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:54,684 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-09-30 10:15:54,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 10:15:54,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 10:15:54,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-09-30 10:15:54,685 INFO L87 Difference]: Start difference. First operand 951 states and 1643 transitions. Second operand 15 states. [2018-09-30 10:15:57,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:57,044 INFO L93 Difference]: Finished difference Result 2832 states and 4780 transitions. [2018-09-30 10:15:57,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-30 10:15:57,044 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-30 10:15:57,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:57,050 INFO L225 Difference]: With dead ends: 2832 [2018-09-30 10:15:57,050 INFO L226 Difference]: Without dead ends: 1867 [2018-09-30 10:15:57,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=702, Invalid=3330, Unknown=0, NotChecked=0, Total=4032 [2018-09-30 10:15:57,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2018-09-30 10:15:57,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 1571. [2018-09-30 10:15:57,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2018-09-30 10:15:57,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2660 transitions. [2018-09-30 10:15:57,398 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2660 transitions. Word has length 15 [2018-09-30 10:15:57,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:57,398 INFO L480 AbstractCegarLoop]: Abstraction has 1571 states and 2660 transitions. [2018-09-30 10:15:57,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 10:15:57,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2660 transitions. [2018-09-30 10:15:57,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:15:57,400 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:57,400 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:15:57,400 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:57,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:57,400 INFO L82 PathProgramCache]: Analyzing trace with hash -497943192, now seen corresponding path program 1 times [2018-09-30 10:15:57,400 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:57,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:57,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:57,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:57,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:57,484 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:57,484 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:57,484 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:57,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:57,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:57,585 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 10:15:57,605 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:57,605 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-09-30 10:15:57,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 10:15:57,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 10:15:57,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-09-30 10:15:57,606 INFO L87 Difference]: Start difference. First operand 1571 states and 2660 transitions. Second operand 15 states. [2018-09-30 10:16:01,141 WARN L178 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2018-09-30 10:16:02,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:02,030 INFO L93 Difference]: Finished difference Result 4461 states and 7467 transitions. [2018-09-30 10:16:02,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-30 10:16:02,031 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-30 10:16:02,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:02,056 INFO L225 Difference]: With dead ends: 4461 [2018-09-30 10:16:02,056 INFO L226 Difference]: Without dead ends: 2887 [2018-09-30 10:16:02,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2031 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1321, Invalid=5159, Unknown=0, NotChecked=0, Total=6480 [2018-09-30 10:16:02,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2018-09-30 10:16:02,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 2284. [2018-09-30 10:16:02,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2284 states. [2018-09-30 10:16:03,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 3759 transitions. [2018-09-30 10:16:03,004 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 3759 transitions. Word has length 15 [2018-09-30 10:16:03,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:03,004 INFO L480 AbstractCegarLoop]: Abstraction has 2284 states and 3759 transitions. [2018-09-30 10:16:03,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 10:16:03,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 3759 transitions. [2018-09-30 10:16:03,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:16:03,006 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:03,006 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 10:16:03,007 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:03,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:03,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1957708543, now seen corresponding path program 1 times [2018-09-30 10:16:03,007 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:03,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:03,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:03,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:03,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:03,998 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:03,999 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:16:03,999 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:16:04,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:04,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:16:04,658 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-09-30 10:16:04,895 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 10:16:04,915 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:16:04,915 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-09-30 10:16:04,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 10:16:04,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 10:16:04,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-09-30 10:16:04,916 INFO L87 Difference]: Start difference. First operand 2284 states and 3759 transitions. Second operand 16 states. [2018-09-30 10:16:08,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:08,740 INFO L93 Difference]: Finished difference Result 3903 states and 6372 transitions. [2018-09-30 10:16:08,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-30 10:16:08,741 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-09-30 10:16:08,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:08,748 INFO L225 Difference]: With dead ends: 3903 [2018-09-30 10:16:08,748 INFO L226 Difference]: Without dead ends: 3227 [2018-09-30 10:16:08,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2797 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1137, Invalid=6873, Unknown=0, NotChecked=0, Total=8010 [2018-09-30 10:16:08,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3227 states. [2018-09-30 10:16:09,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3227 to 2428. [2018-09-30 10:16:09,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2428 states. [2018-09-30 10:16:09,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 4065 transitions. [2018-09-30 10:16:09,426 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 4065 transitions. Word has length 15 [2018-09-30 10:16:09,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:09,426 INFO L480 AbstractCegarLoop]: Abstraction has 2428 states and 4065 transitions. [2018-09-30 10:16:09,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 10:16:09,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 4065 transitions. [2018-09-30 10:16:09,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:16:09,428 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:09,428 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:09,428 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:09,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:09,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1386290021, now seen corresponding path program 1 times [2018-09-30 10:16:09,429 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:09,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:09,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:09,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:09,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:10,040 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:10,041 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:16:10,041 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:16:10,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:10,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:16:10,160 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:10,180 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:16:10,181 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-09-30 10:16:10,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 10:16:10,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 10:16:10,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-09-30 10:16:10,181 INFO L87 Difference]: Start difference. First operand 2428 states and 4065 transitions. Second operand 15 states. [2018-09-30 10:16:12,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:12,937 INFO L93 Difference]: Finished difference Result 5427 states and 9046 transitions. [2018-09-30 10:16:12,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-30 10:16:12,938 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-30 10:16:12,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:12,943 INFO L225 Difference]: With dead ends: 5427 [2018-09-30 10:16:12,943 INFO L226 Difference]: Without dead ends: 2851 [2018-09-30 10:16:12,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=632, Invalid=2790, Unknown=0, NotChecked=0, Total=3422 [2018-09-30 10:16:12,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2018-09-30 10:16:13,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2500. [2018-09-30 10:16:13,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2500 states. [2018-09-30 10:16:13,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 4177 transitions. [2018-09-30 10:16:13,585 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 4177 transitions. Word has length 15 [2018-09-30 10:16:13,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:13,586 INFO L480 AbstractCegarLoop]: Abstraction has 2500 states and 4177 transitions. [2018-09-30 10:16:13,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 10:16:13,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 4177 transitions. [2018-09-30 10:16:13,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:16:13,587 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:13,587 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 10:16:13,587 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:13,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:13,588 INFO L82 PathProgramCache]: Analyzing trace with hash -38293542, now seen corresponding path program 1 times [2018-09-30 10:16:13,588 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:13,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:13,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:13,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:13,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:13,685 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:13,685 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:16:13,685 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:16:13,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:13,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:16:13,769 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 10:16:13,789 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:16:13,789 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-09-30 10:16:13,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 10:16:13,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 10:16:13,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-09-30 10:16:13,790 INFO L87 Difference]: Start difference. First operand 2500 states and 4177 transitions. Second operand 15 states. [2018-09-30 10:16:16,330 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2018-09-30 10:16:16,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:16,891 INFO L93 Difference]: Finished difference Result 5837 states and 9708 transitions. [2018-09-30 10:16:16,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-30 10:16:16,892 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-30 10:16:16,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:16,897 INFO L225 Difference]: With dead ends: 5837 [2018-09-30 10:16:16,898 INFO L226 Difference]: Without dead ends: 3072 [2018-09-30 10:16:16,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=785, Invalid=3247, Unknown=0, NotChecked=0, Total=4032 [2018-09-30 10:16:16,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2018-09-30 10:16:17,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2605. [2018-09-30 10:16:17,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2605 states. [2018-09-30 10:16:17,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 4349 transitions. [2018-09-30 10:16:17,603 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 4349 transitions. Word has length 15 [2018-09-30 10:16:17,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:17,603 INFO L480 AbstractCegarLoop]: Abstraction has 2605 states and 4349 transitions. [2018-09-30 10:16:17,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 10:16:17,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 4349 transitions. [2018-09-30 10:16:17,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:16:17,605 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:17,605 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 10:16:17,605 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:17,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:17,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1793898800, now seen corresponding path program 1 times [2018-09-30 10:16:17,606 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:17,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:17,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:17,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:17,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:17,734 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 10:16:17,734 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:16:17,734 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:16:17,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:17,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:16:17,997 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:18,018 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:16:18,019 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-09-30 10:16:18,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-30 10:16:18,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-30 10:16:18,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-09-30 10:16:18,019 INFO L87 Difference]: Start difference. First operand 2605 states and 4349 transitions. Second operand 20 states. [2018-09-30 10:16:24,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:24,239 INFO L93 Difference]: Finished difference Result 5120 states and 8519 transitions. [2018-09-30 10:16:24,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-30 10:16:24,240 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 18 [2018-09-30 10:16:24,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:24,247 INFO L225 Difference]: With dead ends: 5120 [2018-09-30 10:16:24,247 INFO L226 Difference]: Without dead ends: 3342 [2018-09-30 10:16:24,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3994 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1800, Invalid=9972, Unknown=0, NotChecked=0, Total=11772 [2018-09-30 10:16:24,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3342 states. [2018-09-30 10:16:25,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3342 to 2886. [2018-09-30 10:16:25,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2886 states. [2018-09-30 10:16:25,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2886 states to 2886 states and 4822 transitions. [2018-09-30 10:16:25,154 INFO L78 Accepts]: Start accepts. Automaton has 2886 states and 4822 transitions. Word has length 18 [2018-09-30 10:16:25,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:25,154 INFO L480 AbstractCegarLoop]: Abstraction has 2886 states and 4822 transitions. [2018-09-30 10:16:25,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-30 10:16:25,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2886 states and 4822 transitions. [2018-09-30 10:16:25,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:16:25,155 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:25,155 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:25,156 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:25,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:25,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1793897518, now seen corresponding path program 1 times [2018-09-30 10:16:25,156 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:25,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:25,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:25,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:25,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:25,405 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:25,405 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:16:25,406 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:16:25,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:25,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:16:25,483 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-30 10:16:25,503 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:16:25,504 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2018-09-30 10:16:25,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 10:16:25,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 10:16:25,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-09-30 10:16:25,504 INFO L87 Difference]: Start difference. First operand 2886 states and 4822 transitions. Second operand 16 states. [2018-09-30 10:16:28,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:28,485 INFO L93 Difference]: Finished difference Result 3487 states and 5852 transitions. [2018-09-30 10:16:28,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-30 10:16:28,485 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-09-30 10:16:28,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:28,491 INFO L225 Difference]: With dead ends: 3487 [2018-09-30 10:16:28,491 INFO L226 Difference]: Without dead ends: 3485 [2018-09-30 10:16:28,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=616, Invalid=3544, Unknown=0, NotChecked=0, Total=4160 [2018-09-30 10:16:28,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3485 states. [2018-09-30 10:16:29,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3485 to 2999. [2018-09-30 10:16:29,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2999 states. [2018-09-30 10:16:29,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 5026 transitions. [2018-09-30 10:16:29,336 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 5026 transitions. Word has length 18 [2018-09-30 10:16:29,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:29,337 INFO L480 AbstractCegarLoop]: Abstraction has 2999 states and 5026 transitions. [2018-09-30 10:16:29,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 10:16:29,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 5026 transitions. [2018-09-30 10:16:29,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:16:29,338 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:29,339 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:29,339 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:29,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:29,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1785310631, now seen corresponding path program 1 times [2018-09-30 10:16:29,339 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:29,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:29,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:29,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:29,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:29,469 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:29,469 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:16:29,469 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:16:29,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:29,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:16:29,568 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-30 10:16:29,588 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:16:29,588 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2018-09-30 10:16:29,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 10:16:29,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 10:16:29,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-09-30 10:16:29,589 INFO L87 Difference]: Start difference. First operand 2999 states and 5026 transitions. Second operand 15 states. [2018-09-30 10:16:32,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:32,811 INFO L93 Difference]: Finished difference Result 3557 states and 5973 transitions. [2018-09-30 10:16:32,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-30 10:16:32,812 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-09-30 10:16:32,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:32,817 INFO L225 Difference]: With dead ends: 3557 [2018-09-30 10:16:32,817 INFO L226 Difference]: Without dead ends: 3555 [2018-09-30 10:16:32,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1279 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=674, Invalid=3486, Unknown=0, NotChecked=0, Total=4160 [2018-09-30 10:16:32,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3555 states. [2018-09-30 10:16:33,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3555 to 3102. [2018-09-30 10:16:33,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3102 states. [2018-09-30 10:16:33,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3102 states to 3102 states and 5194 transitions. [2018-09-30 10:16:33,592 INFO L78 Accepts]: Start accepts. Automaton has 3102 states and 5194 transitions. Word has length 18 [2018-09-30 10:16:33,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:33,592 INFO L480 AbstractCegarLoop]: Abstraction has 3102 states and 5194 transitions. [2018-09-30 10:16:33,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 10:16:33,593 INFO L276 IsEmpty]: Start isEmpty. Operand 3102 states and 5194 transitions. [2018-09-30 10:16:33,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:16:33,594 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:33,594 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:33,594 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:33,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:33,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1256757274, now seen corresponding path program 2 times [2018-09-30 10:16:33,594 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:33,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:33,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:33,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:33,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:33,798 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:33,798 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:16:33,798 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:16:33,808 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:16:33,815 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:16:33,815 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:16:33,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:16:33,991 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:34,011 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:16:34,011 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-09-30 10:16:34,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 10:16:34,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 10:16:34,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-09-30 10:16:34,012 INFO L87 Difference]: Start difference. First operand 3102 states and 5194 transitions. Second operand 18 states. [2018-09-30 10:16:42,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:42,189 INFO L93 Difference]: Finished difference Result 5252 states and 8823 transitions. [2018-09-30 10:16:42,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-09-30 10:16:42,189 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-09-30 10:16:42,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:42,195 INFO L225 Difference]: With dead ends: 5252 [2018-09-30 10:16:42,195 INFO L226 Difference]: Without dead ends: 5250 [2018-09-30 10:16:42,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7869 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2825, Invalid=16915, Unknown=0, NotChecked=0, Total=19740 [2018-09-30 10:16:42,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5250 states. [2018-09-30 10:16:43,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5250 to 3515. [2018-09-30 10:16:43,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3515 states. [2018-09-30 10:16:43,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3515 states to 3515 states and 5926 transitions. [2018-09-30 10:16:43,076 INFO L78 Accepts]: Start accepts. Automaton has 3515 states and 5926 transitions. Word has length 18 [2018-09-30 10:16:43,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:43,076 INFO L480 AbstractCegarLoop]: Abstraction has 3515 states and 5926 transitions. [2018-09-30 10:16:43,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 10:16:43,076 INFO L276 IsEmpty]: Start isEmpty. Operand 3515 states and 5926 transitions. [2018-09-30 10:16:43,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:16:43,077 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:43,077 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:43,077 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:43,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:43,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1248170387, now seen corresponding path program 2 times [2018-09-30 10:16:43,078 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:43,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:43,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:43,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:16:43,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:43,297 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:43,298 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:16:43,298 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:16:43,306 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:16:43,313 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:16:43,314 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:16:43,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:16:43,467 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:43,488 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:16:43,488 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-09-30 10:16:43,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 10:16:43,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 10:16:43,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-09-30 10:16:43,489 INFO L87 Difference]: Start difference. First operand 3515 states and 5926 transitions. Second operand 18 states. [2018-09-30 10:16:51,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:51,462 INFO L93 Difference]: Finished difference Result 4843 states and 8107 transitions. [2018-09-30 10:16:51,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-09-30 10:16:51,463 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-09-30 10:16:51,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:51,468 INFO L225 Difference]: With dead ends: 4843 [2018-09-30 10:16:51,468 INFO L226 Difference]: Without dead ends: 4841 [2018-09-30 10:16:51,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 6131 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2645, Invalid=12855, Unknown=0, NotChecked=0, Total=15500 [2018-09-30 10:16:51,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4841 states. [2018-09-30 10:16:52,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4841 to 3405. [2018-09-30 10:16:52,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3405 states. [2018-09-30 10:16:52,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3405 states to 3405 states and 5721 transitions. [2018-09-30 10:16:52,334 INFO L78 Accepts]: Start accepts. Automaton has 3405 states and 5721 transitions. Word has length 18 [2018-09-30 10:16:52,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:52,334 INFO L480 AbstractCegarLoop]: Abstraction has 3405 states and 5721 transitions. [2018-09-30 10:16:52,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 10:16:52,334 INFO L276 IsEmpty]: Start isEmpty. Operand 3405 states and 5721 transitions. [2018-09-30 10:16:52,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:16:52,335 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:52,335 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:52,335 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:52,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:52,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1231339551, now seen corresponding path program 2 times [2018-09-30 10:16:52,336 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:52,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:52,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:52,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:16:52,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:52,430 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:52,430 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:16:52,430 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:16:52,441 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:16:52,448 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:16:52,448 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:16:52,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:16:52,520 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 10:16:52,542 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:16:52,542 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2018-09-30 10:16:52,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 10:16:52,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 10:16:52,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-09-30 10:16:52,543 INFO L87 Difference]: Start difference. First operand 3405 states and 5721 transitions. Second operand 16 states. [2018-09-30 10:16:55,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:55,255 INFO L93 Difference]: Finished difference Result 5774 states and 9598 transitions. [2018-09-30 10:16:55,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-30 10:16:55,255 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-09-30 10:16:55,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:55,259 INFO L225 Difference]: With dead ends: 5774 [2018-09-30 10:16:55,259 INFO L226 Difference]: Without dead ends: 3100 [2018-09-30 10:16:55,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=695, Invalid=2385, Unknown=0, NotChecked=0, Total=3080 [2018-09-30 10:16:55,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2018-09-30 10:16:55,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2583. [2018-09-30 10:16:55,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2583 states. [2018-09-30 10:16:55,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2583 states to 2583 states and 4270 transitions. [2018-09-30 10:16:55,944 INFO L78 Accepts]: Start accepts. Automaton has 2583 states and 4270 transitions. Word has length 18 [2018-09-30 10:16:55,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:55,944 INFO L480 AbstractCegarLoop]: Abstraction has 2583 states and 4270 transitions. [2018-09-30 10:16:55,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 10:16:55,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2583 states and 4270 transitions. [2018-09-30 10:16:55,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:16:55,946 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:55,946 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:55,946 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:55,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:55,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1890837259, now seen corresponding path program 1 times [2018-09-30 10:16:55,946 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:55,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:55,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:55,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:16:55,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:56,125 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:56,125 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:16:56,125 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:16:56,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:56,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:56,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:16:56,210 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-30 10:16:56,231 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:16:56,231 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2018-09-30 10:16:56,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 10:16:56,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 10:16:56,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-09-30 10:16:56,232 INFO L87 Difference]: Start difference. First operand 2583 states and 4270 transitions. Second operand 15 states. [2018-09-30 10:16:58,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:58,745 INFO L93 Difference]: Finished difference Result 3114 states and 5123 transitions. [2018-09-30 10:16:58,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-30 10:16:58,746 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-09-30 10:16:58,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:58,749 INFO L225 Difference]: With dead ends: 3114 [2018-09-30 10:16:58,749 INFO L226 Difference]: Without dead ends: 3112 [2018-09-30 10:16:58,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=409, Invalid=1847, Unknown=0, NotChecked=0, Total=2256 [2018-09-30 10:16:58,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3112 states. [2018-09-30 10:16:59,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3112 to 2773. [2018-09-30 10:16:59,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2773 states. [2018-09-30 10:16:59,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2773 states and 4589 transitions. [2018-09-30 10:16:59,533 INFO L78 Accepts]: Start accepts. Automaton has 2773 states and 4589 transitions. Word has length 18 [2018-09-30 10:16:59,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:59,534 INFO L480 AbstractCegarLoop]: Abstraction has 2773 states and 4589 transitions. [2018-09-30 10:16:59,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 10:16:59,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2773 states and 4589 transitions. [2018-09-30 10:16:59,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:16:59,535 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:59,535 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-30 10:16:59,535 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:59,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:59,535 INFO L82 PathProgramCache]: Analyzing trace with hash 740718717, now seen corresponding path program 2 times [2018-09-30 10:16:59,536 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:59,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:59,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:59,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:59,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:59,645 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:59,645 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:16:59,645 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:16:59,654 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:16:59,660 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:16:59,660 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:16:59,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:16:59,747 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:59,767 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:16:59,768 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-09-30 10:16:59,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 10:16:59,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 10:16:59,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-09-30 10:16:59,768 INFO L87 Difference]: Start difference. First operand 2773 states and 4589 transitions. Second operand 17 states. [2018-09-30 10:17:05,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:17:05,275 INFO L93 Difference]: Finished difference Result 4415 states and 7404 transitions. [2018-09-30 10:17:05,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-30 10:17:05,276 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-09-30 10:17:05,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:17:05,279 INFO L225 Difference]: With dead ends: 4415 [2018-09-30 10:17:05,279 INFO L226 Difference]: Without dead ends: 4413 [2018-09-30 10:17:05,280 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3051 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1803, Invalid=6939, Unknown=0, NotChecked=0, Total=8742 [2018-09-30 10:17:05,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4413 states. [2018-09-30 10:17:06,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4413 to 3073. [2018-09-30 10:17:06,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3073 states. [2018-09-30 10:17:06,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 5108 transitions. [2018-09-30 10:17:06,149 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 5108 transitions. Word has length 18 [2018-09-30 10:17:06,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:17:06,149 INFO L480 AbstractCegarLoop]: Abstraction has 3073 states and 5108 transitions. [2018-09-30 10:17:06,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 10:17:06,149 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 5108 transitions. [2018-09-30 10:17:06,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:17:06,150 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:17:06,150 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:17:06,151 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:17:06,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:17:06,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1434281659, now seen corresponding path program 1 times [2018-09-30 10:17:06,151 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:17:06,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:17:06,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:06,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:17:06,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:06,304 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:06,304 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:17:06,304 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:17:06,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:06,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:17:06,440 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:06,460 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:17:06,461 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2018-09-30 10:17:06,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 10:17:06,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 10:17:06,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-09-30 10:17:06,462 INFO L87 Difference]: Start difference. First operand 3073 states and 5108 transitions. Second operand 16 states. [2018-09-30 10:17:10,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:17:10,585 INFO L93 Difference]: Finished difference Result 4429 states and 7411 transitions. [2018-09-30 10:17:10,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-30 10:17:10,585 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-09-30 10:17:10,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:17:10,589 INFO L225 Difference]: With dead ends: 4429 [2018-09-30 10:17:10,590 INFO L226 Difference]: Without dead ends: 4427 [2018-09-30 10:17:10,591 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1301 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=906, Invalid=3384, Unknown=0, NotChecked=0, Total=4290 [2018-09-30 10:17:10,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4427 states. [2018-09-30 10:17:11,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4427 to 2723. [2018-09-30 10:17:11,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2018-09-30 10:17:11,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 4478 transitions. [2018-09-30 10:17:11,461 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 4478 transitions. Word has length 18 [2018-09-30 10:17:11,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:17:11,461 INFO L480 AbstractCegarLoop]: Abstraction has 2723 states and 4478 transitions. [2018-09-30 10:17:11,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 10:17:11,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 4478 transitions. [2018-09-30 10:17:11,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:17:11,462 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:17:11,462 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:17:11,462 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:17:11,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:17:11,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1483012849, now seen corresponding path program 1 times [2018-09-30 10:17:11,463 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:17:11,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:17:11,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:11,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:11,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:11,597 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:17:11,597 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:17:11,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:11,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:17:11,767 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:11,788 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:17:11,788 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-09-30 10:17:11,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 10:17:11,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 10:17:11,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-09-30 10:17:11,789 INFO L87 Difference]: Start difference. First operand 2723 states and 4478 transitions. Second operand 18 states. [2018-09-30 10:17:16,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:17:16,416 INFO L93 Difference]: Finished difference Result 4290 states and 7151 transitions. [2018-09-30 10:17:16,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-30 10:17:16,416 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-09-30 10:17:16,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:17:16,420 INFO L225 Difference]: With dead ends: 4290 [2018-09-30 10:17:16,421 INFO L226 Difference]: Without dead ends: 4288 [2018-09-30 10:17:16,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=986, Invalid=4416, Unknown=0, NotChecked=0, Total=5402 [2018-09-30 10:17:16,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4288 states. [2018-09-30 10:17:17,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4288 to 3364. [2018-09-30 10:17:17,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3364 states. [2018-09-30 10:17:17,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3364 states to 3364 states and 5610 transitions. [2018-09-30 10:17:17,506 INFO L78 Accepts]: Start accepts. Automaton has 3364 states and 5610 transitions. Word has length 18 [2018-09-30 10:17:17,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:17:17,506 INFO L480 AbstractCegarLoop]: Abstraction has 3364 states and 5610 transitions. [2018-09-30 10:17:17,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 10:17:17,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3364 states and 5610 transitions. [2018-09-30 10:17:17,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:17:17,507 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:17:17,507 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-30 10:17:17,508 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:17:17,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:17:17,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1851213523, now seen corresponding path program 3 times [2018-09-30 10:17:17,508 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:17:17,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:17:17,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:17,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:17,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:17,653 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:17,654 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:17:17,654 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:17:17,661 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:17:17,672 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-09-30 10:17:17,673 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:17:17,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:17:17,866 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-30 10:17:17,887 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:17:17,887 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-09-30 10:17:17,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 10:17:17,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 10:17:17,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-09-30 10:17:17,888 INFO L87 Difference]: Start difference. First operand 3364 states and 5610 transitions. Second operand 18 states. [2018-09-30 10:17:23,335 WARN L178 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2018-09-30 10:17:26,250 WARN L178 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-09-30 10:17:29,131 WARN L178 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2018-09-30 10:17:29,583 WARN L178 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-09-30 10:17:30,148 WARN L178 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-09-30 10:17:30,586 WARN L178 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-09-30 10:17:32,112 WARN L178 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2018-09-30 10:17:32,744 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-09-30 10:17:33,456 WARN L178 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-09-30 10:17:34,180 WARN L178 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-09-30 10:17:40,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:17:40,637 INFO L93 Difference]: Finished difference Result 9624 states and 16323 transitions. [2018-09-30 10:17:40,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-09-30 10:17:40,637 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-09-30 10:17:40,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:17:40,648 INFO L225 Difference]: With dead ends: 9624 [2018-09-30 10:17:40,648 INFO L226 Difference]: Without dead ends: 9622 [2018-09-30 10:17:40,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16036 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=6166, Invalid=32839, Unknown=1, NotChecked=0, Total=39006 [2018-09-30 10:17:40,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9622 states. [2018-09-30 10:17:41,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9622 to 3326. [2018-09-30 10:17:41,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3326 states. [2018-09-30 10:17:41,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3326 states to 3326 states and 5536 transitions. [2018-09-30 10:17:41,812 INFO L78 Accepts]: Start accepts. Automaton has 3326 states and 5536 transitions. Word has length 18 [2018-09-30 10:17:41,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:17:41,812 INFO L480 AbstractCegarLoop]: Abstraction has 3326 states and 5536 transitions. [2018-09-30 10:17:41,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 10:17:41,812 INFO L276 IsEmpty]: Start isEmpty. Operand 3326 states and 5536 transitions. [2018-09-30 10:17:41,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:17:41,814 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:17:41,814 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:17:41,814 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:17:41,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:17:41,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1899944713, now seen corresponding path program 1 times [2018-09-30 10:17:41,815 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:17:41,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:17:41,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:41,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:17:41,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:41,994 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:41,995 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:17:41,995 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:17:42,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:42,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:17:42,188 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-30 10:17:42,210 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:17:42,210 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-09-30 10:17:42,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 10:17:42,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 10:17:42,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-09-30 10:17:42,211 INFO L87 Difference]: Start difference. First operand 3326 states and 5536 transitions. Second operand 17 states. [2018-09-30 10:17:48,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:17:48,047 INFO L93 Difference]: Finished difference Result 5572 states and 9460 transitions. [2018-09-30 10:17:48,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-30 10:17:48,048 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-09-30 10:17:48,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:17:48,053 INFO L225 Difference]: With dead ends: 5572 [2018-09-30 10:17:48,054 INFO L226 Difference]: Without dead ends: 5570 [2018-09-30 10:17:48,055 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2783 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1511, Invalid=7045, Unknown=0, NotChecked=0, Total=8556 [2018-09-30 10:17:48,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states. [2018-09-30 10:17:49,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 3526. [2018-09-30 10:17:49,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3526 states. [2018-09-30 10:17:49,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 5899 transitions. [2018-09-30 10:17:49,423 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 5899 transitions. Word has length 18 [2018-09-30 10:17:49,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:17:49,423 INFO L480 AbstractCegarLoop]: Abstraction has 3526 states and 5899 transitions. [2018-09-30 10:17:49,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 10:17:49,423 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 5899 transitions. [2018-09-30 10:17:49,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:17:49,424 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:17:49,424 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:17:49,424 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:17:49,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:17:49,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1150743797, now seen corresponding path program 2 times [2018-09-30 10:17:49,425 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:17:49,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:17:49,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:49,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:49,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:49,937 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:49,938 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:17:49,938 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:17:49,946 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:17:49,954 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:17:49,954 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:17:49,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:17:50,029 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-30 10:17:50,050 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:17:50,050 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-09-30 10:17:50,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 10:17:50,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 10:17:50,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-09-30 10:17:50,051 INFO L87 Difference]: Start difference. First operand 3526 states and 5899 transitions. Second operand 17 states. [2018-09-30 10:17:54,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:17:54,506 INFO L93 Difference]: Finished difference Result 4458 states and 7480 transitions. [2018-09-30 10:17:54,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-30 10:17:54,506 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-09-30 10:17:54,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:17:54,511 INFO L225 Difference]: With dead ends: 4458 [2018-09-30 10:17:54,511 INFO L226 Difference]: Without dead ends: 4456 [2018-09-30 10:17:54,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2117 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=904, Invalid=5258, Unknown=0, NotChecked=0, Total=6162 [2018-09-30 10:17:54,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4456 states. [2018-09-30 10:17:55,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4456 to 3633. [2018-09-30 10:17:55,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3633 states. [2018-09-30 10:17:55,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 3633 states and 6081 transitions. [2018-09-30 10:17:55,976 INFO L78 Accepts]: Start accepts. Automaton has 3633 states and 6081 transitions. Word has length 18 [2018-09-30 10:17:55,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:17:55,976 INFO L480 AbstractCegarLoop]: Abstraction has 3633 states and 6081 transitions. [2018-09-30 10:17:55,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 10:17:55,976 INFO L276 IsEmpty]: Start isEmpty. Operand 3633 states and 6081 transitions. [2018-09-30 10:17:55,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-30 10:17:55,977 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:17:55,978 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:17:55,978 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:17:55,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:17:55,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1665373557, now seen corresponding path program 1 times [2018-09-30 10:17:55,978 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:17:55,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:17:55,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:55,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:17:55,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:56,133 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:56,134 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:17:56,134 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:17:56,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:56,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:17:56,661 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-30 10:17:56,698 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:17:56,699 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2018-09-30 10:17:56,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-30 10:17:56,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-30 10:17:56,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-09-30 10:17:56,700 INFO L87 Difference]: Start difference. First operand 3633 states and 6081 transitions. Second operand 21 states. [2018-09-30 10:17:57,165 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-09-30 10:18:01,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:18:01,338 INFO L93 Difference]: Finished difference Result 4389 states and 7355 transitions. [2018-09-30 10:18:01,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-30 10:18:01,338 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 19 [2018-09-30 10:18:01,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:18:01,342 INFO L225 Difference]: With dead ends: 4389 [2018-09-30 10:18:01,342 INFO L226 Difference]: Without dead ends: 4376 [2018-09-30 10:18:01,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=725, Invalid=3181, Unknown=0, NotChecked=0, Total=3906 [2018-09-30 10:18:01,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4376 states. [2018-09-30 10:18:02,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4376 to 4152. [2018-09-30 10:18:02,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4152 states. [2018-09-30 10:18:02,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4152 states to 4152 states and 6931 transitions. [2018-09-30 10:18:02,981 INFO L78 Accepts]: Start accepts. Automaton has 4152 states and 6931 transitions. Word has length 19 [2018-09-30 10:18:02,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:18:02,981 INFO L480 AbstractCegarLoop]: Abstraction has 4152 states and 6931 transitions. [2018-09-30 10:18:02,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-30 10:18:02,981 INFO L276 IsEmpty]: Start isEmpty. Operand 4152 states and 6931 transitions. [2018-09-30 10:18:02,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-30 10:18:02,982 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:18:02,982 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-09-30 10:18:02,983 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:18:02,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:18:02,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1271169050, now seen corresponding path program 1 times [2018-09-30 10:18:02,983 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:18:02,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:18:02,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:02,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:02,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:18:03,095 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:18:03,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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:18:03,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:03,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:18:03,225 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:18:03,245 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:18:03,245 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2018-09-30 10:18:03,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-30 10:18:03,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-30 10:18:03,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-09-30 10:18:03,246 INFO L87 Difference]: Start difference. First operand 4152 states and 6931 transitions. Second operand 19 states. [2018-09-30 10:18:10,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:18:10,954 INFO L93 Difference]: Finished difference Result 7602 states and 12857 transitions. [2018-09-30 10:18:10,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-30 10:18:10,955 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-09-30 10:18:10,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:18:10,962 INFO L225 Difference]: With dead ends: 7602 [2018-09-30 10:18:10,962 INFO L226 Difference]: Without dead ends: 7553 [2018-09-30 10:18:10,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1519 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1106, Invalid=4006, Unknown=0, NotChecked=0, Total=5112 [2018-09-30 10:18:10,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7553 states. [2018-09-30 10:18:13,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7553 to 5765. [2018-09-30 10:18:13,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5765 states. [2018-09-30 10:18:13,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5765 states to 5765 states and 9725 transitions. [2018-09-30 10:18:13,574 INFO L78 Accepts]: Start accepts. Automaton has 5765 states and 9725 transitions. Word has length 19 [2018-09-30 10:18:13,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:18:13,574 INFO L480 AbstractCegarLoop]: Abstraction has 5765 states and 9725 transitions. [2018-09-30 10:18:13,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-30 10:18:13,574 INFO L276 IsEmpty]: Start isEmpty. Operand 5765 states and 9725 transitions. [2018-09-30 10:18:13,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-30 10:18:13,576 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:18:13,576 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:18:13,576 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:18:13,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:18:13,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1231183154, now seen corresponding path program 1 times [2018-09-30 10:18:13,576 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:18:13,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:18:13,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:13,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:13,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:13,699 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:18:13,700 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:18:13,700 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:18:13,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:13,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:18:13,824 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-30 10:18:13,847 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:18:13,847 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2018-09-30 10:18:13,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 10:18:13,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 10:18:13,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-09-30 10:18:13,848 INFO L87 Difference]: Start difference. First operand 5765 states and 9725 transitions. Second operand 18 states. [2018-09-30 10:18:25,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:18:25,179 INFO L93 Difference]: Finished difference Result 10730 states and 18220 transitions. [2018-09-30 10:18:25,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-30 10:18:25,179 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2018-09-30 10:18:25,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:18:25,189 INFO L225 Difference]: With dead ends: 10730 [2018-09-30 10:18:25,189 INFO L226 Difference]: Without dead ends: 10673 [2018-09-30 10:18:25,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2305 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1268, Invalid=5872, Unknown=0, NotChecked=0, Total=7140 [2018-09-30 10:18:25,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10673 states. [2018-09-30 10:18:28,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10673 to 5867. [2018-09-30 10:18:28,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5867 states. [2018-09-30 10:18:28,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5867 states to 5867 states and 9873 transitions. [2018-09-30 10:18:28,168 INFO L78 Accepts]: Start accepts. Automaton has 5867 states and 9873 transitions. Word has length 19 [2018-09-30 10:18:28,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:18:28,168 INFO L480 AbstractCegarLoop]: Abstraction has 5867 states and 9873 transitions. [2018-09-30 10:18:28,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 10:18:28,168 INFO L276 IsEmpty]: Start isEmpty. Operand 5867 states and 9873 transitions. [2018-09-30 10:18:28,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-30 10:18:28,170 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:18:28,170 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-30 10:18:28,170 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:18:28,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:18:28,170 INFO L82 PathProgramCache]: Analyzing trace with hash -298147634, now seen corresponding path program 2 times [2018-09-30 10:18:28,170 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:18:28,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:18:28,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:28,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:28,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:28,419 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 10:18:28,419 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:18:28,420 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:18:28,427 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:18:28,435 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:18:28,435 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:18:28,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:18:28,550 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 10:18:28,572 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:18:28,573 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2018-09-30 10:18:28,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-30 10:18:28,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-30 10:18:28,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-09-30 10:18:28,573 INFO L87 Difference]: Start difference. First operand 5867 states and 9873 transitions. Second operand 20 states. [2018-09-30 10:18:33,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:18:33,819 INFO L93 Difference]: Finished difference Result 12951 states and 21640 transitions. [2018-09-30 10:18:33,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-30 10:18:33,819 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2018-09-30 10:18:33,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:18:33,826 INFO L225 Difference]: With dead ends: 12951 [2018-09-30 10:18:33,826 INFO L226 Difference]: Without dead ends: 7453 [2018-09-30 10:18:33,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=369, Invalid=1983, Unknown=0, NotChecked=0, Total=2352 [2018-09-30 10:18:33,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7453 states. [2018-09-30 10:18:36,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7453 to 6977. [2018-09-30 10:18:36,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6977 states. [2018-09-30 10:18:36,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6977 states to 6977 states and 11514 transitions. [2018-09-30 10:18:36,920 INFO L78 Accepts]: Start accepts. Automaton has 6977 states and 11514 transitions. Word has length 21 [2018-09-30 10:18:36,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:18:36,920 INFO L480 AbstractCegarLoop]: Abstraction has 6977 states and 11514 transitions. [2018-09-30 10:18:36,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-30 10:18:36,921 INFO L276 IsEmpty]: Start isEmpty. Operand 6977 states and 11514 transitions. [2018-09-30 10:18:36,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-30 10:18:36,922 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:18:36,922 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:18:36,923 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:18:36,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:18:36,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1920603351, now seen corresponding path program 1 times [2018-09-30 10:18:36,923 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:18:36,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:18:36,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:36,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:18:36,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:37,061 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:18:37,062 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:18:37,062 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:18:37,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:37,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:18:37,141 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-30 10:18:37,162 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:18:37,162 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2018-09-30 10:18:37,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 10:18:37,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 10:18:37,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-09-30 10:18:37,163 INFO L87 Difference]: Start difference. First operand 6977 states and 11514 transitions. Second operand 17 states. [2018-09-30 10:18:42,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:18:42,903 INFO L93 Difference]: Finished difference Result 7309 states and 12055 transitions. [2018-09-30 10:18:42,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-30 10:18:42,903 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2018-09-30 10:18:42,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:18:42,911 INFO L225 Difference]: With dead ends: 7309 [2018-09-30 10:18:42,911 INFO L226 Difference]: Without dead ends: 7307 [2018-09-30 10:18:42,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=366, Invalid=1796, Unknown=0, NotChecked=0, Total=2162 [2018-09-30 10:18:42,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7307 states. [2018-09-30 10:18:46,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7307 to 6935. [2018-09-30 10:18:46,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6935 states. [2018-09-30 10:18:46,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6935 states to 6935 states and 11445 transitions. [2018-09-30 10:18:46,304 INFO L78 Accepts]: Start accepts. Automaton has 6935 states and 11445 transitions. Word has length 21 [2018-09-30 10:18:46,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:18:46,304 INFO L480 AbstractCegarLoop]: Abstraction has 6935 states and 11445 transitions. [2018-09-30 10:18:46,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 10:18:46,304 INFO L276 IsEmpty]: Start isEmpty. Operand 6935 states and 11445 transitions. [2018-09-30 10:18:46,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-30 10:18:46,306 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:18:46,306 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:18:46,306 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:18:46,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:18:46,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1010297104, now seen corresponding path program 1 times [2018-09-30 10:18:46,307 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:18:46,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:18:46,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:46,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:46,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:46,427 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 10:18:46,427 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:18:46,427 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:18:46,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:46,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:18:47,072 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 10:18:47,094 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:18:47,094 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2018-09-30 10:18:47,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-30 10:18:47,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-30 10:18:47,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2018-09-30 10:18:47,095 INFO L87 Difference]: Start difference. First operand 6935 states and 11445 transitions. Second operand 21 states. [2018-09-30 10:18:53,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:18:53,808 INFO L93 Difference]: Finished difference Result 11330 states and 18599 transitions. [2018-09-30 10:18:53,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-30 10:18:53,808 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-09-30 10:18:53,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:18:53,816 INFO L225 Difference]: With dead ends: 11330 [2018-09-30 10:18:53,816 INFO L226 Difference]: Without dead ends: 7599 [2018-09-30 10:18:53,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=590, Invalid=3442, Unknown=0, NotChecked=0, Total=4032 [2018-09-30 10:18:53,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7599 states. [2018-09-30 10:18:56,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7599 to 6837. [2018-09-30 10:18:56,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6837 states. [2018-09-30 10:18:56,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6837 states to 6837 states and 11276 transitions. [2018-09-30 10:18:56,980 INFO L78 Accepts]: Start accepts. Automaton has 6837 states and 11276 transitions. Word has length 21 [2018-09-30 10:18:56,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:18:56,980 INFO L480 AbstractCegarLoop]: Abstraction has 6837 states and 11276 transitions. [2018-09-30 10:18:56,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-30 10:18:56,980 INFO L276 IsEmpty]: Start isEmpty. Operand 6837 states and 11276 transitions. [2018-09-30 10:18:56,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-30 10:18:56,982 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:18:56,982 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 10:18:56,982 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:18:56,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:18:56,982 INFO L82 PathProgramCache]: Analyzing trace with hash -972124902, now seen corresponding path program 1 times [2018-09-30 10:18:56,983 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:18:56,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:18:56,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:56,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:56,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:56,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:57,096 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:18:57,096 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:18:57,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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:18:57,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:57,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:18:57,207 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-30 10:18:57,228 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:18:57,228 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2018-09-30 10:18:57,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 10:18:57,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 10:18:57,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-09-30 10:18:57,229 INFO L87 Difference]: Start difference. First operand 6837 states and 11276 transitions. Second operand 15 states. [2018-09-30 10:19:01,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:19:01,977 INFO L93 Difference]: Finished difference Result 7136 states and 11762 transitions. [2018-09-30 10:19:01,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 10:19:01,977 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-09-30 10:19:01,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:19:01,985 INFO L225 Difference]: With dead ends: 7136 [2018-09-30 10:19:01,985 INFO L226 Difference]: Without dead ends: 7134 [2018-09-30 10:19:01,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2018-09-30 10:19:01,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7134 states. [2018-09-30 10:19:05,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7134 to 6814. [2018-09-30 10:19:05,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6814 states. [2018-09-30 10:19:05,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6814 states to 6814 states and 11236 transitions. [2018-09-30 10:19:05,458 INFO L78 Accepts]: Start accepts. Automaton has 6814 states and 11236 transitions. Word has length 21 [2018-09-30 10:19:05,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:19:05,458 INFO L480 AbstractCegarLoop]: Abstraction has 6814 states and 11236 transitions. [2018-09-30 10:19:05,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 10:19:05,458 INFO L276 IsEmpty]: Start isEmpty. Operand 6814 states and 11236 transitions. [2018-09-30 10:19:05,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-30 10:19:05,460 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:19:05,460 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-09-30 10:19:05,460 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr2ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:19:05,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:19:05,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1513598179, now seen corresponding path program 4 times [2018-09-30 10:19:05,461 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:19:05,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:19:05,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:19:05,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:19:05,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:19:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:19:05,607 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:19:05,607 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:19:05,607 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:19:05,616 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:19:05,625 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:19:05,625 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:19:05,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:19:05,776 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 10:19:05,796 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:19:05,796 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-09-30 10:19:05,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-30 10:19:05,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-30 10:19:05,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2018-09-30 10:19:05,797 INFO L87 Difference]: Start difference. First operand 6814 states and 11236 transitions. Second operand 20 states. Received shutdown request... [2018-09-30 10:19:15,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-09-30 10:19:15,000 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 10:19:15,006 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 10:19:15,006 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:19:15 BoogieIcfgContainer [2018-09-30 10:19:15,006 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:19:15,007 INFO L168 Benchmark]: Toolchain (without parser) took 250574.03 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -208.7 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-09-30 10:19:15,008 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:19:15,009 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:19:15,009 INFO L168 Benchmark]: Boogie Preprocessor took 24.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:19:15,009 INFO L168 Benchmark]: RCFGBuilder took 471.72 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-30 10:19:15,010 INFO L168 Benchmark]: TraceAbstraction took 250028.60 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -229.8 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-09-30 10:19:15,012 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.87 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 41.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.52 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 471.72 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 250028.60 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -229.8 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 69). Cancelled while BasicCegarLoop was constructing difference of abstraction (6814states) and FLOYD_HOARE automaton (currently 126 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (7795 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 78). Cancelled while BasicCegarLoop was constructing difference of abstraction (6814states) and FLOYD_HOARE automaton (currently 126 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (7795 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 37). Cancelled while BasicCegarLoop was constructing difference of abstraction (6814states) and FLOYD_HOARE automaton (currently 126 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (7795 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 58). Cancelled while BasicCegarLoop was constructing difference of abstraction (6814states) and FLOYD_HOARE automaton (currently 126 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (7795 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 4 error locations. TIMEOUT Result, 249.9s OverallTime, 61 OverallIterations, 4 TraceHistogramMax, 188.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2152 SDtfs, 10727 SDslu, 7108 SDs, 0 SdLazy, 56625 SolverSat, 7360 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 56.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3333 GetRequests, 511 SyntacticMatches, 21 SemanticMatches, 2801 ConstructedPredicates, 0 IntricatePredicates, 8 DeprecatedPredicates, 75500 ImplicationChecksByTransitivity, 81.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6977occurred in iteration=57, 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: 39.4s AutomataMinimizationTime, 60 MinimizatonAttempts, 33087 StatesRemovedByMinimization, 60 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 18.8s InterpolantComputationTime, 1594 NumberOfCodeBlocks, 1594 NumberOfCodeBlocksAsserted, 124 NumberOfCheckSat, 1480 ConstructedInterpolants, 87 QuantifiedInterpolants, 145148 SizeOfPredicates, 236 NumberOfNonLiveVariables, 2412 ConjunctsInSsa, 507 ConjunctsInUnsatCore, 114 InterpolantComputations, 9 PerfectInterpolantSequences, 200/918 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_product_WithoutIf.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-19-15-021.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithoutIf.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-19-15-021.csv Completed graceful shutdown