java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-sophisticated.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:50:56,106 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:50:56,108 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:50:56,120 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:50:56,121 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:50:56,122 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:50:56,123 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:50:56,125 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:50:56,126 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:50:56,127 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:50:56,128 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:50:56,128 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:50:56,129 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:50:56,130 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:50:56,132 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:50:56,132 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:50:56,133 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:50:56,135 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:50:56,137 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:50:56,139 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:50:56,140 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:50:56,141 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:50:56,143 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:50:56,144 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:50:56,144 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:50:56,145 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:50:56,146 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:50:56,147 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:50:56,148 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:50:56,149 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:50:56,149 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:50:56,150 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:50:56,150 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:50:56,150 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:50:56,151 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:50:56,152 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:50:56,152 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 09:50:56,169 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:50:56,169 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:50:56,170 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:50:56,170 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:50:56,173 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:50:56,174 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:50:56,174 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:50:56,174 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:50:56,174 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:50:56,174 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:50:56,175 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:50:56,175 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:50:56,175 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:50:56,175 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:50:56,175 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:50:56,176 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:50:56,176 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:50:56,176 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:50:56,176 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:50:56,176 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:50:56,178 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:50:56,178 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:50:56,178 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:50:56,178 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:50:56,179 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:50:56,179 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:50:56,179 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:50:56,179 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:50:56,179 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:50:56,180 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:50:56,180 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 09:50:56,241 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:50:56,257 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:50:56,264 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:50:56,265 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:50:56,266 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:50:56,266 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-sophisticated.bpl [2018-10-04 09:50:56,267 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-sophisticated.bpl' [2018-10-04 09:50:56,320 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:50:56,321 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:50:56,322 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:50:56,322 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:50:56,323 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:50:56,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:50:56" (1/1) ... [2018-10-04 09:50:56,358 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:50:56" (1/1) ... [2018-10-04 09:50:56,363 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 09:50:56,363 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 09:50:56,364 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 09:50:56,366 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:50:56,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:50:56,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:50:56,367 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:50:56,378 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:50:56" (1/1) ... [2018-10-04 09:50:56,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:50:56" (1/1) ... [2018-10-04 09:50:56,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:50:56" (1/1) ... [2018-10-04 09:50:56,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:50:56" (1/1) ... [2018-10-04 09:50:56,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:50:56" (1/1) ... [2018-10-04 09:50:56,385 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:50:56" (1/1) ... [2018-10-04 09:50:56,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:50:56" (1/1) ... [2018-10-04 09:50:56,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:50:56,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:50:56,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:50:56,388 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:50:56,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:50:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:50:56,444 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-10-04 09:50:56,444 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-04 09:50:56,445 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-04 09:50:56,630 INFO L338 CfgBuilder]: Using library mode [2018-10-04 09:50:56,631 INFO L202 PluginConnector]: Adding new model Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:50:56 BoogieIcfgContainer [2018-10-04 09:50:56,631 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:50:56,635 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:50:56,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:50:56,639 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:50:56,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:50:56" (1/2) ... [2018-10-04 09:50:56,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bce42d1 and model type Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:50:56, skipping insertion in model container [2018-10-04 09:50:56,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:50:56" (2/2) ... [2018-10-04 09:50:56,642 INFO L112 eAbstractionObserver]: Analyzing ICFG Luxembourg-sophisticated.bpl [2018-10-04 09:50:56,652 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:50:56,664 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:50:56,719 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:50:56,720 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:50:56,720 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:50:56,721 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:50:56,721 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:50:56,721 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:50:56,721 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:50:56,721 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:50:56,722 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:50:56,737 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-10-04 09:50:56,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 09:50:56,753 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:50:56,756 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 09:50:56,757 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:50:56,764 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:50:56,764 INFO L82 PathProgramCache]: Analyzing trace with hash 30240, now seen corresponding path program 1 times [2018-10-04 09:50:56,766 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:50:56,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:50:56,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:56,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:50:56,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:50:56,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:56,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:50:56,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:50:56,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:50:56,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:50:56,950 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:50:56,952 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-10-04 09:50:57,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:50:57,023 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-10-04 09:50:57,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:50:57,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-04 09:50:57,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:50:57,041 INFO L225 Difference]: With dead ends: 15 [2018-10-04 09:50:57,042 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 09:50:57,054 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:50:57,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 09:50:57,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-10-04 09:50:57,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-04 09:50:57,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-10-04 09:50:57,117 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2018-10-04 09:50:57,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:50:57,117 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-10-04 09:50:57,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:50:57,117 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-10-04 09:50:57,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 09:50:57,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:50:57,118 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 09:50:57,119 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:50:57,119 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:50:57,119 INFO L82 PathProgramCache]: Analyzing trace with hash 28755491, now seen corresponding path program 1 times [2018-10-04 09:50:57,119 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:50:57,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:50:57,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:57,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:50:57,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:50:57,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:57,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:50:57,204 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:50:57,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:50:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:50:57,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:50:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:57,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:50:57,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 09:50:57,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:50:57,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:50:57,313 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:50:57,313 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2018-10-04 09:50:57,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:50:57,378 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-10-04 09:50:57,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 09:50:57,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-10-04 09:50:57,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:50:57,379 INFO L225 Difference]: With dead ends: 11 [2018-10-04 09:50:57,379 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 09:50:57,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 2 [2018-10-04 09:50:57,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 09:50:57,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-10-04 09:50:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 09:50:57,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-10-04 09:50:57,383 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2018-10-04 09:50:57,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:50:57,384 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-10-04 09:50:57,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:50:57,384 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2018-10-04 09:50:57,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 09:50:57,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:50:57,385 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 09:50:57,385 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:50:57,385 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:50:57,385 INFO L82 PathProgramCache]: Analyzing trace with hash 28757413, now seen corresponding path program 1 times [2018-10-04 09:50:57,385 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:50:57,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:50:57,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:57,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:50:57,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:50:57,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:57,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:50:57,437 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:50:57,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:50:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:50:57,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:50:57,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:57,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:50:57,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 09:50:57,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:50:57,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:50:57,514 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:50:57,514 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 4 states. [2018-10-04 09:50:57,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:50:57,547 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2018-10-04 09:50:57,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 09:50:57,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-10-04 09:50:57,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:50:57,549 INFO L225 Difference]: With dead ends: 12 [2018-10-04 09:50:57,549 INFO L226 Difference]: Without dead ends: 10 [2018-10-04 09:50:57,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 2 [2018-10-04 09:50:57,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-04 09:50:57,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-10-04 09:50:57,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 09:50:57,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-10-04 09:50:57,553 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2018-10-04 09:50:57,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:50:57,554 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-10-04 09:50:57,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:50:57,554 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2018-10-04 09:50:57,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 09:50:57,555 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:50:57,555 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2018-10-04 09:50:57,555 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:50:57,555 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:50:57,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1863917926, now seen corresponding path program 2 times [2018-10-04 09:50:57,556 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:50:57,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:50:57,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:57,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:50:57,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:50:57,613 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:57,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:50:57,614 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:50:57,627 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:50:57,660 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:50:57,660 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:50:57,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:50:57,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:57,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:50:57,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 09:50:57,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 09:50:57,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 09:50:57,749 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:50:57,750 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 5 states. [2018-10-04 09:50:57,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:50:57,783 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2018-10-04 09:50:57,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:50:57,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-10-04 09:50:57,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:50:57,785 INFO L225 Difference]: With dead ends: 14 [2018-10-04 09:50:57,785 INFO L226 Difference]: Without dead ends: 12 [2018-10-04 09:50:57,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 3 [2018-10-04 09:50:57,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-04 09:50:57,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-10-04 09:50:57,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 09:50:57,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-10-04 09:50:57,789 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 [2018-10-04 09:50:57,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:50:57,789 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-10-04 09:50:57,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 09:50:57,790 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2018-10-04 09:50:57,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 09:50:57,790 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:50:57,790 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-10-04 09:50:57,791 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:50:57,791 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:50:57,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1863919848, now seen corresponding path program 1 times [2018-10-04 09:50:57,791 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:50:57,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:50:57,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:57,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:50:57,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:50:57,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:57,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:50:57,991 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:50:58,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:50:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:50:58,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:50:58,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:58,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:50:58,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 09:50:58,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 09:50:58,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 09:50:58,111 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:50:58,112 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 5 states. [2018-10-04 09:50:58,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:50:58,135 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2018-10-04 09:50:58,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:50:58,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-10-04 09:50:58,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:50:58,138 INFO L225 Difference]: With dead ends: 14 [2018-10-04 09:50:58,138 INFO L226 Difference]: Without dead ends: 12 [2018-10-04 09:50:58,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 3 [2018-10-04 09:50:58,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-04 09:50:58,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-10-04 09:50:58,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 09:50:58,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-10-04 09:50:58,142 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 [2018-10-04 09:50:58,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:50:58,142 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-10-04 09:50:58,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 09:50:58,143 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2018-10-04 09:50:58,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 09:50:58,143 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:50:58,143 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-10-04 09:50:58,144 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:50:58,144 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:50:58,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1865764968, now seen corresponding path program 2 times [2018-10-04 09:50:58,144 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:50:58,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:50:58,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:58,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:50:58,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:50:58,199 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:58,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:50:58,200 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:50:58,210 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:50:58,227 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:50:58,228 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:50:58,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:50:58,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:58,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:50:58,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 09:50:58,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 09:50:58,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 09:50:58,278 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:50:58,279 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 5 states. [2018-10-04 09:50:58,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:50:58,315 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2018-10-04 09:50:58,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:50:58,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-10-04 09:50:58,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:50:58,322 INFO L225 Difference]: With dead ends: 17 [2018-10-04 09:50:58,322 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 09:50:58,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 3 [2018-10-04 09:50:58,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 09:50:58,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-10-04 09:50:58,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 09:50:58,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-10-04 09:50:58,327 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 7 [2018-10-04 09:50:58,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:50:58,327 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-10-04 09:50:58,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 09:50:58,328 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2018-10-04 09:50:58,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 09:50:58,328 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:50:58,328 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2018-10-04 09:50:58,329 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:50:58,329 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:50:58,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1865766890, now seen corresponding path program 2 times [2018-10-04 09:50:58,329 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:50:58,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:50:58,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:58,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:50:58,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:50:58,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:58,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:50:58,454 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:50:58,469 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:50:58,480 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:50:58,480 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:50:58,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:50:58,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:58,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:50:58,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 09:50:58,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 09:50:58,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 09:50:58,533 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:50:58,533 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 5 states. [2018-10-04 09:50:58,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:50:58,561 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2018-10-04 09:50:58,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:50:58,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-10-04 09:50:58,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:50:58,563 INFO L225 Difference]: With dead ends: 16 [2018-10-04 09:50:58,563 INFO L226 Difference]: Without dead ends: 14 [2018-10-04 09:50:58,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-04 09:50:58,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-04 09:50:58,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2018-10-04 09:50:58,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 09:50:58,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-10-04 09:50:58,568 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 [2018-10-04 09:50:58,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:50:58,568 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-10-04 09:50:58,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 09:50:58,568 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2018-10-04 09:50:58,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 09:50:58,568 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:50:58,569 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-10-04 09:50:58,569 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:50:58,569 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:50:58,569 INFO L82 PathProgramCache]: Analyzing trace with hash 223459305, now seen corresponding path program 3 times [2018-10-04 09:50:58,569 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:50:58,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:50:58,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:58,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:50:58,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:50:58,622 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:58,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:50:58,623 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:50:58,633 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:50:58,645 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 09:50:58,645 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:50:58,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:50:58,693 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:58,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:50:58,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 09:50:58,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 09:50:58,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 09:50:58,714 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:50:58,714 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 6 states. [2018-10-04 09:50:58,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:50:58,780 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2018-10-04 09:50:58,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 09:50:58,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 09:50:58,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:50:58,781 INFO L225 Difference]: With dead ends: 19 [2018-10-04 09:50:58,781 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 09:50:58,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 4 [2018-10-04 09:50:58,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 09:50:58,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-10-04 09:50:58,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 09:50:58,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-10-04 09:50:58,787 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 9 [2018-10-04 09:50:58,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:50:58,787 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-10-04 09:50:58,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 09:50:58,787 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-10-04 09:50:58,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 09:50:58,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:50:58,788 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-10-04 09:50:58,788 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:50:58,788 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:50:58,789 INFO L82 PathProgramCache]: Analyzing trace with hash 223461227, now seen corresponding path program 3 times [2018-10-04 09:50:58,789 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:50:58,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:50:58,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:58,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:50:58,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:50:58,863 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:58,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:50:58,863 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:50:58,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:50:58,881 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 09:50:58,881 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:50:58,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:50:58,916 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:58,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:50:58,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 09:50:58,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 09:50:58,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 09:50:58,940 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:50:58,940 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 6 states. [2018-10-04 09:50:59,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:50:59,095 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2018-10-04 09:50:59,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 09:50:59,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 09:50:59,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:50:59,096 INFO L225 Difference]: With dead ends: 18 [2018-10-04 09:50:59,097 INFO L226 Difference]: Without dead ends: 16 [2018-10-04 09:50:59,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 4 [2018-10-04 09:50:59,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-04 09:50:59,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-10-04 09:50:59,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 09:50:59,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-10-04 09:50:59,101 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2018-10-04 09:50:59,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:50:59,102 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-10-04 09:50:59,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 09:50:59,102 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2018-10-04 09:50:59,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 09:50:59,103 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:50:59,103 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-10-04 09:50:59,103 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:50:59,104 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:50:59,104 INFO L82 PathProgramCache]: Analyzing trace with hash 225306347, now seen corresponding path program 4 times [2018-10-04 09:50:59,104 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:50:59,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:50:59,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:59,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:50:59,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:50:59,417 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:59,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:50:59,418 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:50:59,427 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:50:59,441 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:50:59,441 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:50:59,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:50:59,468 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:59,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:50:59,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 09:50:59,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 09:50:59,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 09:50:59,492 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:50:59,493 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 6 states. [2018-10-04 09:50:59,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:50:59,549 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2018-10-04 09:50:59,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 09:50:59,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 09:50:59,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:50:59,550 INFO L225 Difference]: With dead ends: 19 [2018-10-04 09:50:59,551 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 09:50:59,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 4 [2018-10-04 09:50:59,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 09:50:59,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-10-04 09:50:59,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 09:50:59,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-10-04 09:50:59,556 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 9 [2018-10-04 09:50:59,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:50:59,556 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-10-04 09:50:59,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 09:50:59,557 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-10-04 09:50:59,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 09:50:59,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:50:59,557 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-10-04 09:50:59,558 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:50:59,558 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:50:59,558 INFO L82 PathProgramCache]: Analyzing trace with hash 225308269, now seen corresponding path program 5 times [2018-10-04 09:50:59,558 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:50:59,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:50:59,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:59,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:50:59,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:50:59,679 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:59,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:50:59,680 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:50:59,687 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:50:59,695 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-04 09:50:59,695 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:50:59,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:50:59,728 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:59,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:50:59,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 09:50:59,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 09:50:59,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 09:50:59,749 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:50:59,749 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 6 states. [2018-10-04 09:50:59,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:50:59,770 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2018-10-04 09:50:59,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 09:50:59,771 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 09:50:59,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:50:59,772 INFO L225 Difference]: With dead ends: 18 [2018-10-04 09:50:59,772 INFO L226 Difference]: Without dead ends: 16 [2018-10-04 09:50:59,772 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 4 [2018-10-04 09:50:59,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-04 09:50:59,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-10-04 09:50:59,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 09:50:59,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-10-04 09:50:59,776 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2018-10-04 09:50:59,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:50:59,777 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-10-04 09:50:59,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 09:50:59,777 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2018-10-04 09:50:59,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 09:50:59,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:50:59,778 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-10-04 09:50:59,778 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:50:59,778 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:50:59,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1998466667, now seen corresponding path program 6 times [2018-10-04 09:50:59,778 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:50:59,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:50:59,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:59,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:50:59,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:50:59,836 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:59,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:50:59,837 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:50:59,850 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:50:59,884 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-04 09:50:59,884 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:50:59,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:50:59,921 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:50:59,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:50:59,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 09:50:59,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 09:50:59,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 09:50:59,941 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:50:59,942 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 6 states. [2018-10-04 09:50:59,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:50:59,987 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2018-10-04 09:50:59,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 09:50:59,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 09:50:59,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:50:59,988 INFO L225 Difference]: With dead ends: 23 [2018-10-04 09:50:59,988 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 09:50:59,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 4 [2018-10-04 09:50:59,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 09:50:59,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2018-10-04 09:50:59,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 09:50:59,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 09:50:59,995 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 9 [2018-10-04 09:50:59,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:50:59,995 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 09:50:59,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 09:50:59,996 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 09:50:59,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 09:50:59,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:50:59,996 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-10-04 09:50:59,997 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:50:59,997 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:50:59,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1998468589, now seen corresponding path program 7 times [2018-10-04 09:50:59,997 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:50:59,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:50:59,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:50:59,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:50:59,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:00,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:00,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:00,066 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:00,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:00,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:00,106 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:00,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:00,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 09:51:00,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 09:51:00,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 09:51:00,127 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:00,128 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 6 states. [2018-10-04 09:51:00,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:00,166 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2018-10-04 09:51:00,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 09:51:00,167 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 09:51:00,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:00,167 INFO L225 Difference]: With dead ends: 23 [2018-10-04 09:51:00,167 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 09:51:00,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 4 [2018-10-04 09:51:00,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 09:51:00,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. [2018-10-04 09:51:00,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 09:51:00,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-10-04 09:51:00,174 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 9 [2018-10-04 09:51:00,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:00,174 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-10-04 09:51:00,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 09:51:00,174 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-10-04 09:51:00,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 09:51:00,175 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:00,175 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-10-04 09:51:00,175 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:00,175 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:00,176 INFO L82 PathProgramCache]: Analyzing trace with hash 2000313709, now seen corresponding path program 8 times [2018-10-04 09:51:00,176 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:00,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:00,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:00,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:00,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:00,381 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:00,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:00,382 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:00,392 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:51:00,400 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:51:00,400 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:00,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:00,437 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:00,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:00,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 09:51:00,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 09:51:00,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 09:51:00,463 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:00,463 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 6 states. [2018-10-04 09:51:00,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:00,500 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2018-10-04 09:51:00,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 09:51:00,504 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 09:51:00,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:00,505 INFO L225 Difference]: With dead ends: 21 [2018-10-04 09:51:00,505 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 09:51:00,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 4 [2018-10-04 09:51:00,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 09:51:00,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2018-10-04 09:51:00,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 09:51:00,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 09:51:00,510 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 9 [2018-10-04 09:51:00,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:00,511 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 09:51:00,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 09:51:00,511 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 09:51:00,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 09:51:00,511 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:00,512 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-10-04 09:51:00,512 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:00,512 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:00,512 INFO L82 PathProgramCache]: Analyzing trace with hash 2000315631, now seen corresponding path program 3 times [2018-10-04 09:51:00,512 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:00,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:00,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:00,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:00,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:00,567 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:00,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:00,568 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:00,575 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:51:00,581 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 09:51:00,581 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:00,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:00,644 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:00,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:00,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 09:51:00,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 09:51:00,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 09:51:00,666 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:00,666 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 6 states. [2018-10-04 09:51:00,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:00,730 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2018-10-04 09:51:00,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 09:51:00,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 09:51:00,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:00,733 INFO L225 Difference]: With dead ends: 20 [2018-10-04 09:51:00,733 INFO L226 Difference]: Without dead ends: 18 [2018-10-04 09:51:00,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 4 [2018-10-04 09:51:00,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-04 09:51:00,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 12. [2018-10-04 09:51:00,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 09:51:00,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-10-04 09:51:00,738 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2018-10-04 09:51:00,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:00,738 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-10-04 09:51:00,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 09:51:00,738 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2018-10-04 09:51:00,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 09:51:00,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:00,739 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-10-04 09:51:00,739 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:00,739 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:00,740 INFO L82 PathProgramCache]: Analyzing trace with hash -4277844, now seen corresponding path program 4 times [2018-10-04 09:51:00,740 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:00,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:00,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:00,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:00,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:00,852 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:00,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:00,852 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:00,866 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:51:00,880 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:51:00,880 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:00,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:00,995 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:01,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:01,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 09:51:01,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:51:01,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:51:01,017 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:01,017 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 7 states. [2018-10-04 09:51:01,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:01,057 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2018-10-04 09:51:01,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:51:01,058 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 09:51:01,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:01,058 INFO L225 Difference]: With dead ends: 25 [2018-10-04 09:51:01,059 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 09:51:01,059 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 5 [2018-10-04 09:51:01,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 09:51:01,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-10-04 09:51:01,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 09:51:01,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 09:51:01,066 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 11 [2018-10-04 09:51:01,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:01,067 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 09:51:01,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:51:01,067 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 09:51:01,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 09:51:01,067 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:01,067 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 09:51:01,068 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:01,068 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:01,068 INFO L82 PathProgramCache]: Analyzing trace with hash -4275922, now seen corresponding path program 9 times [2018-10-04 09:51:01,068 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:01,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:01,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:01,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:01,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:01,166 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:01,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:01,166 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-10-04 09:51:01,175 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:51:01,181 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-04 09:51:01,182 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:01,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:01,211 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:01,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:01,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 09:51:01,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:51:01,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:51:01,233 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:01,233 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 7 states. [2018-10-04 09:51:01,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:01,285 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2018-10-04 09:51:01,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:51:01,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 09:51:01,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:01,287 INFO L225 Difference]: With dead ends: 25 [2018-10-04 09:51:01,287 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 09:51:01,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 09:51:01,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 09:51:01,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-10-04 09:51:01,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 09:51:01,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 09:51:01,295 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 11 [2018-10-04 09:51:01,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:01,295 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 09:51:01,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:51:01,295 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 09:51:01,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 09:51:01,296 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:01,296 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 09:51:01,296 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:01,296 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:01,297 INFO L82 PathProgramCache]: Analyzing trace with hash -2430802, now seen corresponding path program 10 times [2018-10-04 09:51:01,297 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:01,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:01,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:01,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:01,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:01,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:01,361 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-10-04 09:51:01,369 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:51:01,375 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:51:01,376 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:01,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:01,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:01,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 09:51:01,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:51:01,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:51:01,424 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:01,425 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 7 states. [2018-10-04 09:51:01,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:01,492 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2018-10-04 09:51:01,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:51:01,492 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 09:51:01,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:01,493 INFO L225 Difference]: With dead ends: 23 [2018-10-04 09:51:01,493 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 09:51:01,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 5 [2018-10-04 09:51:01,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 09:51:01,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-10-04 09:51:01,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 09:51:01,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 09:51:01,503 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 11 [2018-10-04 09:51:01,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:01,503 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 09:51:01,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:51:01,504 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 09:51:01,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 09:51:01,504 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:01,504 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-10-04 09:51:01,505 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:01,505 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:01,505 INFO L82 PathProgramCache]: Analyzing trace with hash -2428880, now seen corresponding path program 11 times [2018-10-04 09:51:01,505 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:01,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:01,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:01,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:01,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:01,629 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:01,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:01,630 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-10-04 09:51:01,645 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:51:01,654 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-10-04 09:51:01,654 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:01,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:01,734 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:01,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:01,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 09:51:01,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:51:01,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:51:01,755 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:01,755 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 7 states. [2018-10-04 09:51:01,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:01,956 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2018-10-04 09:51:01,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:51:01,957 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 09:51:01,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:01,957 INFO L225 Difference]: With dead ends: 22 [2018-10-04 09:51:01,957 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 09:51:01,957 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 09:51:01,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 09:51:01,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2018-10-04 09:51:01,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 09:51:01,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-10-04 09:51:01,963 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 11 [2018-10-04 09:51:01,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:01,964 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-10-04 09:51:01,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:51:01,964 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-10-04 09:51:01,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 09:51:01,965 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:01,965 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 09:51:01,965 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:01,965 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:01,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1770729518, now seen corresponding path program 12 times [2018-10-04 09:51:01,965 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:01,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:01,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:01,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:01,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:02,061 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:02,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:02,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 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-10-04 09:51:02,071 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:51:02,078 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-10-04 09:51:02,078 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:02,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:02,111 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:02,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:02,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 09:51:02,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:51:02,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:51:02,133 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:02,133 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 7 states. [2018-10-04 09:51:02,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:02,273 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2018-10-04 09:51:02,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:51:02,274 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 09:51:02,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:02,274 INFO L225 Difference]: With dead ends: 25 [2018-10-04 09:51:02,274 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 09:51:02,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 09:51:02,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 09:51:02,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-10-04 09:51:02,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 09:51:02,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 09:51:02,285 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 11 [2018-10-04 09:51:02,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:02,285 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 09:51:02,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:51:02,286 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 09:51:02,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 09:51:02,286 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:02,286 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-10-04 09:51:02,286 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:02,287 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:02,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1770731440, now seen corresponding path program 13 times [2018-10-04 09:51:02,287 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:02,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:02,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:02,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:02,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:02,342 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:02,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:02,342 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-10-04 09:51:02,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:02,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:02,463 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:02,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:02,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 09:51:02,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:51:02,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:51:02,485 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:02,485 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 7 states. [2018-10-04 09:51:02,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:02,525 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2018-10-04 09:51:02,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:51:02,526 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 09:51:02,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:02,526 INFO L225 Difference]: With dead ends: 25 [2018-10-04 09:51:02,526 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 09:51:02,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 09:51:02,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 09:51:02,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-10-04 09:51:02,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 09:51:02,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 09:51:02,533 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 11 [2018-10-04 09:51:02,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:02,533 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 09:51:02,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:51:02,534 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 09:51:02,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 09:51:02,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:02,534 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-10-04 09:51:02,534 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:02,535 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:02,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1772576560, now seen corresponding path program 14 times [2018-10-04 09:51:02,535 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:02,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:02,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:02,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:02,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:02,584 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:02,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:02,585 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-10-04 09:51:02,593 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:51:02,600 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:51:02,600 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:02,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:02,637 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:02,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:02,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 09:51:02,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:51:02,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:51:02,658 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:02,658 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 7 states. [2018-10-04 09:51:02,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:02,827 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2018-10-04 09:51:02,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:51:02,830 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 09:51:02,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:02,831 INFO L225 Difference]: With dead ends: 23 [2018-10-04 09:51:02,831 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 09:51:02,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 5 [2018-10-04 09:51:02,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 09:51:02,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-10-04 09:51:02,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 09:51:02,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 09:51:02,840 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 11 [2018-10-04 09:51:02,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:02,841 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 09:51:02,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:51:02,841 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 09:51:02,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 09:51:02,841 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:02,842 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 09:51:02,842 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:02,842 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:02,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1772578482, now seen corresponding path program 15 times [2018-10-04 09:51:02,842 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:02,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:02,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:02,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:02,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:03,244 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:03,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:03,244 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-10-04 09:51:03,251 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:51:03,261 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-04 09:51:03,261 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:03,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:03,283 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:03,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:03,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 09:51:03,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:51:03,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:51:03,305 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:03,305 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 7 states. [2018-10-04 09:51:03,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:03,414 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2018-10-04 09:51:03,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:51:03,414 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 09:51:03,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:03,415 INFO L225 Difference]: With dead ends: 22 [2018-10-04 09:51:03,415 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 09:51:03,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 5 [2018-10-04 09:51:03,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 09:51:03,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2018-10-04 09:51:03,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 09:51:03,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-10-04 09:51:03,421 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 11 [2018-10-04 09:51:03,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:03,421 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-10-04 09:51:03,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:51:03,421 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-10-04 09:51:03,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 09:51:03,421 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:03,422 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 09:51:03,422 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:03,422 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:03,422 INFO L82 PathProgramCache]: Analyzing trace with hash 675780526, now seen corresponding path program 16 times [2018-10-04 09:51:03,422 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:03,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:03,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:03,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:03,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:03,469 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:03,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:03,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 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-10-04 09:51:03,479 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:51:03,512 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:51:03,512 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:03,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:03,637 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:03,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:03,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 09:51:03,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:51:03,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:51:03,659 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:03,659 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 7 states. [2018-10-04 09:51:03,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:03,743 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 09:51:03,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:51:03,743 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 09:51:03,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:03,744 INFO L225 Difference]: With dead ends: 31 [2018-10-04 09:51:03,744 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 09:51:03,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 09:51:03,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 09:51:03,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-10-04 09:51:03,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 09:51:03,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 09:51:03,753 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 11 [2018-10-04 09:51:03,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:03,753 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 09:51:03,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:51:03,754 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 09:51:03,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 09:51:03,754 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:03,754 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-10-04 09:51:03,754 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:03,755 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:03,755 INFO L82 PathProgramCache]: Analyzing trace with hash 675782448, now seen corresponding path program 17 times [2018-10-04 09:51:03,755 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:03,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:03,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:03,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:03,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:03,804 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:03,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:03,804 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-10-04 09:51:03,812 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:51:03,819 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-10-04 09:51:03,819 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:03,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:03,843 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:03,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:03,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 09:51:03,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:51:03,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:51:03,866 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:03,866 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 7 states. [2018-10-04 09:51:03,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:03,917 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2018-10-04 09:51:03,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:51:03,917 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 09:51:03,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:03,918 INFO L225 Difference]: With dead ends: 29 [2018-10-04 09:51:03,918 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 09:51:03,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 5 [2018-10-04 09:51:03,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 09:51:03,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 18. [2018-10-04 09:51:03,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 09:51:03,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 09:51:03,928 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 11 [2018-10-04 09:51:03,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:03,928 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 09:51:03,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:51:03,928 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 09:51:03,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 09:51:03,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:03,929 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-10-04 09:51:03,929 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:03,929 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:03,929 INFO L82 PathProgramCache]: Analyzing trace with hash 677627568, now seen corresponding path program 18 times [2018-10-04 09:51:03,929 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:03,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:03,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:03,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:03,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:03,972 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:03,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:03,972 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-10-04 09:51:03,980 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:51:03,992 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-10-04 09:51:03,992 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:03,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:04,065 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:04,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:04,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 09:51:04,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:51:04,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:51:04,086 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:04,086 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 7 states. [2018-10-04 09:51:04,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:04,134 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 09:51:04,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:51:04,134 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 09:51:04,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:04,135 INFO L225 Difference]: With dead ends: 31 [2018-10-04 09:51:04,136 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 09:51:04,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 09:51:04,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 09:51:04,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-10-04 09:51:04,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 09:51:04,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 09:51:04,147 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 11 [2018-10-04 09:51:04,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:04,147 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 09:51:04,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:51:04,147 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 09:51:04,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 09:51:04,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:04,148 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 09:51:04,148 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:04,148 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:04,149 INFO L82 PathProgramCache]: Analyzing trace with hash 677629490, now seen corresponding path program 19 times [2018-10-04 09:51:04,149 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:04,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:04,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:04,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:04,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:04,201 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:04,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:04,201 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-10-04 09:51:04,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:04,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:04,245 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:04,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:04,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 09:51:04,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:51:04,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:51:04,267 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:04,267 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 7 states. [2018-10-04 09:51:04,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:04,302 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2018-10-04 09:51:04,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:51:04,303 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 09:51:04,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:04,303 INFO L225 Difference]: With dead ends: 29 [2018-10-04 09:51:04,304 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 09:51:04,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 5 [2018-10-04 09:51:04,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 09:51:04,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 16. [2018-10-04 09:51:04,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 09:51:04,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 09:51:04,311 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 11 [2018-10-04 09:51:04,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:04,311 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 09:51:04,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:51:04,312 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 09:51:04,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 09:51:04,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:04,312 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-10-04 09:51:04,312 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:04,313 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:04,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1844179408, now seen corresponding path program 20 times [2018-10-04 09:51:04,313 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:04,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:04,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:04,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:04,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:04,360 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:04,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:04,360 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-10-04 09:51:04,369 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:51:04,374 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:51:04,374 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:04,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:04,432 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:04,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:04,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 09:51:04,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:51:04,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:51:04,453 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:04,453 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 7 states. [2018-10-04 09:51:04,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:04,481 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2018-10-04 09:51:04,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:51:04,481 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 09:51:04,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:04,481 INFO L225 Difference]: With dead ends: 27 [2018-10-04 09:51:04,481 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 09:51:04,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 5 [2018-10-04 09:51:04,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 09:51:04,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2018-10-04 09:51:04,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 09:51:04,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 09:51:04,491 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 11 [2018-10-04 09:51:04,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:04,492 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 09:51:04,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:51:04,492 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 09:51:04,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 09:51:04,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:04,492 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 09:51:04,493 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:04,493 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:04,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1844177486, now seen corresponding path program 21 times [2018-10-04 09:51:04,493 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:04,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:04,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:04,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:04,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:04,537 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:04,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:04,537 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-10-04 09:51:04,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:51:04,561 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-04 09:51:04,561 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:04,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:04,627 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:04,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:04,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 09:51:04,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:51:04,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:51:04,651 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:04,651 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 7 states. [2018-10-04 09:51:04,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:04,680 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2018-10-04 09:51:04,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:51:04,681 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 09:51:04,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:04,681 INFO L225 Difference]: With dead ends: 27 [2018-10-04 09:51:04,682 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 09:51:04,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 5 [2018-10-04 09:51:04,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 09:51:04,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-10-04 09:51:04,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 09:51:04,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 09:51:04,692 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 11 [2018-10-04 09:51:04,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:04,692 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 09:51:04,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:51:04,693 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 09:51:04,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 09:51:04,693 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:04,693 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 09:51:04,693 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:04,694 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:04,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1842332366, now seen corresponding path program 22 times [2018-10-04 09:51:04,694 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:04,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:04,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:04,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:04,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:04,887 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:04,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:04,888 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-10-04 09:51:04,897 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:51:04,902 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:51:04,902 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:04,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:04,921 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:04,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:04,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 09:51:04,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:51:04,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:51:04,943 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:04,943 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 7 states. [2018-10-04 09:51:04,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:04,983 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2018-10-04 09:51:04,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:51:04,983 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 09:51:04,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:04,984 INFO L225 Difference]: With dead ends: 25 [2018-10-04 09:51:04,984 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 09:51:04,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 5 [2018-10-04 09:51:04,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 09:51:04,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-10-04 09:51:04,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 09:51:04,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 09:51:04,995 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 11 [2018-10-04 09:51:04,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:04,995 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 09:51:04,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:51:04,995 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 09:51:04,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 09:51:04,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:04,996 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-10-04 09:51:04,996 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:04,996 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:04,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1842330444, now seen corresponding path program 4 times [2018-10-04 09:51:04,997 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:04,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:04,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:04,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:04,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:05,051 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:05,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:05,052 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-10-04 09:51:05,061 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:51:05,096 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:51:05,096 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:05,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:05,179 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:05,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:05,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 09:51:05,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:51:05,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:51:05,202 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:05,202 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 7 states. [2018-10-04 09:51:05,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:05,224 INFO L93 Difference]: Finished difference Result 24 states and 33 transitions. [2018-10-04 09:51:05,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:51:05,225 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 09:51:05,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:05,226 INFO L225 Difference]: With dead ends: 24 [2018-10-04 09:51:05,226 INFO L226 Difference]: Without dead ends: 22 [2018-10-04 09:51:05,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 09:51:05,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-04 09:51:05,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 14. [2018-10-04 09:51:05,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 09:51:05,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-10-04 09:51:05,233 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 11 [2018-10-04 09:51:05,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:05,233 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-10-04 09:51:05,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:51:05,233 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-10-04 09:51:05,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:05,233 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:05,234 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1] [2018-10-04 09:51:05,234 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:05,234 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:05,234 INFO L82 PathProgramCache]: Analyzing trace with hash 183654063, now seen corresponding path program 5 times [2018-10-04 09:51:05,234 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:05,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:05,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:05,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:05,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:05,282 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:05,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:05,282 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-10-04 09:51:05,290 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:51:05,358 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 09:51:05,358 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:05,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:05,555 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:05,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:05,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:05,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:05,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:05,577 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:05,578 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 8 states. [2018-10-04 09:51:05,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:05,622 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 09:51:05,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:05,622 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:05,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:05,623 INFO L225 Difference]: With dead ends: 33 [2018-10-04 09:51:05,623 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 09:51:05,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 6 [2018-10-04 09:51:05,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 09:51:05,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2018-10-04 09:51:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 09:51:05,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 09:51:05,636 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 09:51:05,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:05,636 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 09:51:05,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:05,636 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 09:51:05,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:05,637 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:05,637 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 09:51:05,637 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:05,637 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:05,637 INFO L82 PathProgramCache]: Analyzing trace with hash 183655985, now seen corresponding path program 23 times [2018-10-04 09:51:05,637 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:05,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:05,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:05,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:05,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:05,689 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:05,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:05,690 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-10-04 09:51:05,697 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:51:05,704 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 09:51:05,704 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:05,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:05,746 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:05,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:05,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:05,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:05,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:05,769 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:05,769 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 09:51:05,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:05,824 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 09:51:05,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:05,824 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:05,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:05,825 INFO L225 Difference]: With dead ends: 31 [2018-10-04 09:51:05,825 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 09:51:05,825 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 09:51:05,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 09:51:05,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-10-04 09:51:05,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 09:51:05,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 09:51:05,837 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 13 [2018-10-04 09:51:05,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:05,837 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 09:51:05,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:05,837 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 09:51:05,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:05,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:05,838 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 09:51:05,838 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:05,838 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:05,838 INFO L82 PathProgramCache]: Analyzing trace with hash 185501105, now seen corresponding path program 24 times [2018-10-04 09:51:05,838 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:05,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:05,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:05,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:05,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:05,941 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:05,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:05,942 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-10-04 09:51:05,949 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:51:05,961 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-10-04 09:51:05,962 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:05,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:06,011 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:06,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:06,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:06,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:06,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:06,032 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:06,032 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 8 states. [2018-10-04 09:51:06,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:06,217 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 09:51:06,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:06,217 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:06,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:06,218 INFO L225 Difference]: With dead ends: 33 [2018-10-04 09:51:06,218 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 09:51:06,218 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 09:51:06,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 09:51:06,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2018-10-04 09:51:06,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 09:51:06,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 09:51:06,232 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 09:51:06,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:06,232 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 09:51:06,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:06,232 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 09:51:06,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:06,233 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:06,233 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 09:51:06,233 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:06,233 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:06,233 INFO L82 PathProgramCache]: Analyzing trace with hash 185503027, now seen corresponding path program 25 times [2018-10-04 09:51:06,233 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:06,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:06,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:06,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:06,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:06,353 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:06,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:06,353 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-10-04 09:51:06,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:06,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:06,410 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:06,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:06,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:06,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:06,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:06,431 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:06,431 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 09:51:06,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:06,462 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 09:51:06,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:06,462 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:06,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:06,463 INFO L225 Difference]: With dead ends: 31 [2018-10-04 09:51:06,463 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 09:51:06,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 09:51:06,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 09:51:06,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-10-04 09:51:06,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 09:51:06,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 09:51:06,472 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 13 [2018-10-04 09:51:06,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:06,473 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 09:51:06,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:06,473 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 09:51:06,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:06,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:06,473 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 09:51:06,473 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:06,474 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:06,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1958661425, now seen corresponding path program 26 times [2018-10-04 09:51:06,474 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:06,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:06,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:06,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:06,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:06,542 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:06,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:06,543 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-10-04 09:51:06,550 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:51:06,555 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:51:06,556 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:06,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:06,593 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:06,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:06,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:06,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:06,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:06,614 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:06,614 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 8 states. [2018-10-04 09:51:06,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:06,651 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2018-10-04 09:51:06,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:06,651 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:06,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:06,652 INFO L225 Difference]: With dead ends: 29 [2018-10-04 09:51:06,652 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 09:51:06,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 09:51:06,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 09:51:06,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2018-10-04 09:51:06,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 09:51:06,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 09:51:06,665 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 09:51:06,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:06,665 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 09:51:06,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:06,665 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 09:51:06,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:06,666 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:06,666 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 09:51:06,666 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:06,666 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:06,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1958663347, now seen corresponding path program 27 times [2018-10-04 09:51:06,666 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:06,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:06,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:06,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:06,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:06,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:06,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 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-10-04 09:51:06,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:51:06,749 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 09:51:06,750 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:06,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:06,778 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:06,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:06,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:06,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:06,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:06,801 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:06,801 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 09:51:06,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:06,836 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2018-10-04 09:51:06,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:06,836 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:06,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:06,837 INFO L225 Difference]: With dead ends: 29 [2018-10-04 09:51:06,837 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 09:51:06,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 09:51:06,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 09:51:06,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-10-04 09:51:06,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 09:51:06,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 09:51:06,849 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 13 [2018-10-04 09:51:06,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:06,849 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 09:51:06,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:06,849 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 09:51:06,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:06,850 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:06,850 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 09:51:06,850 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:06,850 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:06,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1960508467, now seen corresponding path program 28 times [2018-10-04 09:51:06,850 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:06,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:06,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:06,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:06,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:06,908 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:06,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:06,908 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-10-04 09:51:06,916 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:51:06,929 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:51:06,929 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:06,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:06,965 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:06,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:06,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:06,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:06,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:06,985 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:06,985 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 8 states. [2018-10-04 09:51:07,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:07,060 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2018-10-04 09:51:07,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:07,060 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:07,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:07,061 INFO L225 Difference]: With dead ends: 27 [2018-10-04 09:51:07,061 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 09:51:07,061 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 09:51:07,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 09:51:07,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-10-04 09:51:07,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 09:51:07,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 09:51:07,075 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 09:51:07,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:07,076 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 09:51:07,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:07,076 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 09:51:07,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:07,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:07,076 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 09:51:07,077 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:07,077 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:07,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1960510389, now seen corresponding path program 29 times [2018-10-04 09:51:07,077 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:07,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:07,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:07,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:07,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:07,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:07,135 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:07,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:07,136 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-10-04 09:51:07,145 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:51:07,151 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 09:51:07,151 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:07,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:07,193 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:07,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:07,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:07,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:07,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:07,215 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:07,215 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 09:51:07,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:07,255 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2018-10-04 09:51:07,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:07,255 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:07,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:07,256 INFO L225 Difference]: With dead ends: 26 [2018-10-04 09:51:07,256 INFO L226 Difference]: Without dead ends: 24 [2018-10-04 09:51:07,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 09:51:07,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-04 09:51:07,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2018-10-04 09:51:07,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 09:51:07,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 09:51:07,271 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 13 [2018-10-04 09:51:07,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:07,271 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 09:51:07,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:07,271 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 09:51:07,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:07,272 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:07,272 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 09:51:07,272 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:07,272 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:07,272 INFO L82 PathProgramCache]: Analyzing trace with hash 863712433, now seen corresponding path program 30 times [2018-10-04 09:51:07,272 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:07,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:07,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:07,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:07,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:07,339 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:07,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:07,340 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-10-04 09:51:07,348 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:51:07,354 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-10-04 09:51:07,355 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:07,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:07,381 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:07,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:07,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:07,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:07,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:07,403 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:07,403 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 8 states. [2018-10-04 09:51:07,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:07,474 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 09:51:07,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:07,474 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:07,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:07,474 INFO L225 Difference]: With dead ends: 33 [2018-10-04 09:51:07,474 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 09:51:07,475 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 09:51:07,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 09:51:07,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2018-10-04 09:51:07,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 09:51:07,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 09:51:07,492 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 09:51:07,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:07,492 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 09:51:07,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:07,492 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 09:51:07,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:07,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:07,493 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 09:51:07,493 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:07,493 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:07,493 INFO L82 PathProgramCache]: Analyzing trace with hash 863714355, now seen corresponding path program 31 times [2018-10-04 09:51:07,493 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:07,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:07,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:07,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:07,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:07,536 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:07,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:07,537 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-10-04 09:51:07,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:07,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:07,591 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:07,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:07,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:07,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:07,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:07,611 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:07,611 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 09:51:07,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:07,821 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 09:51:07,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:07,821 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:07,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:07,821 INFO L225 Difference]: With dead ends: 31 [2018-10-04 09:51:07,822 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 09:51:07,822 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 09:51:07,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 09:51:07,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-10-04 09:51:07,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 09:51:07,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 09:51:07,836 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 13 [2018-10-04 09:51:07,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:07,836 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 09:51:07,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:07,836 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 09:51:07,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:07,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:07,837 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 09:51:07,837 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:07,837 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:07,837 INFO L82 PathProgramCache]: Analyzing trace with hash 865559475, now seen corresponding path program 32 times [2018-10-04 09:51:07,837 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:07,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:07,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:07,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:07,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:07,893 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:07,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:07,893 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-10-04 09:51:07,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:51:07,907 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:51:07,907 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:07,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:07,992 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:08,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:08,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:08,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:08,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:08,012 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:08,012 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 8 states. [2018-10-04 09:51:08,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:08,104 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 09:51:08,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:08,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:08,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:08,104 INFO L225 Difference]: With dead ends: 33 [2018-10-04 09:51:08,104 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 09:51:08,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 09:51:08,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 09:51:08,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2018-10-04 09:51:08,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 09:51:08,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 09:51:08,120 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 09:51:08,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:08,120 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 09:51:08,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:08,120 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 09:51:08,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:08,120 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:08,120 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 09:51:08,121 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:08,121 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:08,121 INFO L82 PathProgramCache]: Analyzing trace with hash 865561397, now seen corresponding path program 33 times [2018-10-04 09:51:08,121 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:08,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:08,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:08,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:08,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:08,174 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:08,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:08,175 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-10-04 09:51:08,184 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:51:08,190 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 09:51:08,190 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:08,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:08,217 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:08,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:08,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:08,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:08,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:08,237 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:08,237 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 09:51:08,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:08,288 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 09:51:08,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:08,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:08,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:08,289 INFO L225 Difference]: With dead ends: 31 [2018-10-04 09:51:08,289 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 09:51:08,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 09:51:08,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 09:51:08,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-10-04 09:51:08,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 09:51:08,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 09:51:08,301 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 13 [2018-10-04 09:51:08,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:08,301 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 09:51:08,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:08,301 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 09:51:08,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:08,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:08,301 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 09:51:08,301 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:08,302 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:08,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1656247501, now seen corresponding path program 34 times [2018-10-04 09:51:08,302 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:08,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:08,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:08,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:08,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:08,393 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:08,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:08,394 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-10-04 09:51:08,402 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:51:08,406 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:51:08,406 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:08,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:08,435 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:08,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:08,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:08,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:08,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:08,456 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:08,456 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 8 states. [2018-10-04 09:51:08,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:08,491 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2018-10-04 09:51:08,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:08,491 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:08,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:08,492 INFO L225 Difference]: With dead ends: 29 [2018-10-04 09:51:08,492 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 09:51:08,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 09:51:08,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 09:51:08,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2018-10-04 09:51:08,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 09:51:08,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 09:51:08,507 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 09:51:08,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:08,507 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 09:51:08,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:08,508 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 09:51:08,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:08,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:08,508 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 09:51:08,508 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:08,508 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:08,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1656245579, now seen corresponding path program 35 times [2018-10-04 09:51:08,508 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:08,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:08,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:08,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:08,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:08,658 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:08,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:08,659 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-10-04 09:51:08,667 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:51:08,673 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 09:51:08,674 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:08,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:08,691 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:08,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:08,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:08,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:08,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:08,712 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:08,712 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 09:51:08,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:08,743 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2018-10-04 09:51:08,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:08,743 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:08,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:08,744 INFO L225 Difference]: With dead ends: 29 [2018-10-04 09:51:08,744 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 09:51:08,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 09:51:08,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 09:51:08,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-10-04 09:51:08,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 09:51:08,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 09:51:08,758 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 13 [2018-10-04 09:51:08,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:08,758 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 09:51:08,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:08,758 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 09:51:08,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:08,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:08,758 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 09:51:08,758 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:08,759 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:08,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1654400459, now seen corresponding path program 36 times [2018-10-04 09:51:08,759 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:08,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:08,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:08,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:08,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:08,811 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:08,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:08,812 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-10-04 09:51:08,822 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:51:08,829 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-10-04 09:51:08,829 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:08,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:08,863 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:08,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:08,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:08,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:08,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:08,883 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:08,883 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 8 states. [2018-10-04 09:51:08,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:08,916 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2018-10-04 09:51:08,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:08,916 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:08,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:08,917 INFO L225 Difference]: With dead ends: 27 [2018-10-04 09:51:08,917 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 09:51:08,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 09:51:08,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 09:51:08,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-10-04 09:51:08,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 09:51:08,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 09:51:08,933 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 09:51:08,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:08,933 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 09:51:08,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:08,933 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 09:51:08,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:08,933 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:08,933 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 09:51:08,934 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:08,934 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:08,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1654398537, now seen corresponding path program 37 times [2018-10-04 09:51:08,934 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:08,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:08,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:08,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:08,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:08,982 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:08,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:08,982 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-10-04 09:51:08,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:08,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:09,028 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:09,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:09,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:09,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:09,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:09,057 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:09,057 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 09:51:09,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:09,132 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2018-10-04 09:51:09,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:09,133 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:09,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:09,134 INFO L225 Difference]: With dead ends: 26 [2018-10-04 09:51:09,134 INFO L226 Difference]: Without dead ends: 24 [2018-10-04 09:51:09,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 09:51:09,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-04 09:51:09,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2018-10-04 09:51:09,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 09:51:09,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 09:51:09,145 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 13 [2018-10-04 09:51:09,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:09,145 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 09:51:09,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:09,145 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 09:51:09,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:09,146 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:09,146 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 09:51:09,146 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:09,146 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:09,146 INFO L82 PathProgramCache]: Analyzing trace with hash 884718641, now seen corresponding path program 38 times [2018-10-04 09:51:09,146 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:09,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:09,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:09,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:09,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:09,230 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:09,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:09,231 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-10-04 09:51:09,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:51:09,247 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:51:09,248 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:09,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:09,272 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:09,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:09,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:09,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:09,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:09,294 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:09,294 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 8 states. [2018-10-04 09:51:09,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:09,352 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 09:51:09,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:09,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:09,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:09,353 INFO L225 Difference]: With dead ends: 39 [2018-10-04 09:51:09,353 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 09:51:09,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 09:51:09,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 09:51:09,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2018-10-04 09:51:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:51:09,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 09:51:09,373 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 09:51:09,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:09,374 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 09:51:09,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:09,374 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 09:51:09,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:09,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:09,374 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 09:51:09,375 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:09,375 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:09,375 INFO L82 PathProgramCache]: Analyzing trace with hash 884720563, now seen corresponding path program 39 times [2018-10-04 09:51:09,375 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:09,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:09,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:09,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:09,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:09,941 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:09,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:09,941 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-10-04 09:51:09,948 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:51:09,955 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 09:51:09,955 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:09,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:09,983 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:10,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:10,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:10,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:10,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:10,005 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:10,005 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 09:51:10,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:10,060 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 09:51:10,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:10,061 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:10,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:10,061 INFO L225 Difference]: With dead ends: 39 [2018-10-04 09:51:10,061 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 09:51:10,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 6 [2018-10-04 09:51:10,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 09:51:10,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 22. [2018-10-04 09:51:10,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 09:51:10,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 09:51:10,080 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 09:51:10,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:10,080 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 09:51:10,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:10,080 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 09:51:10,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:10,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:10,080 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 09:51:10,080 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:10,080 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:10,081 INFO L82 PathProgramCache]: Analyzing trace with hash 886565683, now seen corresponding path program 40 times [2018-10-04 09:51:10,081 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:10,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:10,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:10,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:10,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:10,127 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:10,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:10,128 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10-04 09:51:10,137 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:51:10,142 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:51:10,142 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:10,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:10,167 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:10,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:10,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:10,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:10,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:10,189 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:10,189 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 09:51:10,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:10,239 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 09:51:10,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:10,240 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:10,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:10,240 INFO L225 Difference]: With dead ends: 37 [2018-10-04 09:51:10,240 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 09:51:10,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 09:51:10,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 09:51:10,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 24. [2018-10-04 09:51:10,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:51:10,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 09:51:10,260 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 09:51:10,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:10,260 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 09:51:10,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:10,260 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 09:51:10,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:10,260 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:10,260 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 09:51:10,260 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:10,261 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:10,261 INFO L82 PathProgramCache]: Analyzing trace with hash 886567605, now seen corresponding path program 41 times [2018-10-04 09:51:10,261 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:10,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:10,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:10,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:10,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:10,410 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:10,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:10,411 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-10-04 09:51:10,420 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:51:10,430 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 09:51:10,430 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:10,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:10,449 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:10,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:10,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:10,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:10,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:10,471 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:10,471 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 09:51:10,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:10,517 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 09:51:10,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:10,517 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:10,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:10,518 INFO L225 Difference]: With dead ends: 35 [2018-10-04 09:51:10,518 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 09:51:10,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 09:51:10,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 09:51:10,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 20. [2018-10-04 09:51:10,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 09:51:10,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 09:51:10,535 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 13 [2018-10-04 09:51:10,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:10,535 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 09:51:10,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:10,535 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 09:51:10,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:10,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:10,536 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 09:51:10,536 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:10,536 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:10,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1635241293, now seen corresponding path program 42 times [2018-10-04 09:51:10,536 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:10,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:10,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:10,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:10,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:10,598 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:10,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:10,599 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-10-04 09:51:10,606 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:51:10,613 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-10-04 09:51:10,613 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:10,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:10,642 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:10,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:10,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:10,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:10,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:10,664 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:10,664 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 8 states. [2018-10-04 09:51:10,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:10,757 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 09:51:10,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:10,758 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:10,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:10,758 INFO L225 Difference]: With dead ends: 39 [2018-10-04 09:51:10,758 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 09:51:10,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 09:51:10,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 09:51:10,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2018-10-04 09:51:10,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:51:10,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 09:51:10,780 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 09:51:10,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:10,781 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 09:51:10,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:10,781 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 09:51:10,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:10,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:10,781 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 09:51:10,781 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:10,782 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:10,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1635239371, now seen corresponding path program 43 times [2018-10-04 09:51:10,782 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:10,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:10,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:10,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:10,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:10,835 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:10,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:10,836 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-10-04 09:51:10,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:10,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:10,887 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:10,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:10,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:10,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:10,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:10,908 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:10,908 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 09:51:10,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:10,989 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 09:51:10,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:10,989 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:10,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:10,990 INFO L225 Difference]: With dead ends: 39 [2018-10-04 09:51:10,990 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 09:51:10,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 09:51:10,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 09:51:11,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 22. [2018-10-04 09:51:11,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 09:51:11,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 09:51:11,008 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 09:51:11,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:11,008 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 09:51:11,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:11,008 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 09:51:11,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:11,008 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:11,009 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 09:51:11,009 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:11,009 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:11,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1633394251, now seen corresponding path program 44 times [2018-10-04 09:51:11,009 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:11,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:11,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:11,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:11,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:11,083 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:11,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:11,084 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-10-04 09:51:11,091 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:51:11,096 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:51:11,096 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:11,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:11,142 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:11,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:11,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:11,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:11,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:11,162 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:11,162 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 09:51:11,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:11,234 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 09:51:11,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:11,235 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:11,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:11,235 INFO L225 Difference]: With dead ends: 37 [2018-10-04 09:51:11,235 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 09:51:11,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 09:51:11,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 09:51:11,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 24. [2018-10-04 09:51:11,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:51:11,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 09:51:11,255 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 09:51:11,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:11,255 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 09:51:11,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:11,255 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 09:51:11,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:11,255 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:11,255 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 09:51:11,256 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:11,256 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:11,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1633392329, now seen corresponding path program 45 times [2018-10-04 09:51:11,256 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:11,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:11,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:11,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:11,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:11,324 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:11,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:11,325 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:11,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:51:11,338 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 09:51:11,338 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:11,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:11,360 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:11,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:11,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:11,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:11,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:11,381 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:11,381 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 09:51:11,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:11,439 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 09:51:11,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:11,439 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:11,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:11,440 INFO L225 Difference]: With dead ends: 35 [2018-10-04 09:51:11,440 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 09:51:11,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 09:51:11,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 09:51:11,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 18. [2018-10-04 09:51:11,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 09:51:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 09:51:11,457 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 13 [2018-10-04 09:51:11,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:11,457 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 09:51:11,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:11,457 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 09:51:11,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:11,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:11,457 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 09:51:11,458 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:11,458 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:11,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1564777011, now seen corresponding path program 46 times [2018-10-04 09:51:11,458 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:11,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:11,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:11,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:11,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:11,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:11,552 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:11,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:11,552 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:11,560 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:51:11,565 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:51:11,566 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:11,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:11,589 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:11,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:11,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:11,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:11,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:11,608 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:11,609 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 8 states. [2018-10-04 09:51:11,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:11,663 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 09:51:11,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:11,664 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:11,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:11,664 INFO L225 Difference]: With dead ends: 35 [2018-10-04 09:51:11,664 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 09:51:11,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 09:51:11,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 09:51:11,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2018-10-04 09:51:11,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:51:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 09:51:11,689 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 09:51:11,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:11,689 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 09:51:11,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:11,690 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 09:51:11,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:11,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:11,690 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 09:51:11,690 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:11,690 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:11,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1564778933, now seen corresponding path program 47 times [2018-10-04 09:51:11,691 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:11,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:11,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:11,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:11,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:11,742 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:11,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:11,743 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:11,750 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:51:11,757 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 09:51:11,757 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:11,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:11,809 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:11,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:11,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:11,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:11,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:11,831 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:11,831 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 09:51:11,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:11,888 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 09:51:11,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:11,888 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:11,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:11,888 INFO L225 Difference]: With dead ends: 33 [2018-10-04 09:51:11,888 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 09:51:11,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 09:51:11,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 09:51:11,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2018-10-04 09:51:11,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 09:51:11,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 09:51:11,913 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 09:51:11,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:11,913 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 09:51:11,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:11,914 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 09:51:11,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:11,914 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:11,914 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 09:51:11,914 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:11,914 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:11,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1566624053, now seen corresponding path program 48 times [2018-10-04 09:51:11,915 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:11,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:11,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:11,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:11,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:11,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:11,973 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:11,981 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:51:11,993 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-10-04 09:51:11,993 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:11,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:12,016 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:12,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:12,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:12,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:12,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:12,037 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:12,038 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 09:51:12,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:12,101 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 09:51:12,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:12,101 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:12,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:12,102 INFO L225 Difference]: With dead ends: 35 [2018-10-04 09:51:12,102 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 09:51:12,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 09:51:12,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 09:51:12,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2018-10-04 09:51:12,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:51:12,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 09:51:12,128 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 09:51:12,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:12,129 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 09:51:12,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:12,129 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 09:51:12,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:12,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:12,129 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 09:51:12,129 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:12,130 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:12,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1566625975, now seen corresponding path program 49 times [2018-10-04 09:51:12,130 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:12,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:12,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:12,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:12,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:12,209 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:12,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:12,210 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:12,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:12,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:12,290 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:12,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:12,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:12,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:12,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:12,311 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:12,311 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 09:51:12,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:12,462 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 09:51:12,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:12,463 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:12,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:12,463 INFO L225 Difference]: With dead ends: 33 [2018-10-04 09:51:12,463 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 09:51:12,464 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 09:51:12,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 09:51:12,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2018-10-04 09:51:12,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 09:51:12,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 09:51:12,496 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 13 [2018-10-04 09:51:12,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:12,496 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 09:51:12,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:12,497 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 09:51:12,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:12,497 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:12,497 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 09:51:12,497 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:12,497 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:12,498 INFO L82 PathProgramCache]: Analyzing trace with hash -955182923, now seen corresponding path program 50 times [2018-10-04 09:51:12,498 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:12,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:12,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:12,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:12,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:12,637 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:12,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:12,637 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:12,646 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:51:12,651 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:51:12,651 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:12,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:12,678 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:12,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:12,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:12,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:12,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:12,699 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:12,699 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 8 states. [2018-10-04 09:51:12,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:12,746 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 09:51:12,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:12,747 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:12,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:12,747 INFO L225 Difference]: With dead ends: 31 [2018-10-04 09:51:12,747 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 09:51:12,747 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 09:51:12,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 09:51:12,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-10-04 09:51:12,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:51:12,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 09:51:12,772 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 09:51:12,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:12,772 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 09:51:12,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:12,772 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 09:51:12,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:12,772 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:12,772 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 09:51:12,772 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:12,773 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:12,773 INFO L82 PathProgramCache]: Analyzing trace with hash -955181001, now seen corresponding path program 51 times [2018-10-04 09:51:12,773 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:12,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:12,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:12,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:12,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:12,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:12,816 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:12,824 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:51:12,831 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 09:51:12,832 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:12,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:12,865 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:12,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:12,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:12,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:12,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:12,885 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:12,885 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 09:51:12,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:12,970 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 09:51:12,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:12,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:12,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:12,970 INFO L225 Difference]: With dead ends: 31 [2018-10-04 09:51:12,970 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 09:51:12,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 09:51:12,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 09:51:13,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2018-10-04 09:51:13,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 09:51:13,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 09:51:13,001 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 09:51:13,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:13,001 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 09:51:13,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:13,002 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 09:51:13,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:13,002 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:13,002 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 09:51:13,002 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:13,002 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:13,003 INFO L82 PathProgramCache]: Analyzing trace with hash -953335881, now seen corresponding path program 52 times [2018-10-04 09:51:13,003 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:13,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:13,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:13,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:13,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:13,069 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:13,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:13,069 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:13,076 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:51:13,103 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:51:13,104 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:13,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:13,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:13,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:13,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:13,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:13,162 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:13,162 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 09:51:13,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:13,209 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2018-10-04 09:51:13,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:13,210 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:13,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:13,210 INFO L225 Difference]: With dead ends: 29 [2018-10-04 09:51:13,210 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 09:51:13,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 09:51:13,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 09:51:13,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2018-10-04 09:51:13,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:51:13,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 09:51:13,235 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 09:51:13,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:13,235 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 09:51:13,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:13,235 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 09:51:13,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:51:13,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:13,236 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1] [2018-10-04 09:51:13,236 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:13,236 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:13,236 INFO L82 PathProgramCache]: Analyzing trace with hash -953333959, now seen corresponding path program 5 times [2018-10-04 09:51:13,236 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:13,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:13,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:13,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:13,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:13,289 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:13,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:13,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 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:13,300 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:51:13,305 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 09:51:13,306 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:13,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:13,338 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:13,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:13,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:51:13,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:51:13,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:51:13,359 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:13,360 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 09:51:13,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:13,409 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2018-10-04 09:51:13,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:51:13,410 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 09:51:13,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:13,410 INFO L225 Difference]: With dead ends: 28 [2018-10-04 09:51:13,410 INFO L226 Difference]: Without dead ends: 26 [2018-10-04 09:51:13,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 6 [2018-10-04 09:51:13,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-04 09:51:13,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 16. [2018-10-04 09:51:13,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 09:51:13,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 09:51:13,426 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 13 [2018-10-04 09:51:13,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:13,427 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 09:51:13,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:51:13,427 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 09:51:13,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:13,427 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:13,427 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1] [2018-10-04 09:51:13,427 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:13,427 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:13,427 INFO L82 PathProgramCache]: Analyzing trace with hash 397590258, now seen corresponding path program 6 times [2018-10-04 09:51:13,428 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:13,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:13,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:13,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:13,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:13,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:13,483 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:13,494 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:51:13,507 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 09:51:13,507 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:13,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:13,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:13,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:13,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:13,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:13,565 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:13,565 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 9 states. [2018-10-04 09:51:13,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:13,647 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 09:51:13,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:13,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:13,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:13,648 INFO L225 Difference]: With dead ends: 41 [2018-10-04 09:51:13,648 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:51:13,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:13,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:51:13,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-10-04 09:51:13,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:51:13,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:51:13,681 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 09:51:13,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:13,682 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:51:13,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:13,682 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:51:13,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:13,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:13,682 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 09:51:13,683 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:13,683 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:13,683 INFO L82 PathProgramCache]: Analyzing trace with hash 397592180, now seen corresponding path program 53 times [2018-10-04 09:51:13,683 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:13,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:13,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:13,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:13,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:13,786 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:13,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:13,787 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:13,797 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:51:13,805 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 09:51:13,805 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:13,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:13,844 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:13,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:13,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:13,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:13,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:13,866 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:13,866 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 09:51:13,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:13,945 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 09:51:13,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:13,946 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:13,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:13,946 INFO L225 Difference]: With dead ends: 41 [2018-10-04 09:51:13,946 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:51:13,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 09:51:13,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:51:13,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2018-10-04 09:51:13,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:51:13,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 09:51:13,975 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 09:51:13,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:13,975 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 09:51:13,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:13,975 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 09:51:13,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:13,975 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:13,976 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 09:51:13,976 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:13,976 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:13,976 INFO L82 PathProgramCache]: Analyzing trace with hash 399437300, now seen corresponding path program 54 times [2018-10-04 09:51:13,976 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:13,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:13,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:13,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:13,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:14,034 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:14,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:14,035 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:14,043 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:51:14,053 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 09:51:14,053 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:14,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:14,117 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:14,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:14,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:14,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:14,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:14,137 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:14,138 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 09:51:14,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:14,217 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 09:51:14,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:14,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:14,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:14,218 INFO L225 Difference]: With dead ends: 39 [2018-10-04 09:51:14,218 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 09:51:14,218 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 09:51:14,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 09:51:14,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-10-04 09:51:14,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:51:14,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:51:14,250 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 09:51:14,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:14,251 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:51:14,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:14,251 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:51:14,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:14,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:14,251 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 09:51:14,251 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:14,251 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:14,251 INFO L82 PathProgramCache]: Analyzing trace with hash 399439222, now seen corresponding path program 55 times [2018-10-04 09:51:14,251 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:14,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:14,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:14,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:14,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:14,452 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:14,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:14,453 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:14,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:14,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:14,492 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:14,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:14,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:14,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:14,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:14,514 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:14,514 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 09:51:14,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:14,588 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 09:51:14,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:14,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:14,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:14,588 INFO L225 Difference]: With dead ends: 37 [2018-10-04 09:51:14,588 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 09:51:14,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 7 [2018-10-04 09:51:14,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 09:51:14,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 22. [2018-10-04 09:51:14,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 09:51:14,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 09:51:14,617 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 15 [2018-10-04 09:51:14,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:14,618 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 09:51:14,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:14,618 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 09:51:14,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:14,618 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:14,618 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 09:51:14,618 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:14,619 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:14,619 INFO L82 PathProgramCache]: Analyzing trace with hash -2122369676, now seen corresponding path program 56 times [2018-10-04 09:51:14,619 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:14,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:14,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:14,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:14,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:14,686 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:14,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:14,686 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:14,694 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:51:14,699 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:51:14,699 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:14,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:14,797 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:14,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:14,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:14,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:14,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:14,817 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:14,817 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 9 states. [2018-10-04 09:51:14,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:14,904 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 09:51:14,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:14,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:14,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:14,905 INFO L225 Difference]: With dead ends: 41 [2018-10-04 09:51:14,905 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:51:14,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 09:51:14,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:51:14,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-10-04 09:51:14,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:51:14,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:51:14,938 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 09:51:14,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:14,938 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:51:14,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:14,938 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:51:14,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:14,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:14,938 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 09:51:14,939 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:14,939 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:14,939 INFO L82 PathProgramCache]: Analyzing trace with hash -2122367754, now seen corresponding path program 57 times [2018-10-04 09:51:14,939 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:14,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:14,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:14,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:14,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:15,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:15,416 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:15,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:51:15,431 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 09:51:15,431 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:15,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:15,458 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:15,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:15,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:15,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:15,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:15,479 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:15,479 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 09:51:15,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:15,600 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 09:51:15,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:15,601 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:15,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:15,601 INFO L225 Difference]: With dead ends: 41 [2018-10-04 09:51:15,601 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:51:15,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.3s impTime 7 [2018-10-04 09:51:15,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:51:15,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2018-10-04 09:51:15,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:51:15,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 09:51:15,633 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 09:51:15,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:15,633 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 09:51:15,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:15,633 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 09:51:15,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:15,633 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:15,633 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 09:51:15,633 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:15,634 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:15,634 INFO L82 PathProgramCache]: Analyzing trace with hash -2120522634, now seen corresponding path program 58 times [2018-10-04 09:51:15,634 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:15,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:15,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:15,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:15,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:15,712 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:15,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:15,713 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:15,720 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:51:15,742 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:51:15,742 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:15,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:15,769 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:15,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:15,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:15,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:15,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:15,793 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:15,793 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 09:51:15,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:15,883 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 09:51:15,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:15,884 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:15,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:15,884 INFO L225 Difference]: With dead ends: 39 [2018-10-04 09:51:15,884 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 09:51:15,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:15,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 09:51:15,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-10-04 09:51:15,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:51:15,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:51:15,917 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 09:51:15,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:15,917 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:51:15,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:15,917 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:51:15,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:15,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:15,918 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 09:51:15,918 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:15,918 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:15,918 INFO L82 PathProgramCache]: Analyzing trace with hash -2120520712, now seen corresponding path program 59 times [2018-10-04 09:51:15,918 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:15,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:15,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:15,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:15,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:15,972 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:15,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:15,973 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:15,982 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:51:15,993 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 09:51:15,994 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:15,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:16,069 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:16,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:16,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:16,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:16,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:16,090 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:16,090 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 09:51:16,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:16,182 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 09:51:16,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:16,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:16,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:16,183 INFO L225 Difference]: With dead ends: 37 [2018-10-04 09:51:16,183 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 09:51:16,183 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 09:51:16,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 09:51:16,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2018-10-04 09:51:16,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 09:51:16,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 09:51:16,210 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 15 [2018-10-04 09:51:16,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:16,210 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 09:51:16,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:16,210 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 09:51:16,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:16,211 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:16,211 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 09:51:16,211 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:16,211 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:16,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1077648628, now seen corresponding path program 60 times [2018-10-04 09:51:16,211 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:16,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:16,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:16,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:16,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:16,299 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:16,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:16,300 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:16,307 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:51:16,315 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 09:51:16,315 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:16,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:16,360 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:16,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:16,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:16,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:16,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:16,383 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:16,383 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 9 states. [2018-10-04 09:51:16,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:16,472 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 09:51:16,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:16,472 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:16,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:16,473 INFO L225 Difference]: With dead ends: 37 [2018-10-04 09:51:16,473 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 09:51:16,473 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 09:51:16,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 09:51:16,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2018-10-04 09:51:16,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:51:16,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:51:16,510 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 09:51:16,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:16,510 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:51:16,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:16,510 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:51:16,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:16,511 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:16,511 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 09:51:16,511 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:16,511 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:16,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1077650550, now seen corresponding path program 61 times [2018-10-04 09:51:16,511 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:16,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:16,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:16,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:16,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:16,644 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:16,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:16,644 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:16,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:16,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:16,712 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:16,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:16,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:16,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:16,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:16,732 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:16,732 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 09:51:16,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:16,809 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 09:51:16,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:16,810 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:16,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:16,810 INFO L225 Difference]: With dead ends: 35 [2018-10-04 09:51:16,810 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 09:51:16,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 09:51:16,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 09:51:16,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2018-10-04 09:51:16,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:51:16,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 09:51:16,845 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 09:51:16,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:16,845 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 09:51:16,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:16,845 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 09:51:16,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:16,845 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:16,846 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 09:51:16,846 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:16,846 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:16,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1079495670, now seen corresponding path program 62 times [2018-10-04 09:51:16,846 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:16,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:16,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:16,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:16,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:16,904 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:16,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:16,905 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:16,912 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:51:16,918 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:51:16,918 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:16,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:16,948 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:16,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:16,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:16,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:16,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:16,969 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:16,969 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 09:51:17,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:17,067 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 09:51:17,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:17,068 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:17,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:17,068 INFO L225 Difference]: With dead ends: 37 [2018-10-04 09:51:17,068 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 09:51:17,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:17,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 09:51:17,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2018-10-04 09:51:17,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:51:17,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:51:17,108 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 09:51:17,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:17,109 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:51:17,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:17,109 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:51:17,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:17,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:17,109 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 09:51:17,109 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:17,110 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:17,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1079497592, now seen corresponding path program 63 times [2018-10-04 09:51:17,110 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:17,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:17,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:17,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:17,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:17,169 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:17,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:17,170 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:17,177 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:51:17,189 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 09:51:17,189 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:17,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:17,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:17,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:17,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:17,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:17,255 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:17,255 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 09:51:17,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:17,348 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 09:51:17,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:17,349 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:17,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:17,349 INFO L225 Difference]: With dead ends: 35 [2018-10-04 09:51:17,349 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 09:51:17,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:17,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 09:51:17,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 22. [2018-10-04 09:51:17,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 09:51:17,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 09:51:17,377 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 15 [2018-10-04 09:51:17,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:17,378 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 09:51:17,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:17,378 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 09:51:17,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:17,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:17,378 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 09:51:17,379 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:17,379 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:17,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1442311306, now seen corresponding path program 64 times [2018-10-04 09:51:17,379 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:17,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:17,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:17,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:17,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:17,474 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:17,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:17,475 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:17,484 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:51:17,489 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:51:17,489 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:17,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:17,510 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:17,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:17,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:17,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:17,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:17,531 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:17,532 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 9 states. [2018-10-04 09:51:17,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:17,594 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 09:51:17,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:17,594 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:17,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:17,595 INFO L225 Difference]: With dead ends: 33 [2018-10-04 09:51:17,595 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 09:51:17,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 09:51:17,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 09:51:17,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2018-10-04 09:51:17,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:51:17,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:51:17,630 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 09:51:17,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:17,631 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:51:17,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:17,631 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:51:17,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:17,631 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:17,631 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 09:51:17,631 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:17,631 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:17,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1442309384, now seen corresponding path program 65 times [2018-10-04 09:51:17,632 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:17,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:17,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:17,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:17,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:17,704 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:17,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:17,705 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:17,712 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:51:17,719 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 09:51:17,720 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:17,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:17,751 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:17,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:17,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:17,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:17,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:17,771 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:17,771 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 09:51:17,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:17,838 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 09:51:17,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:17,838 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:17,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:17,838 INFO L225 Difference]: With dead ends: 33 [2018-10-04 09:51:17,838 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 09:51:17,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:17,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 09:51:17,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2018-10-04 09:51:17,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:51:17,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 09:51:17,871 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 09:51:17,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:17,871 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 09:51:17,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:17,871 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 09:51:17,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:17,871 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:17,872 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 09:51:17,872 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:17,872 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:17,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1440464264, now seen corresponding path program 66 times [2018-10-04 09:51:17,872 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:17,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:17,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:17,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:17,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:17,926 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:17,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:17,927 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:17,936 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:51:17,942 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 09:51:17,942 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:17,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:18,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:18,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:18,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:18,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:18,002 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:18,002 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 09:51:18,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:18,069 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 09:51:18,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:18,070 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:18,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:18,070 INFO L225 Difference]: With dead ends: 31 [2018-10-04 09:51:18,070 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 09:51:18,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:18,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 09:51:18,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-10-04 09:51:18,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:51:18,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:51:18,103 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 09:51:18,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:18,103 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:51:18,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:18,103 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:51:18,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:18,103 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:18,103 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 09:51:18,104 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:18,104 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:18,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1440462342, now seen corresponding path program 67 times [2018-10-04 09:51:18,104 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:18,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:18,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:18,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:18,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:18,153 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:18,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:18,154 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:18,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:18,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:18,202 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:18,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:18,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:18,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:18,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:18,223 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:18,223 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 09:51:18,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:18,283 INFO L93 Difference]: Finished difference Result 30 states and 42 transitions. [2018-10-04 09:51:18,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:18,284 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:18,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:18,284 INFO L225 Difference]: With dead ends: 30 [2018-10-04 09:51:18,284 INFO L226 Difference]: Without dead ends: 28 [2018-10-04 09:51:18,285 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:18,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-04 09:51:18,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-10-04 09:51:18,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 09:51:18,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 09:51:18,309 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 15 [2018-10-04 09:51:18,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:18,310 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 09:51:18,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:18,310 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 09:51:18,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:18,310 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:18,310 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 09:51:18,310 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:18,310 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:18,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1098654836, now seen corresponding path program 68 times [2018-10-04 09:51:18,310 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:18,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:18,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:18,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:18,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:18,363 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:18,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:18,364 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:18,372 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:51:18,377 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:51:18,377 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:18,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:18,401 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:18,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:18,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:18,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:18,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:18,423 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:18,423 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 9 states. [2018-10-04 09:51:18,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:18,525 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 09:51:18,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:18,525 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:18,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:18,526 INFO L225 Difference]: With dead ends: 41 [2018-10-04 09:51:18,526 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:51:18,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:18,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:51:18,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-10-04 09:51:18,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:51:18,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:51:18,566 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 09:51:18,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:18,566 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:51:18,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:18,566 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:51:18,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:18,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:18,566 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 09:51:18,567 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:18,567 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:18,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1098656758, now seen corresponding path program 69 times [2018-10-04 09:51:18,567 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:18,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:18,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:18,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:18,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:18,628 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:18,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:18,628 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:18,636 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:51:18,644 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 09:51:18,644 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:18,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:18,671 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:18,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:18,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:18,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:18,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:18,692 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:18,692 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 09:51:18,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:18,794 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 09:51:18,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:18,795 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:18,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:18,795 INFO L225 Difference]: With dead ends: 41 [2018-10-04 09:51:18,795 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:51:18,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:18,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:51:18,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2018-10-04 09:51:18,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:51:18,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 09:51:18,833 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 09:51:18,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:18,833 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 09:51:18,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:18,834 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 09:51:18,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:18,834 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:18,834 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 09:51:18,834 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:18,834 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:18,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1100501878, now seen corresponding path program 70 times [2018-10-04 09:51:18,834 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:18,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:18,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:18,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:18,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:18,883 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:18,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:18,884 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:18,890 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:51:18,896 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:51:18,896 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:18,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:18,938 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:18,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:18,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:18,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:18,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:18,959 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:18,959 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 09:51:19,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:19,050 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 09:51:19,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:19,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:19,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:19,051 INFO L225 Difference]: With dead ends: 39 [2018-10-04 09:51:19,051 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 09:51:19,052 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:19,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 09:51:19,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-10-04 09:51:19,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:51:19,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:51:19,092 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 09:51:19,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:19,092 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:51:19,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:19,092 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:51:19,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:19,092 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:19,092 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 09:51:19,093 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:19,093 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:19,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1100503800, now seen corresponding path program 71 times [2018-10-04 09:51:19,093 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:19,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:19,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:19,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:19,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:19,173 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:19,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:19,173 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:19,182 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:51:19,199 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 09:51:19,199 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:19,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:19,233 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:19,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:19,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:19,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:19,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:19,253 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:19,253 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 09:51:19,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:19,350 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 09:51:19,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:19,351 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:19,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:19,351 INFO L225 Difference]: With dead ends: 37 [2018-10-04 09:51:19,351 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 09:51:19,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 09:51:19,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 09:51:19,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 22. [2018-10-04 09:51:19,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 09:51:19,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 09:51:19,385 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 15 [2018-10-04 09:51:19,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:19,386 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 09:51:19,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:19,386 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 09:51:19,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:19,386 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:19,386 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 09:51:19,386 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:19,386 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:19,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1421305098, now seen corresponding path program 72 times [2018-10-04 09:51:19,386 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:19,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:19,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:19,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:19,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:19,446 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:19,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:19,447 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:19,454 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:51:19,463 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 09:51:19,463 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:19,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:19,495 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:19,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:19,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:19,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:19,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:19,516 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:19,516 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 9 states. [2018-10-04 09:51:19,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:19,613 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 09:51:19,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:19,614 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:19,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:19,614 INFO L225 Difference]: With dead ends: 41 [2018-10-04 09:51:19,614 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:51:19,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:19,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:51:19,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-10-04 09:51:19,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:51:19,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:51:19,660 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 09:51:19,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:19,660 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:51:19,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:19,661 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:51:19,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:19,661 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:19,661 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 09:51:19,661 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:19,661 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:19,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1421303176, now seen corresponding path program 73 times [2018-10-04 09:51:19,661 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:19,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:19,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:19,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:19,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:19,745 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:19,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:19,746 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:19,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:19,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:19,787 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:19,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:19,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:19,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:19,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:19,809 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:19,809 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 09:51:19,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:19,919 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 09:51:19,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:19,919 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:19,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:19,920 INFO L225 Difference]: With dead ends: 41 [2018-10-04 09:51:19,920 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:51:19,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:19,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:51:19,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2018-10-04 09:51:19,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:51:19,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 09:51:19,959 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 09:51:19,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:19,959 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 09:51:19,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:19,959 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 09:51:19,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:19,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:19,960 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 09:51:19,960 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:19,960 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:19,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1419458056, now seen corresponding path program 74 times [2018-10-04 09:51:19,960 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:19,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:19,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:19,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:19,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:20,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:20,034 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-04 09:51:20,050 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:20,061 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:51:20,061 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:20,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:20,094 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:20,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:20,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:20,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:20,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:20,117 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:20,117 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 09:51:20,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:20,216 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 09:51:20,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:20,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:20,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:20,217 INFO L225 Difference]: With dead ends: 39 [2018-10-04 09:51:20,218 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 09:51:20,218 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:20,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 09:51:20,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-10-04 09:51:20,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:51:20,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:51:20,258 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 09:51:20,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:20,259 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:51:20,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:20,259 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:51:20,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:20,259 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:20,259 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 09:51:20,259 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:20,259 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:20,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1419456134, now seen corresponding path program 75 times [2018-10-04 09:51:20,260 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:20,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:20,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:20,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:20,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:20,455 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:20,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:20,456 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:20,463 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:51:20,470 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 09:51:20,470 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:20,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:20,497 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:20,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:20,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:20,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:20,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:20,519 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:20,519 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 09:51:20,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:20,615 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 09:51:20,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:20,615 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:20,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:20,615 INFO L225 Difference]: With dead ends: 37 [2018-10-04 09:51:20,615 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 09:51:20,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 7 [2018-10-04 09:51:20,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 09:51:20,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2018-10-04 09:51:20,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 09:51:20,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 09:51:20,648 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 15 [2018-10-04 09:51:20,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:20,648 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 09:51:20,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:20,648 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 09:51:20,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:20,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:20,649 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 09:51:20,649 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:20,649 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:20,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1778713206, now seen corresponding path program 76 times [2018-10-04 09:51:20,649 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:20,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:20,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:20,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:20,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:20,707 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:20,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:20,707 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:20,716 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:51:20,721 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:51:20,721 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:20,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:20,750 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:20,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:20,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:20,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:20,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:20,772 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:20,772 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 9 states. [2018-10-04 09:51:20,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:20,867 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 09:51:20,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:20,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:20,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:20,869 INFO L225 Difference]: With dead ends: 37 [2018-10-04 09:51:20,869 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 09:51:20,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:20,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 09:51:20,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2018-10-04 09:51:20,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:51:20,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:51:20,916 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 09:51:20,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:20,916 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:51:20,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:20,916 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:51:20,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:20,916 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:20,917 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 09:51:20,917 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:20,917 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:20,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1778715128, now seen corresponding path program 77 times [2018-10-04 09:51:20,917 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:20,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:20,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:20,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:20,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:20,992 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:20,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:20,993 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:21,000 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:51:21,009 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 09:51:21,009 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:21,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:21,036 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:21,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:21,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:21,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:21,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:21,059 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:21,059 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 09:51:21,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:21,172 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 09:51:21,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:21,172 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:21,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:21,173 INFO L225 Difference]: With dead ends: 35 [2018-10-04 09:51:21,173 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 09:51:21,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:21,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 09:51:21,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2018-10-04 09:51:21,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:51:21,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 09:51:21,217 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 09:51:21,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:21,217 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 09:51:21,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:21,218 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 09:51:21,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:21,218 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:21,218 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 09:51:21,218 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:21,218 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:21,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1780560248, now seen corresponding path program 78 times [2018-10-04 09:51:21,218 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:21,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:21,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:21,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:21,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:21,342 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:21,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:21,342 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:21,349 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:51:21,357 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 09:51:21,357 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:21,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:21,404 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:21,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:21,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:21,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:21,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:21,424 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:21,424 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 09:51:21,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:21,519 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 09:51:21,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:21,520 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:21,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:21,520 INFO L225 Difference]: With dead ends: 37 [2018-10-04 09:51:21,520 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 09:51:21,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 09:51:21,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 09:51:21,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2018-10-04 09:51:21,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:51:21,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:51:21,586 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 09:51:21,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:21,586 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:51:21,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:21,587 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:51:21,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:21,587 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:21,587 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 09:51:21,587 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:21,588 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:21,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1780562170, now seen corresponding path program 79 times [2018-10-04 09:51:21,588 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:21,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:21,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:21,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:21,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:21,733 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:21,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:21,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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:21,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:21,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:21,767 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:21,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:21,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:21,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:21,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:21,788 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:21,788 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 09:51:21,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:21,888 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 09:51:21,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:21,888 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:21,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:21,888 INFO L225 Difference]: With dead ends: 35 [2018-10-04 09:51:21,889 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 09:51:21,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 09:51:21,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 09:51:21,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 22. [2018-10-04 09:51:21,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 09:51:21,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 09:51:21,928 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 15 [2018-10-04 09:51:21,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:21,929 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 09:51:21,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:21,929 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 09:51:21,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:21,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:21,929 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 09:51:21,929 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:21,929 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:21,929 INFO L82 PathProgramCache]: Analyzing trace with hash -741246728, now seen corresponding path program 80 times [2018-10-04 09:51:21,930 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:21,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:21,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:21,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:21,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:22,109 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:22,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:22,109 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:22,118 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:51:22,123 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:51:22,123 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:22,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:22,144 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:22,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:22,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:22,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:22,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:22,167 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:22,167 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 9 states. [2018-10-04 09:51:22,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:22,257 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 09:51:22,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:22,257 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:22,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:22,258 INFO L225 Difference]: With dead ends: 33 [2018-10-04 09:51:22,258 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 09:51:22,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 09:51:22,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 09:51:22,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2018-10-04 09:51:22,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:51:22,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:51:22,302 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 09:51:22,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:22,302 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:51:22,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:22,303 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:51:22,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:22,303 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:22,303 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 09:51:22,303 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:22,303 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:22,304 INFO L82 PathProgramCache]: Analyzing trace with hash -741244806, now seen corresponding path program 81 times [2018-10-04 09:51:22,304 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:22,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:22,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:22,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:22,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:22,361 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:22,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:22,362 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:22,370 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:51:22,378 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 09:51:22,378 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:22,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:22,420 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:22,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:22,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:22,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:22,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:22,440 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:22,440 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 09:51:22,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:22,526 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 09:51:22,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:22,526 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:22,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:22,527 INFO L225 Difference]: With dead ends: 33 [2018-10-04 09:51:22,527 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 09:51:22,528 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:22,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 09:51:22,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2018-10-04 09:51:22,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:51:22,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 09:51:22,578 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 09:51:22,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:22,578 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 09:51:22,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:22,578 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 09:51:22,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:22,578 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:22,578 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 09:51:22,579 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:22,579 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:22,579 INFO L82 PathProgramCache]: Analyzing trace with hash -739399686, now seen corresponding path program 82 times [2018-10-04 09:51:22,579 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:22,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:22,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:22,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:22,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:22,640 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:22,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:22,640 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:22,649 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:51:22,654 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:51:22,654 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:22,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:22,694 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:22,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:22,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:22,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:22,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:22,714 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:22,715 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 09:51:22,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:22,804 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 09:51:22,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:22,804 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:22,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:22,805 INFO L225 Difference]: With dead ends: 31 [2018-10-04 09:51:22,805 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 09:51:22,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:22,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 09:51:22,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-10-04 09:51:22,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:51:22,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:51:22,848 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 09:51:22,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:22,848 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:51:22,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:22,848 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:51:22,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:22,848 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:22,849 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 09:51:22,849 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:22,849 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:22,849 INFO L82 PathProgramCache]: Analyzing trace with hash -739397764, now seen corresponding path program 83 times [2018-10-04 09:51:22,849 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:22,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:22,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:22,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:22,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:22,906 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:22,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:22,907 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:22,915 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:51:22,923 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 09:51:22,923 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:22,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:22,963 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:22,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:22,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:22,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:22,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:22,985 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:22,985 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 09:51:23,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:23,078 INFO L93 Difference]: Finished difference Result 30 states and 42 transitions. [2018-10-04 09:51:23,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:23,078 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:23,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:23,079 INFO L225 Difference]: With dead ends: 30 [2018-10-04 09:51:23,079 INFO L226 Difference]: Without dead ends: 28 [2018-10-04 09:51:23,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:23,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-04 09:51:23,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-10-04 09:51:23,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 09:51:23,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 09:51:23,108 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 15 [2018-10-04 09:51:23,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:23,108 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 09:51:23,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:23,108 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 09:51:23,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:23,108 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:23,109 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 09:51:23,109 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:23,109 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:23,109 INFO L82 PathProgramCache]: Analyzing trace with hash -189215756, now seen corresponding path program 84 times [2018-10-04 09:51:23,109 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:23,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:23,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:23,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:23,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:23,176 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:23,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:23,177 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:23,185 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:51:23,193 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 09:51:23,193 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:23,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:23,240 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:23,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:23,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:23,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:23,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:23,261 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:23,262 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 9 states. [2018-10-04 09:51:23,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:23,411 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:51:23,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:23,412 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:23,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:23,412 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:51:23,412 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:51:23,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 09:51:23,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:51:23,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 09:51:23,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:51:23,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:51:23,467 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 09:51:23,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:23,467 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:51:23,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:23,467 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:51:23,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:23,467 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:23,467 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 09:51:23,468 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:23,468 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:23,468 INFO L82 PathProgramCache]: Analyzing trace with hash -189213834, now seen corresponding path program 85 times [2018-10-04 09:51:23,468 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:23,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:23,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:23,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:23,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:23,536 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:23,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:23,537 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:23,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:23,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:23,584 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:23,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:23,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:23,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:23,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:23,605 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:23,605 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 09:51:23,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:23,749 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 09:51:23,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:23,750 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:23,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:23,750 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:51:23,750 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:51:23,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:23,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:51:23,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 26. [2018-10-04 09:51:23,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:51:23,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:51:23,801 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 09:51:23,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:23,801 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:51:23,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:23,801 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:51:23,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:23,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:23,802 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 09:51:23,802 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:23,802 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:23,802 INFO L82 PathProgramCache]: Analyzing trace with hash -187368714, now seen corresponding path program 86 times [2018-10-04 09:51:23,802 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:23,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:23,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:23,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:23,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:23,874 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:23,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:23,875 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:23,882 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:51:23,888 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:51:23,888 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:23,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:23,908 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:23,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:23,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:23,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:23,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:23,929 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:23,929 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 09:51:24,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:24,078 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:51:24,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:24,078 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:24,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:24,079 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:51:24,079 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:51:24,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:24,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:51:24,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 09:51:24,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:51:24,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:51:24,135 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 09:51:24,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:24,135 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:51:24,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:24,135 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:51:24,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:24,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:24,135 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 09:51:24,136 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:24,136 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:24,136 INFO L82 PathProgramCache]: Analyzing trace with hash -187366792, now seen corresponding path program 87 times [2018-10-04 09:51:24,136 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:24,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:24,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:24,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:24,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:24,193 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:24,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:24,194 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:24,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:51:24,212 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 09:51:24,212 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:24,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:24,256 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:24,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:24,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:24,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:24,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:24,278 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:24,278 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 09:51:24,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:24,480 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 09:51:24,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:24,481 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:24,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:24,481 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:51:24,481 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:51:24,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:24,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:51:24,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 24. [2018-10-04 09:51:24,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:51:24,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 09:51:24,560 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 09:51:24,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:24,560 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 09:51:24,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:24,561 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 09:51:24,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:24,561 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:24,561 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 09:51:24,561 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:24,561 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:24,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1585791606, now seen corresponding path program 88 times [2018-10-04 09:51:24,562 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:24,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:24,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:24,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:24,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:25,268 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:25,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:25,269 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:25,282 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:51:25,317 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:51:25,317 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:25,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:25,768 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:25,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:25,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:25,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:25,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:25,804 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:25,804 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 09:51:26,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:26,231 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 09:51:26,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:26,232 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:26,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:26,232 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:51:26,232 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:51:26,232 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.4s impTime 7 [2018-10-04 09:51:26,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:51:26,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-04 09:51:26,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:51:26,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:51:26,291 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 09:51:26,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:26,292 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:51:26,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:26,292 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:51:26,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:26,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:26,292 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 09:51:26,292 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:26,292 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:26,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1585793528, now seen corresponding path program 89 times [2018-10-04 09:51:26,293 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:26,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:26,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:26,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:26,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:26,398 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:26,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:26,398 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:26,405 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:51:26,418 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 09:51:26,418 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:26,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:26,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:26,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:26,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:26,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:26,485 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:26,485 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 09:51:26,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:26,636 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 09:51:26,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:26,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:26,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:26,637 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:51:26,637 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:51:26,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 09:51:26,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:51:26,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 26. [2018-10-04 09:51:26,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:51:26,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:51:26,699 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 09:51:26,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:26,699 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:51:26,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:26,699 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:51:26,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:26,699 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:26,700 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 09:51:26,700 INFO L423 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:26,700 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:26,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1587638648, now seen corresponding path program 90 times [2018-10-04 09:51:26,700 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:26,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:26,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:26,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:26,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:26,819 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:26,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:26,820 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:26,836 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:51:26,844 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 09:51:26,844 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:26,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:26,896 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:26,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:26,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:26,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:26,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:26,917 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:26,917 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 09:51:27,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:27,041 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 09:51:27,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:27,042 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:27,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:27,043 INFO L225 Difference]: With dead ends: 43 [2018-10-04 09:51:27,043 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 09:51:27,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 09:51:27,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 09:51:27,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2018-10-04 09:51:27,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:51:27,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:51:27,097 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 09:51:27,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:27,097 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:51:27,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:27,097 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:51:27,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:27,098 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:27,098 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 09:51:27,098 INFO L423 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:27,098 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:27,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1587640570, now seen corresponding path program 91 times [2018-10-04 09:51:27,098 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:27,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:27,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:27,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:27,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:27,258 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:27,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:27,258 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:27,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:27,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:27,291 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:27,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:27,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:27,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:27,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:27,313 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:27,314 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 09:51:27,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:27,437 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 09:51:27,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:27,437 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:27,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:27,438 INFO L225 Difference]: With dead ends: 41 [2018-10-04 09:51:27,438 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:51:27,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 09:51:27,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:51:27,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 22. [2018-10-04 09:51:27,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 09:51:27,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 09:51:27,485 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 15 [2018-10-04 09:51:27,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:27,485 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 09:51:27,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:27,485 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 09:51:27,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:27,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:27,485 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 09:51:27,486 INFO L423 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:27,486 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:27,486 INFO L82 PathProgramCache]: Analyzing trace with hash 490842614, now seen corresponding path program 92 times [2018-10-04 09:51:27,486 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:27,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:27,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:27,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:27,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:27,642 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:27,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:27,643 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:27,653 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:51:27,658 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:51:27,659 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:27,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:27,684 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:27,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:27,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:27,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:27,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:27,704 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:27,704 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 9 states. [2018-10-04 09:51:27,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:27,903 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:51:27,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:27,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:27,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:27,904 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:51:27,904 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:51:27,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 09:51:27,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:51:27,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 09:51:27,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:51:27,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:51:27,977 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 09:51:27,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:27,977 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:51:27,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:27,977 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:51:27,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:27,978 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:27,978 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 09:51:27,978 INFO L423 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:27,978 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:27,978 INFO L82 PathProgramCache]: Analyzing trace with hash 490844536, now seen corresponding path program 93 times [2018-10-04 09:51:27,978 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:27,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:27,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:27,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:27,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:28,052 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:28,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:28,052 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:28,059 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:51:28,066 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 09:51:28,067 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:28,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:28,104 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:28,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:28,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:28,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:28,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:28,125 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:28,125 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 09:51:28,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:28,375 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 09:51:28,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:28,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:28,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:28,376 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:51:28,376 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:51:28,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 09:51:28,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:51:28,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 26. [2018-10-04 09:51:28,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:51:28,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:51:28,465 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 09:51:28,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:28,465 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:51:28,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:28,466 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:51:28,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:28,466 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:28,466 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 09:51:28,466 INFO L423 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:28,467 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:28,467 INFO L82 PathProgramCache]: Analyzing trace with hash 492689656, now seen corresponding path program 94 times [2018-10-04 09:51:28,467 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:28,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:28,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:28,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:28,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:28,920 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:28,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:28,920 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:28,930 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:51:28,938 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:51:28,938 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:28,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:28,957 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:28,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:28,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:28,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:28,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:28,979 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:28,979 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 09:51:29,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:29,176 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:51:29,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:29,177 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:29,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:29,177 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:51:29,177 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:51:29,177 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 7 [2018-10-04 09:51:29,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:51:29,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 09:51:29,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:51:29,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:51:29,239 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 09:51:29,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:29,239 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:51:29,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:29,239 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:51:29,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:29,240 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:29,240 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 09:51:29,240 INFO L423 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:29,240 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:29,240 INFO L82 PathProgramCache]: Analyzing trace with hash 492691578, now seen corresponding path program 95 times [2018-10-04 09:51:29,240 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:29,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:29,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:29,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:29,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:29,394 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:29,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:29,394 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:29,401 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:51:29,409 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 09:51:29,410 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:29,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:29,441 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:29,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:29,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:29,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:29,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:29,462 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:29,462 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 09:51:29,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:29,618 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 09:51:29,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:29,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:29,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:29,619 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:51:29,619 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:51:29,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 09:51:29,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:51:29,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 24. [2018-10-04 09:51:29,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:51:29,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 09:51:29,671 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 09:51:29,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:29,671 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 09:51:29,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:29,671 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 09:51:29,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:29,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:29,672 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 09:51:29,672 INFO L423 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:29,672 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:29,672 INFO L82 PathProgramCache]: Analyzing trace with hash -2029117320, now seen corresponding path program 96 times [2018-10-04 09:51:29,672 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:29,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:29,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:29,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:29,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:29,814 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:29,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:29,815 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-04 09:51:29,826 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:29,839 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 09:51:29,839 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:29,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:29,892 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:29,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:29,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:29,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:29,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:29,913 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:29,913 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 09:51:30,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:30,077 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 09:51:30,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:30,077 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:30,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:30,078 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:51:30,078 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:51:30,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 7 [2018-10-04 09:51:30,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:51:30,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-04 09:51:30,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:51:30,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:51:30,136 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 09:51:30,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:30,136 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:51:30,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:30,136 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:51:30,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:30,136 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:30,136 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 09:51:30,137 INFO L423 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:30,137 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:30,137 INFO L82 PathProgramCache]: Analyzing trace with hash -2029115398, now seen corresponding path program 97 times [2018-10-04 09:51:30,137 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:30,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:30,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:30,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:30,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:30,208 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:30,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:30,209 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:30,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:30,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:30,252 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:30,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:30,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:30,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:30,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:30,273 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:30,274 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 09:51:30,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:30,407 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 09:51:30,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:30,407 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:30,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:30,408 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:51:30,408 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:51:30,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:30,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:51:30,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 26. [2018-10-04 09:51:30,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:51:30,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:51:30,464 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 09:51:30,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:30,464 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:51:30,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:30,465 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:51:30,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:30,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:30,465 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 09:51:30,465 INFO L423 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:30,465 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:30,465 INFO L82 PathProgramCache]: Analyzing trace with hash -2027270278, now seen corresponding path program 98 times [2018-10-04 09:51:30,465 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:30,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:30,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:30,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:30,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:31,254 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:31,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:31,255 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:31,267 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:51:31,301 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:51:31,301 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:31,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:31,499 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:31,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:31,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:31,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:31,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:31,519 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:31,519 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 09:51:31,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:31,650 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 09:51:31,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:31,650 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:31,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:31,651 INFO L225 Difference]: With dead ends: 43 [2018-10-04 09:51:31,651 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 09:51:31,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.5s impTime 7 [2018-10-04 09:51:31,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 09:51:31,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2018-10-04 09:51:31,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:51:31,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:51:31,711 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 09:51:31,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:31,711 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:51:31,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:31,712 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:51:31,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:31,712 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:31,712 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 09:51:31,712 INFO L423 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:31,712 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:31,713 INFO L82 PathProgramCache]: Analyzing trace with hash -2027268356, now seen corresponding path program 99 times [2018-10-04 09:51:31,713 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:31,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:31,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:31,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:31,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:31,778 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:31,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:31,778 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:31,785 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:51:31,793 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 09:51:31,794 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:31,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:31,828 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:31,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:31,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:31,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:31,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:31,849 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:31,850 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 09:51:31,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:31,974 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 09:51:31,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:31,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:31,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:31,975 INFO L225 Difference]: With dead ends: 41 [2018-10-04 09:51:31,975 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:51:31,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:31,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:51:32,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 20. [2018-10-04 09:51:32,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 09:51:32,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 09:51:32,017 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 15 [2018-10-04 09:51:32,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:32,017 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 09:51:32,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:32,017 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 09:51:32,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:32,017 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:32,017 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 09:51:32,018 INFO L423 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:32,018 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:32,018 INFO L82 PathProgramCache]: Analyzing trace with hash 511848822, now seen corresponding path program 100 times [2018-10-04 09:51:32,018 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:32,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:32,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:32,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:32,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:32,070 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:32,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:32,071 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:32,080 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:51:32,085 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:51:32,085 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:32,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:32,125 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:32,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:32,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:32,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:32,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:32,147 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:32,147 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 9 states. [2018-10-04 09:51:32,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:32,320 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 09:51:32,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:32,320 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:32,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:32,321 INFO L225 Difference]: With dead ends: 43 [2018-10-04 09:51:32,321 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 09:51:32,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:32,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 09:51:32,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2018-10-04 09:51:32,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:51:32,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:51:32,387 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 09:51:32,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:32,387 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:51:32,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:32,387 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:51:32,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:32,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:32,388 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 09:51:32,388 INFO L423 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:32,388 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:32,388 INFO L82 PathProgramCache]: Analyzing trace with hash 511850744, now seen corresponding path program 101 times [2018-10-04 09:51:32,388 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:32,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:32,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:32,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:32,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:32,441 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:32,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:32,442 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:32,452 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:51:32,461 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 09:51:32,461 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:32,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:32,503 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:32,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:32,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:32,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:32,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:32,524 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:32,525 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 09:51:32,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:32,680 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 09:51:32,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:32,680 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:32,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:32,681 INFO L225 Difference]: With dead ends: 43 [2018-10-04 09:51:32,681 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 09:51:32,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:32,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 09:51:32,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2018-10-04 09:51:32,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:51:32,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:51:32,741 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 09:51:32,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:32,741 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:51:32,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:32,741 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:51:32,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:32,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:32,742 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 09:51:32,742 INFO L423 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:32,742 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:32,742 INFO L82 PathProgramCache]: Analyzing trace with hash 513695864, now seen corresponding path program 102 times [2018-10-04 09:51:32,742 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:32,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:32,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:32,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:32,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:32,802 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:32,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:32,803 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:32,811 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:51:32,819 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 09:51:32,819 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:32,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:32,950 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:32,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:32,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:32,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:32,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:32,980 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:32,980 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 09:51:33,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:33,322 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 09:51:33,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:33,323 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:33,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:33,323 INFO L225 Difference]: With dead ends: 41 [2018-10-04 09:51:33,323 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:51:33,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 09:51:33,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:51:33,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2018-10-04 09:51:33,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:51:33,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:51:33,395 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 09:51:33,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:33,395 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:51:33,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:33,395 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:51:33,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:33,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:33,395 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 09:51:33,395 INFO L423 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:33,396 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:33,396 INFO L82 PathProgramCache]: Analyzing trace with hash 513697786, now seen corresponding path program 103 times [2018-10-04 09:51:33,396 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:33,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:33,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:33,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:33,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:33,453 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:33,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:33,453 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:33,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:33,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:33,505 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:33,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:33,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:33,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:33,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:33,525 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:33,526 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 09:51:33,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:33,652 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 09:51:33,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:33,653 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:33,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:33,653 INFO L225 Difference]: With dead ends: 39 [2018-10-04 09:51:33,653 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 09:51:33,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:33,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 09:51:33,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2018-10-04 09:51:33,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:51:33,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 09:51:33,712 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 09:51:33,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:33,712 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 09:51:33,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:33,713 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 09:51:33,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:33,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:33,713 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 09:51:33,713 INFO L423 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:33,713 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:33,713 INFO L82 PathProgramCache]: Analyzing trace with hash -2008111112, now seen corresponding path program 104 times [2018-10-04 09:51:33,713 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:33,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:33,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:33,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:33,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:33,769 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:33,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:33,769 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:33,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:51:33,781 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:51:33,782 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:33,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:33,813 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:33,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:33,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:33,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:33,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:33,834 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:33,834 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 09:51:33,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:33,974 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 09:51:33,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:33,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:33,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:33,975 INFO L225 Difference]: With dead ends: 43 [2018-10-04 09:51:33,975 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 09:51:33,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:33,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 09:51:34,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2018-10-04 09:51:34,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:51:34,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:51:34,054 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 09:51:34,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:34,054 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:51:34,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:34,054 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:51:34,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:34,054 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:34,054 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 09:51:34,055 INFO L423 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:34,055 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:34,055 INFO L82 PathProgramCache]: Analyzing trace with hash -2008109190, now seen corresponding path program 105 times [2018-10-04 09:51:34,055 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:34,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:34,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:34,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:34,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:34,118 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:34,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:34,118 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:34,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:51:34,135 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 09:51:34,135 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:34,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:34,165 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:34,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:34,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:34,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:34,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:34,187 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:34,187 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 09:51:34,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:34,326 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 09:51:34,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:34,326 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:34,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:34,327 INFO L225 Difference]: With dead ends: 43 [2018-10-04 09:51:34,327 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 09:51:34,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:34,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 09:51:34,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2018-10-04 09:51:34,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:51:34,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:51:34,391 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 09:51:34,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:34,391 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:51:34,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:34,391 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:51:34,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:34,392 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:34,392 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 09:51:34,392 INFO L423 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:34,392 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:34,392 INFO L82 PathProgramCache]: Analyzing trace with hash -2006264070, now seen corresponding path program 106 times [2018-10-04 09:51:34,392 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:34,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:34,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:34,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:34,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:34,465 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:34,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:34,465 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:34,472 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:51:34,477 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:51:34,477 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:34,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:34,497 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:34,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:34,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:34,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:34,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:34,517 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:34,518 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 09:51:34,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:34,650 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 09:51:34,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:34,651 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:34,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:34,651 INFO L225 Difference]: With dead ends: 41 [2018-10-04 09:51:34,651 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:51:34,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:34,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:51:34,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2018-10-04 09:51:34,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:51:34,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:51:34,717 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 09:51:34,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:34,717 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:51:34,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:34,717 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:51:34,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:34,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:34,718 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 09:51:34,718 INFO L423 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:34,718 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:34,718 INFO L82 PathProgramCache]: Analyzing trace with hash -2006262148, now seen corresponding path program 107 times [2018-10-04 09:51:34,718 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:34,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:34,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:34,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:34,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:34,790 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:34,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:34,790 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:34,799 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:51:34,807 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 09:51:34,807 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:34,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:34,842 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:34,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:34,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:34,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:34,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:34,863 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:34,863 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 09:51:34,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:34,999 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 09:51:34,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:34,999 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:34,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:35,000 INFO L225 Difference]: With dead ends: 39 [2018-10-04 09:51:35,000 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 09:51:35,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:35,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 09:51:35,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 22. [2018-10-04 09:51:35,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 09:51:35,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 09:51:35,052 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 15 [2018-10-04 09:51:35,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:35,052 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 09:51:35,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:35,052 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 09:51:35,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:35,052 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:35,052 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 09:51:35,052 INFO L423 AbstractCegarLoop]: === Iteration 120 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:35,052 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:35,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1191907192, now seen corresponding path program 108 times [2018-10-04 09:51:35,053 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:35,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:35,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:35,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:35,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:35,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:35,271 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:35,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:35,271 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:35,281 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:51:35,288 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 09:51:35,289 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:35,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:35,309 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:35,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:35,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:35,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:35,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:35,330 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:35,330 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 9 states. [2018-10-04 09:51:35,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:35,466 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 09:51:35,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:35,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:35,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:35,467 INFO L225 Difference]: With dead ends: 39 [2018-10-04 09:51:35,467 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 09:51:35,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 7 [2018-10-04 09:51:35,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 09:51:35,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2018-10-04 09:51:35,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:51:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:51:35,538 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 09:51:35,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:35,538 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:51:35,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:35,539 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:51:35,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:35,539 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:35,539 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 09:51:35,539 INFO L423 AbstractCegarLoop]: === Iteration 121 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:35,539 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:35,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1191909114, now seen corresponding path program 109 times [2018-10-04 09:51:35,540 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:35,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:35,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:35,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:35,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:35,735 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:35,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:35,736 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:35,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:35,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:35,768 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:35,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:35,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:35,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:35,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:35,790 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:35,790 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 09:51:35,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:35,908 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 09:51:35,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:35,909 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:35,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:35,909 INFO L225 Difference]: With dead ends: 37 [2018-10-04 09:51:35,909 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 09:51:35,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 7 [2018-10-04 09:51:35,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 09:51:36,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2018-10-04 09:51:36,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:51:36,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:51:36,007 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 09:51:36,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:36,007 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:51:36,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:36,007 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:51:36,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:36,008 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:36,008 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 09:51:36,008 INFO L423 AbstractCegarLoop]: === Iteration 122 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:36,008 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:36,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1193754234, now seen corresponding path program 110 times [2018-10-04 09:51:36,008 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:36,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:36,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:36,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:36,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:36,104 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:36,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:36,104 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:36,112 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:51:36,118 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:51:36,118 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:36,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:36,166 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:36,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:36,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:36,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:36,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:36,186 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:36,186 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 09:51:36,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:36,335 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 09:51:36,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:36,336 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:36,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:36,336 INFO L225 Difference]: With dead ends: 39 [2018-10-04 09:51:36,336 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 09:51:36,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 7 [2018-10-04 09:51:36,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 09:51:36,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2018-10-04 09:51:36,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:51:36,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:51:36,410 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 09:51:36,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:36,410 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:51:36,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:36,411 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:51:36,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:36,411 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:36,411 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 09:51:36,411 INFO L423 AbstractCegarLoop]: === Iteration 123 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:36,411 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:36,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1193756156, now seen corresponding path program 111 times [2018-10-04 09:51:36,411 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:36,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:36,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:36,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:36,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:36,469 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:36,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:36,470 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:36,479 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:51:36,492 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 09:51:36,492 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:36,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:36,533 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:36,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:36,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:36,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:36,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:36,553 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:36,553 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 09:51:36,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:36,679 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 09:51:36,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:36,680 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:36,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:36,680 INFO L225 Difference]: With dead ends: 37 [2018-10-04 09:51:36,680 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 09:51:36,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:36,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 09:51:36,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 24. [2018-10-04 09:51:36,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:51:36,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 09:51:36,744 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 09:51:36,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:36,744 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 09:51:36,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:36,745 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 09:51:36,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:36,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:36,745 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 09:51:36,745 INFO L423 AbstractCegarLoop]: === Iteration 124 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:36,745 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:36,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1328052742, now seen corresponding path program 112 times [2018-10-04 09:51:36,746 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:36,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:36,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:36,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:36,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:36,814 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:36,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:36,814 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:36,822 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:51:36,828 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:51:36,828 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:36,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:36,857 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:36,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:36,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:36,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:36,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:36,879 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:36,879 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 09:51:37,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:37,014 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 09:51:37,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:37,015 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:37,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:37,015 INFO L225 Difference]: With dead ends: 35 [2018-10-04 09:51:37,015 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 09:51:37,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:37,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 09:51:37,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2018-10-04 09:51:37,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:51:37,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:51:37,122 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 09:51:37,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:37,122 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:51:37,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:37,122 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:51:37,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:37,123 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:37,123 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 09:51:37,123 INFO L423 AbstractCegarLoop]: === Iteration 125 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:37,123 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:37,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1328050820, now seen corresponding path program 113 times [2018-10-04 09:51:37,123 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:37,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:37,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:37,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:37,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:37,187 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:37,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:37,188 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:37,197 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:51:37,205 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 09:51:37,205 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:37,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:37,245 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:37,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:37,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:37,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:37,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:37,266 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:37,266 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 09:51:37,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:37,484 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 09:51:37,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:37,485 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:37,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:37,485 INFO L225 Difference]: With dead ends: 35 [2018-10-04 09:51:37,485 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 09:51:37,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:37,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 09:51:37,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2018-10-04 09:51:37,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:51:37,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:51:37,591 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 09:51:37,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:37,591 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:51:37,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:37,592 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:51:37,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:37,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:37,592 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 09:51:37,592 INFO L423 AbstractCegarLoop]: === Iteration 126 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:37,592 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:37,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1326205700, now seen corresponding path program 114 times [2018-10-04 09:51:37,593 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:37,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:37,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:37,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:37,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:37,890 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:37,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:37,890 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:37,899 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:51:37,907 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 09:51:37,907 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:37,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:37,928 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:37,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:37,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:37,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:37,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:37,950 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:37,950 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 09:51:38,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:38,060 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 09:51:38,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:38,061 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:38,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:38,061 INFO L225 Difference]: With dead ends: 33 [2018-10-04 09:51:38,061 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 09:51:38,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 7 [2018-10-04 09:51:38,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 09:51:38,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-10-04 09:51:38,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:51:38,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:51:38,136 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 09:51:38,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:38,136 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:51:38,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:38,136 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:51:38,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:51:38,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:38,137 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1] [2018-10-04 09:51:38,137 INFO L423 AbstractCegarLoop]: === Iteration 127 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:38,137 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:38,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1326203778, now seen corresponding path program 6 times [2018-10-04 09:51:38,137 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:38,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:38,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:38,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:38,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:38,209 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:38,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:38,210 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:38,217 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:51:38,224 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 09:51:38,225 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:38,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:38,260 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:38,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:38,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:51:38,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:51:38,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:51:38,288 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:38,289 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 09:51:38,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:38,395 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2018-10-04 09:51:38,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:51:38,396 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 09:51:38,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:38,396 INFO L225 Difference]: With dead ends: 32 [2018-10-04 09:51:38,396 INFO L226 Difference]: Without dead ends: 30 [2018-10-04 09:51:38,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 7 [2018-10-04 09:51:38,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-04 09:51:38,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 18. [2018-10-04 09:51:38,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 09:51:38,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 09:51:38,443 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 15 [2018-10-04 09:51:38,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:38,443 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 09:51:38,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:51:38,443 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 09:51:38,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:38,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:38,444 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1] [2018-10-04 09:51:38,444 INFO L423 AbstractCegarLoop]: === Iteration 128 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:38,444 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:38,444 INFO L82 PathProgramCache]: Analyzing trace with hash -168156555, now seen corresponding path program 7 times [2018-10-04 09:51:38,444 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:38,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:38,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:38,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:38,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:38,628 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:38,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:38,629 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:38,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:38,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:38,672 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:38,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:38,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:38,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:38,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:38,695 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:38,696 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 10 states. [2018-10-04 09:51:39,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:39,013 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 09:51:39,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:39,014 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:39,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:39,015 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:51:39,015 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 09:51:39,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 8 [2018-10-04 09:51:39,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 09:51:39,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 09:51:39,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:51:39,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:51:39,102 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:51:39,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:39,102 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:51:39,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:39,102 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:51:39,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:39,103 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:39,103 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 09:51:39,103 INFO L423 AbstractCegarLoop]: === Iteration 129 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:39,103 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:39,103 INFO L82 PathProgramCache]: Analyzing trace with hash -168154633, now seen corresponding path program 115 times [2018-10-04 09:51:39,103 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:39,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:39,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:39,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:39,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:39,235 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:39,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:39,236 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:39,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:39,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:39,279 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:39,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:39,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:39,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:39,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:39,301 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:39,301 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:51:39,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:39,497 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:51:39,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:39,498 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:39,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:39,498 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:51:39,498 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:51:39,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:51:39,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:51:39,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 09:51:39,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:51:39,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:51:39,615 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 09:51:39,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:39,615 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:51:39,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:39,616 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:51:39,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:39,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:39,616 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 09:51:39,616 INFO L423 AbstractCegarLoop]: === Iteration 130 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:39,616 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:39,616 INFO L82 PathProgramCache]: Analyzing trace with hash -166309513, now seen corresponding path program 116 times [2018-10-04 09:51:39,616 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:39,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:39,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:39,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:39,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:39,686 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:39,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:39,687 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:39,696 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:51:39,707 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:51:39,707 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:39,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:39,752 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:39,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:39,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:39,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:39,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:39,773 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:39,773 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 09:51:39,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:39,989 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 09:51:39,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:39,990 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:39,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:39,990 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:51:39,990 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 09:51:39,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:51:39,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 09:51:40,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 09:51:40,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:51:40,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:51:40,086 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:51:40,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:40,086 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:51:40,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:40,086 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:51:40,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:40,086 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:40,086 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:51:40,086 INFO L423 AbstractCegarLoop]: === Iteration 131 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:40,087 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:40,087 INFO L82 PathProgramCache]: Analyzing trace with hash -166307591, now seen corresponding path program 117 times [2018-10-04 09:51:40,087 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:40,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:40,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:40,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:40,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:40,165 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:40,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:40,166 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:40,173 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:51:40,182 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 09:51:40,182 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:40,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:40,218 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:40,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:40,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:40,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:40,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:40,239 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:40,239 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:51:40,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:40,432 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:51:40,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:40,432 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:40,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:40,433 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:51:40,433 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:51:40,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:51:40,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:51:40,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2018-10-04 09:51:40,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:51:40,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:51:40,516 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 09:51:40,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:40,516 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:51:40,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:40,516 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:51:40,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:40,516 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:40,516 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 09:51:40,516 INFO L423 AbstractCegarLoop]: === Iteration 132 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:40,516 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:40,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1606850807, now seen corresponding path program 118 times [2018-10-04 09:51:40,517 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:40,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:40,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:40,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:40,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:40,593 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:40,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:40,594 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:40,602 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:51:40,608 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:51:40,608 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:40,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:40,653 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:40,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:40,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:40,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:40,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:40,673 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:40,673 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 09:51:40,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:40,870 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 09:51:40,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:40,870 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:40,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:40,871 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:51:40,871 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:51:40,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:51:40,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:51:40,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2018-10-04 09:51:40,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:51:40,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:51:40,964 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:51:40,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:40,964 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:51:40,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:40,964 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:51:40,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:40,964 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:40,964 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:51:40,964 INFO L423 AbstractCegarLoop]: === Iteration 133 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:40,964 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:40,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1606852729, now seen corresponding path program 119 times [2018-10-04 09:51:40,965 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:40,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:40,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:40,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:40,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:41,053 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:41,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:41,053 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:41,061 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:51:41,069 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 09:51:41,069 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:41,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:41,093 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:41,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:41,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:41,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:41,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:41,114 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:41,114 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:51:41,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:41,311 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 09:51:41,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:41,311 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:41,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:41,312 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:51:41,312 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:51:41,312 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:51:41,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:51:41,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2018-10-04 09:51:41,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:51:41,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:51:41,398 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 09:51:41,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:41,398 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:51:41,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:41,398 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:51:41,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:41,398 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:41,398 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:51:41,398 INFO L423 AbstractCegarLoop]: === Iteration 134 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:41,398 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:41,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1608697849, now seen corresponding path program 120 times [2018-10-04 09:51:41,399 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:41,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:41,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:41,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:41,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:41,497 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:41,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:41,498 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:41,505 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:51:41,514 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 09:51:41,515 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:41,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:41,547 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:41,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:41,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:41,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:41,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:41,568 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:41,568 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 09:51:41,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:41,745 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 09:51:41,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:41,749 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:41,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:41,749 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:51:41,749 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:51:41,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:51:41,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:51:41,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 09:51:41,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:51:41,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:51:41,841 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:51:41,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:41,841 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:51:41,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:41,841 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:51:41,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:41,841 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:41,841 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:51:41,842 INFO L423 AbstractCegarLoop]: === Iteration 135 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:41,842 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:41,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1608699771, now seen corresponding path program 121 times [2018-10-04 09:51:41,842 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:41,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:41,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:41,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:41,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:41,920 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:41,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:41,921 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:41,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:41,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:41,979 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:41,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:41,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:41,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:41,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:41,998 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:41,998 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:51:42,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:42,167 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 09:51:42,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:42,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:42,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:42,168 INFO L225 Difference]: With dead ends: 43 [2018-10-04 09:51:42,168 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 09:51:42,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:51:42,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 09:51:42,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 24. [2018-10-04 09:51:42,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:51:42,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 09:51:42,243 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 17 [2018-10-04 09:51:42,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:42,244 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 09:51:42,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:42,244 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 09:51:42,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:42,244 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:42,244 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 09:51:42,245 INFO L423 AbstractCegarLoop]: === Iteration 136 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:42,245 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:42,245 INFO L82 PathProgramCache]: Analyzing trace with hash 511901815, now seen corresponding path program 122 times [2018-10-04 09:51:42,245 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:42,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:42,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:42,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:42,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:42,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:42,325 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:42,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:42,325 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:42,333 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:51:42,338 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:51:42,338 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:42,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:42,377 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:42,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:42,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:42,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:42,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:42,399 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:42,399 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 10 states. [2018-10-04 09:51:42,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:42,614 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 09:51:42,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:42,615 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:42,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:42,615 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:51:42,615 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 09:51:42,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:51:42,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 09:51:42,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 09:51:42,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:51:42,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:51:42,709 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:51:42,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:42,709 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:51:42,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:42,709 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:51:42,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:42,710 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:42,710 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:51:42,710 INFO L423 AbstractCegarLoop]: === Iteration 137 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:42,710 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:42,710 INFO L82 PathProgramCache]: Analyzing trace with hash 511903737, now seen corresponding path program 123 times [2018-10-04 09:51:42,710 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:42,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:42,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:42,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:42,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:42,785 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:42,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:42,785 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:42,792 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:51:42,800 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 09:51:42,800 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:42,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:42,841 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:42,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:42,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:42,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:42,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:42,862 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:42,862 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:51:43,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:43,060 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:51:43,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:43,060 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:43,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:43,061 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:51:43,061 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:51:43,061 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:51:43,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:51:43,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 09:51:43,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:51:43,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:51:43,152 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 09:51:43,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:43,152 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:51:43,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:43,152 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:51:43,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:43,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:43,153 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:51:43,153 INFO L423 AbstractCegarLoop]: === Iteration 138 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:43,153 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:43,153 INFO L82 PathProgramCache]: Analyzing trace with hash 513748857, now seen corresponding path program 124 times [2018-10-04 09:51:43,153 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:43,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:43,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:43,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:43,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:43,233 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:43,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:43,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 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:43,241 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:51:43,246 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:51:43,247 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:43,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:43,286 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:43,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:43,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:43,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:43,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:43,307 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:43,307 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 09:51:43,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:43,518 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 09:51:43,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:43,519 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:43,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:43,519 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:51:43,519 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 09:51:43,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:51:43,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 09:51:43,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 09:51:43,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:51:43,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:51:43,610 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:51:43,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:43,610 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:51:43,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:43,610 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:51:43,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:43,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:43,611 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:51:43,611 INFO L423 AbstractCegarLoop]: === Iteration 139 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:43,611 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:43,611 INFO L82 PathProgramCache]: Analyzing trace with hash 513750779, now seen corresponding path program 125 times [2018-10-04 09:51:43,611 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:43,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:43,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:43,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:43,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:43,683 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:43,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:43,684 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:43,692 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:51:43,701 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 09:51:43,701 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:43,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:43,736 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:43,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:43,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:43,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:43,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:43,757 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:43,757 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:51:43,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:43,971 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:51:43,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:43,972 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:43,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:43,972 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:51:43,972 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:51:43,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:51:43,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:51:44,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2018-10-04 09:51:44,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:51:44,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:51:44,072 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 09:51:44,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:44,072 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:51:44,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:44,072 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:51:44,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:44,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:44,072 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:51:44,073 INFO L423 AbstractCegarLoop]: === Iteration 140 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:44,073 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:44,073 INFO L82 PathProgramCache]: Analyzing trace with hash -2008058119, now seen corresponding path program 126 times [2018-10-04 09:51:44,073 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:44,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:44,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:44,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:44,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:44,369 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:44,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:44,370 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:44,376 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:51:44,384 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 09:51:44,384 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:44,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:44,430 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:44,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:44,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:44,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:44,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:44,451 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:44,451 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 09:51:44,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:44,638 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 09:51:44,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:44,639 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:44,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:44,639 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:51:44,639 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:51:44,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 8 [2018-10-04 09:51:44,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:51:44,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2018-10-04 09:51:44,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:51:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:51:44,732 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:51:44,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:44,732 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:51:44,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:44,732 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:51:44,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:44,732 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:44,732 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:51:44,732 INFO L423 AbstractCegarLoop]: === Iteration 141 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:44,733 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:44,733 INFO L82 PathProgramCache]: Analyzing trace with hash -2008056197, now seen corresponding path program 127 times [2018-10-04 09:51:44,733 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:44,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:44,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:44,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:44,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:44,949 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:44,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:44,950 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:44,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:44,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:44,985 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:45,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:45,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:45,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:45,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:45,007 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:45,007 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:51:45,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:45,203 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 09:51:45,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:45,204 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:45,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:45,204 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:51:45,204 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:51:45,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 8 [2018-10-04 09:51:45,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:51:45,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2018-10-04 09:51:45,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:51:45,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:51:45,295 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 09:51:45,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:45,295 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:51:45,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:45,295 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:51:45,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:45,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:45,296 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:51:45,296 INFO L423 AbstractCegarLoop]: === Iteration 142 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:45,296 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:45,296 INFO L82 PathProgramCache]: Analyzing trace with hash -2006211077, now seen corresponding path program 128 times [2018-10-04 09:51:45,296 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:45,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:45,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:45,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:45,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:45,365 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:45,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:45,365 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:45,372 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:51:45,379 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:51:45,379 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:45,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:45,412 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:45,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:45,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:45,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:45,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:45,432 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:45,432 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 09:51:45,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:45,648 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 09:51:45,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:45,649 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:45,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:45,649 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:51:45,649 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:51:45,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:51:45,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:51:45,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 09:51:45,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:51:45,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:51:45,749 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:51:45,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:45,750 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:51:45,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:45,750 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:51:45,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:45,750 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:45,750 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:51:45,750 INFO L423 AbstractCegarLoop]: === Iteration 143 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:45,750 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:45,750 INFO L82 PathProgramCache]: Analyzing trace with hash -2006209155, now seen corresponding path program 129 times [2018-10-04 09:51:45,750 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:45,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:45,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:45,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:45,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:45,879 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:45,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:45,879 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:45,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:51:45,895 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 09:51:45,896 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:45,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:45,918 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:45,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:45,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:45,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:45,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:45,939 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:45,939 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:51:46,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:46,126 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 09:51:46,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:46,127 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:46,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:46,127 INFO L225 Difference]: With dead ends: 43 [2018-10-04 09:51:46,127 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 09:51:46,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:51:46,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 09:51:46,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 22. [2018-10-04 09:51:46,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 09:51:46,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 09:51:46,200 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 17 [2018-10-04 09:51:46,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:46,200 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 09:51:46,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:46,200 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 09:51:46,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:46,200 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:46,200 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 09:51:46,200 INFO L423 AbstractCegarLoop]: === Iteration 144 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:46,200 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:46,201 INFO L82 PathProgramCache]: Analyzing trace with hash 532908023, now seen corresponding path program 130 times [2018-10-04 09:51:46,201 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:46,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:46,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:46,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:46,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:46,274 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:46,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:46,275 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:46,281 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:51:46,287 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:51:46,287 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:46,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:46,337 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:46,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:46,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:46,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:46,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:46,358 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:46,358 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 10 states. [2018-10-04 09:51:46,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:46,559 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 09:51:46,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:46,559 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:46,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:46,560 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:51:46,560 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:51:46,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:51:46,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:51:46,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 09:51:46,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:51:46,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:51:46,659 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:51:46,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:46,659 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:51:46,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:46,659 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:51:46,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:46,659 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:46,659 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:51:46,659 INFO L423 AbstractCegarLoop]: === Iteration 145 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:46,659 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:46,659 INFO L82 PathProgramCache]: Analyzing trace with hash 532909945, now seen corresponding path program 131 times [2018-10-04 09:51:46,660 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:46,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:46,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:46,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:46,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:46,822 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:46,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:46,823 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:46,831 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:51:46,845 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 09:51:46,845 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:46,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:46,904 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:46,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:46,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:46,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:46,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:46,924 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:46,924 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:51:47,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:47,119 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 09:51:47,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:47,119 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:47,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:47,120 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:51:47,120 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:51:47,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 8 [2018-10-04 09:51:47,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:51:47,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-04 09:51:47,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:51:47,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:51:47,216 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 09:51:47,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:47,216 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:51:47,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:47,216 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:51:47,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:47,216 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:47,216 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:51:47,216 INFO L423 AbstractCegarLoop]: === Iteration 146 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:47,217 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:47,217 INFO L82 PathProgramCache]: Analyzing trace with hash 534755065, now seen corresponding path program 132 times [2018-10-04 09:51:47,217 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:47,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:47,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:47,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:47,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:47,315 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:47,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:47,316 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:47,324 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:51:47,332 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 09:51:47,333 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:47,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:47,357 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:47,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:47,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:47,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:47,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:47,379 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:47,379 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 09:51:47,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:47,564 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 09:51:47,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:47,565 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:47,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:47,565 INFO L225 Difference]: With dead ends: 43 [2018-10-04 09:51:47,565 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 09:51:47,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:51:47,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 09:51:47,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2018-10-04 09:51:47,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:51:47,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:51:47,667 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:51:47,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:47,667 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:51:47,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:47,667 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:51:47,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:47,668 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:47,668 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:51:47,668 INFO L423 AbstractCegarLoop]: === Iteration 147 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:47,668 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:47,668 INFO L82 PathProgramCache]: Analyzing trace with hash 534756987, now seen corresponding path program 133 times [2018-10-04 09:51:47,668 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:47,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:47,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:47,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:47,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:47,741 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:47,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:47,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 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:47,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:47,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:47,786 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:47,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:47,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:47,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:47,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:47,808 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:47,808 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:51:47,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:47,999 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 09:51:47,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:48,000 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:48,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:48,000 INFO L225 Difference]: With dead ends: 41 [2018-10-04 09:51:48,000 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:51:48,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:51:48,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:51:48,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-10-04 09:51:48,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:51:48,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:51:48,088 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 09:51:48,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:48,089 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:51:48,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:48,089 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:51:48,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:48,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:48,089 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:51:48,089 INFO L423 AbstractCegarLoop]: === Iteration 148 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:48,089 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:48,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1987051911, now seen corresponding path program 134 times [2018-10-04 09:51:48,090 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:48,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:48,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:48,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:48,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:48,161 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:48,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:48,162 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:48,169 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:51:48,174 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:51:48,174 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:48,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:48,200 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:48,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:48,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:48,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:48,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:48,221 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:48,221 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 09:51:48,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:48,454 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 09:51:48,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:48,455 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:48,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:48,455 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:51:48,455 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:51:48,455 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:51:48,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:51:48,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 09:51:48,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:51:48,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:51:48,556 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:51:48,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:48,556 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:51:48,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:48,556 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:51:48,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:48,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:48,556 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:51:48,556 INFO L423 AbstractCegarLoop]: === Iteration 149 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:48,557 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:48,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1987049989, now seen corresponding path program 135 times [2018-10-04 09:51:48,557 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:48,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:48,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:48,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:48,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:48,623 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:48,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:48,623 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:48,633 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:51:48,640 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 09:51:48,640 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:48,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:48,671 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:48,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:48,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:48,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:48,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:48,693 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:48,693 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:51:48,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:48,886 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 09:51:48,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:48,887 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:48,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:48,887 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:51:48,887 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:51:48,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:51:48,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:51:48,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-04 09:51:48,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:51:48,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:51:48,983 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 09:51:48,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:48,983 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:51:48,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:48,983 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:51:48,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:48,983 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:48,983 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:51:48,984 INFO L423 AbstractCegarLoop]: === Iteration 150 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:48,984 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:48,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1985204869, now seen corresponding path program 136 times [2018-10-04 09:51:48,984 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:48,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:48,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:48,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:48,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:49,075 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:49,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:49,076 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:49,084 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:51:49,090 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:51:49,091 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:49,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:49,121 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:49,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:49,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:49,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:49,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:49,144 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:49,144 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 09:51:49,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:49,346 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 09:51:49,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:49,347 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:49,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:49,347 INFO L225 Difference]: With dead ends: 43 [2018-10-04 09:51:49,347 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 09:51:49,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:51:49,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 09:51:49,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2018-10-04 09:51:49,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:51:49,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:51:49,477 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:51:49,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:49,477 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:51:49,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:49,478 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:51:49,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:49,478 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:49,478 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:51:49,478 INFO L423 AbstractCegarLoop]: === Iteration 151 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:49,478 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:49,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1985202947, now seen corresponding path program 137 times [2018-10-04 09:51:49,478 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:49,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:49,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:49,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:49,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:49,547 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:49,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:49,548 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:49,556 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:51:49,563 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 09:51:49,563 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:49,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:49,593 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:49,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:49,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:49,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:49,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:49,615 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:49,615 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:51:49,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:49,799 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 09:51:49,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:49,800 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:49,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:49,800 INFO L225 Difference]: With dead ends: 41 [2018-10-04 09:51:49,800 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:51:49,800 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:51:49,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:51:49,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2018-10-04 09:51:49,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:51:49,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 09:51:49,878 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 17 [2018-10-04 09:51:49,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:49,878 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 09:51:49,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:49,878 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 09:51:49,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:49,878 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:49,879 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:51:49,879 INFO L423 AbstractCegarLoop]: === Iteration 152 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:49,879 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:49,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1212966393, now seen corresponding path program 138 times [2018-10-04 09:51:49,879 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:49,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:49,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:49,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:49,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:49,950 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:49,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:49,951 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:49,957 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:51:49,966 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 09:51:49,966 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:49,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:50,006 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:50,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:50,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:50,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:50,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:50,029 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:50,029 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 10 states. [2018-10-04 09:51:50,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:50,220 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 09:51:50,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:50,221 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:50,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:50,221 INFO L225 Difference]: With dead ends: 41 [2018-10-04 09:51:50,221 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:51:50,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:51:50,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:51:50,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2018-10-04 09:51:50,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:51:50,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:51:50,333 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:51:50,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:50,333 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:51:50,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:50,334 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:51:50,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:50,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:50,334 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:51:50,334 INFO L423 AbstractCegarLoop]: === Iteration 153 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:50,334 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:50,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1212968315, now seen corresponding path program 139 times [2018-10-04 09:51:50,334 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:50,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:50,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:50,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:50,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:50,510 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:50,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:50,511 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:50,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:50,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:50,577 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:50,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:50,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:50,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:50,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:50,599 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:50,599 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:51:50,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:50,784 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 09:51:50,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:50,785 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:50,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:50,785 INFO L225 Difference]: With dead ends: 39 [2018-10-04 09:51:50,785 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 09:51:50,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 8 [2018-10-04 09:51:50,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 09:51:50,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2018-10-04 09:51:50,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:51:50,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:51:50,900 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 09:51:50,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:50,900 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:51:50,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:50,900 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:51:50,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:50,900 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:50,900 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:51:50,901 INFO L423 AbstractCegarLoop]: === Iteration 154 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:50,901 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:50,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1214813435, now seen corresponding path program 140 times [2018-10-04 09:51:50,901 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:50,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:50,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:50,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:50,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:50,963 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:50,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:50,963 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:50,970 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:51:50,991 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:51:50,991 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:50,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:51,029 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:51,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:51,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:51,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:51,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:51,050 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:51,050 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 09:51:51,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:51,248 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 09:51:51,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:51,249 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:51,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:51,249 INFO L225 Difference]: With dead ends: 41 [2018-10-04 09:51:51,249 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:51:51,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:51:51,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:51:51,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2018-10-04 09:51:51,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:51:51,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:51:51,362 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:51:51,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:51,362 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:51:51,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:51,362 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:51:51,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:51,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:51,362 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:51:51,363 INFO L423 AbstractCegarLoop]: === Iteration 155 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:51,363 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:51,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1214815357, now seen corresponding path program 141 times [2018-10-04 09:51:51,363 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:51,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:51,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:51,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:51,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:51,427 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:51,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:51,428 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:51,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:51:51,445 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 09:51:51,445 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:51,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:51,489 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:51,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:51,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:51,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:51,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:51,510 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:51,510 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:51:51,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:51,718 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 09:51:51,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:51,718 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:51,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:51,718 INFO L225 Difference]: With dead ends: 39 [2018-10-04 09:51:51,719 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 09:51:51,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:51:51,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 09:51:51,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-10-04 09:51:51,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:51:51,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:51:51,820 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 09:51:51,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:51,820 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:51:51,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:51,821 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:51:51,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:51,821 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:51,821 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:51:51,821 INFO L423 AbstractCegarLoop]: === Iteration 156 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:51,821 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:51,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1306993541, now seen corresponding path program 142 times [2018-10-04 09:51:51,821 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:51,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:51,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:51,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:51,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:51,937 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:51,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:51,937 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:51,944 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:51:51,954 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:51:51,954 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:51,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:52,010 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:52,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:52,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:52,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:52,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:52,030 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:52,030 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 09:51:52,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:52,221 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 09:51:52,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:52,221 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:52,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:52,222 INFO L225 Difference]: With dead ends: 37 [2018-10-04 09:51:52,222 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 09:51:52,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:51:52,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 09:51:52,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2018-10-04 09:51:52,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:51:52,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:51:52,336 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:51:52,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:52,336 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:51:52,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:52,336 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:51:52,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:52,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:52,336 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:51:52,337 INFO L423 AbstractCegarLoop]: === Iteration 157 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:52,337 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:52,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1306991619, now seen corresponding path program 143 times [2018-10-04 09:51:52,337 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:52,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:52,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:52,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:52,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:52,398 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:52,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:52,399 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:52,406 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:51:52,414 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 09:51:52,414 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:52,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:52,462 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:52,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:52,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:52,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:52,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:52,483 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:52,483 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:51:52,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:52,655 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 09:51:52,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:52,655 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:52,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:52,656 INFO L225 Difference]: With dead ends: 37 [2018-10-04 09:51:52,656 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 09:51:52,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:51:52,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 09:51:52,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2018-10-04 09:51:52,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:51:52,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:51:52,759 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 09:51:52,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:52,759 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:51:52,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:52,759 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:51:52,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:52,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:52,760 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:51:52,760 INFO L423 AbstractCegarLoop]: === Iteration 158 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:52,760 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:52,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1305146499, now seen corresponding path program 144 times [2018-10-04 09:51:52,760 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:52,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:52,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:52,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:52,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:52,863 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:52,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:52,863 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:52,872 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:51:52,881 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 09:51:52,881 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:52,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:52,907 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:52,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:52,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:52,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:52,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:52,928 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:52,928 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 09:51:53,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:53,091 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 09:51:53,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:53,092 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:53,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:53,092 INFO L225 Difference]: With dead ends: 35 [2018-10-04 09:51:53,092 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 09:51:53,092 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:51:53,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 09:51:53,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-10-04 09:51:53,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:51:53,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:51:53,200 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:51:53,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:53,200 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:51:53,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:53,200 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:51:53,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:53,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:53,201 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:51:53,201 INFO L423 AbstractCegarLoop]: === Iteration 159 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:53,201 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:53,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1305144577, now seen corresponding path program 145 times [2018-10-04 09:51:53,201 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:53,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:53,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:53,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:53,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:53,270 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:53,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:53,270 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:53,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:53,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:53,317 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:53,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:53,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:53,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:53,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:53,340 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:53,340 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:51:53,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:53,491 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2018-10-04 09:51:53,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:53,492 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:53,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:53,492 INFO L225 Difference]: With dead ends: 34 [2018-10-04 09:51:53,492 INFO L226 Difference]: Without dead ends: 32 [2018-10-04 09:51:53,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:51:53,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-04 09:51:53,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2018-10-04 09:51:53,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 09:51:53,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 09:51:53,569 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 17 [2018-10-04 09:51:53,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:53,569 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 09:51:53,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:53,569 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 09:51:53,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:53,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:53,570 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 09:51:53,570 INFO L423 AbstractCegarLoop]: === Iteration 160 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:53,570 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:53,570 INFO L82 PathProgramCache]: Analyzing trace with hash -754962569, now seen corresponding path program 146 times [2018-10-04 09:51:53,570 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:53,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:53,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:53,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:53,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:53,659 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:53,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:53,660 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:53,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:51:53,681 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:51:53,681 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:53,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:53,765 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:53,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:53,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:53,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:53,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:53,787 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:53,787 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 10 states. [2018-10-04 09:51:54,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:54,038 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 09:51:54,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:54,038 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:54,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:54,039 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:51:54,039 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 09:51:54,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:51:54,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 09:51:54,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 09:51:54,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:51:54,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:51:54,155 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:51:54,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:54,155 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:51:54,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:54,155 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:51:54,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:54,155 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:54,156 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:51:54,156 INFO L423 AbstractCegarLoop]: === Iteration 161 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:54,156 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:54,156 INFO L82 PathProgramCache]: Analyzing trace with hash -754960647, now seen corresponding path program 147 times [2018-10-04 09:51:54,156 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:54,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:54,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:54,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:54,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:54,220 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:54,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:54,221 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:54,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:51:54,239 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 09:51:54,239 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:54,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:54,272 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:54,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:54,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:54,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:54,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:54,301 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:54,301 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:51:54,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:54,565 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:51:54,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:54,565 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:54,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:54,566 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:51:54,566 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:51:54,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:51:54,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:51:54,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 09:51:54,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:51:54,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:51:54,710 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 09:51:54,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:54,710 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:51:54,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:54,710 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:51:54,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:54,711 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:54,711 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:51:54,711 INFO L423 AbstractCegarLoop]: === Iteration 162 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:54,711 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:54,711 INFO L82 PathProgramCache]: Analyzing trace with hash -753115527, now seen corresponding path program 148 times [2018-10-04 09:51:54,711 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:54,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:54,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:54,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:54,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:54,771 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:54,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:54,772 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:54,780 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:51:54,785 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:51:54,786 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:54,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:54,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:54,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:54,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:54,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:54,836 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:54,836 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 09:51:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:55,097 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 09:51:55,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:55,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:55,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:55,098 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:51:55,098 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 09:51:55,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:51:55,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 09:51:55,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 09:51:55,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:51:55,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:51:55,216 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:51:55,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:55,216 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:51:55,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:55,216 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:51:55,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:55,216 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:55,216 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:51:55,216 INFO L423 AbstractCegarLoop]: === Iteration 163 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:55,217 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:55,217 INFO L82 PathProgramCache]: Analyzing trace with hash -753113605, now seen corresponding path program 149 times [2018-10-04 09:51:55,217 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:55,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:55,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:55,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:55,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:55,285 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:55,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:55,285 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:55,293 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:51:55,301 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 09:51:55,301 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:55,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:55,333 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:55,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:55,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:55,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:55,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:55,355 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:55,355 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:51:55,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:55,603 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:51:55,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:55,604 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:55,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:55,604 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:51:55,604 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:51:55,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:51:55,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:51:55,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2018-10-04 09:51:55,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:51:55,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:51:55,714 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 09:51:55,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:55,715 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:51:55,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:55,715 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:51:55,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:55,715 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:55,715 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:51:55,715 INFO L423 AbstractCegarLoop]: === Iteration 164 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:55,715 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:55,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1020044793, now seen corresponding path program 150 times [2018-10-04 09:51:55,715 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:55,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:55,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:55,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:55,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:55,800 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:55,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:55,801 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:55,808 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:51:55,817 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 09:51:55,818 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:55,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:55,863 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:55,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:55,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:55,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:55,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:55,885 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:55,886 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 09:51:56,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:56,142 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 09:51:56,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:56,142 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:56,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:56,143 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:51:56,143 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:51:56,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:51:56,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:51:56,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2018-10-04 09:51:56,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:51:56,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:51:56,283 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:51:56,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:56,284 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:51:56,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:56,284 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:51:56,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:56,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:56,284 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:51:56,284 INFO L423 AbstractCegarLoop]: === Iteration 165 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:56,284 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:56,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1020046715, now seen corresponding path program 151 times [2018-10-04 09:51:56,284 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:56,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:56,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:56,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:56,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:56,371 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:56,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:56,371 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:56,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:56,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:56,407 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:56,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:56,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:56,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:56,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:56,428 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:56,428 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:51:56,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:56,699 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 09:51:56,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:56,699 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:56,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:56,700 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:51:56,700 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:51:56,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:51:56,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:51:56,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2018-10-04 09:51:56,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:51:56,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:51:56,828 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 09:51:56,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:56,828 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:51:56,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:56,829 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:51:56,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:56,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:56,829 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:51:56,829 INFO L423 AbstractCegarLoop]: === Iteration 166 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:56,829 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:56,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1021891835, now seen corresponding path program 152 times [2018-10-04 09:51:56,830 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:56,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:56,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:56,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:51:56,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:56,953 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:56,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:56,954 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:56,963 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:51:56,970 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:51:56,970 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:56,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:57,018 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:57,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:57,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:57,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:57,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:57,039 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:57,039 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 09:51:57,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:57,299 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 09:51:57,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:57,299 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:57,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:57,300 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:51:57,300 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:51:57,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:51:57,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:51:57,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 09:51:57,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:51:57,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:51:57,432 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:51:57,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:57,432 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:51:57,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:57,432 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:51:57,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:57,432 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:57,432 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:51:57,432 INFO L423 AbstractCegarLoop]: === Iteration 167 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:57,432 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:57,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1021893757, now seen corresponding path program 153 times [2018-10-04 09:51:57,433 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:57,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:57,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:57,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:57,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:57,594 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:57,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:57,595 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:57,602 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:51:57,613 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 09:51:57,613 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:57,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:57,670 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:57,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:57,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:57,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:57,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:57,691 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:57,691 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:51:57,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:57,916 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 09:51:57,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:57,916 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:57,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:57,916 INFO L225 Difference]: With dead ends: 43 [2018-10-04 09:51:57,916 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 09:51:57,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 8 [2018-10-04 09:51:57,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 09:51:58,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 24. [2018-10-04 09:51:58,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:51:58,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 09:51:58,025 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 17 [2018-10-04 09:51:58,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:58,025 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 09:51:58,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:58,025 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 09:51:58,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:58,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:58,025 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:51:58,025 INFO L423 AbstractCegarLoop]: === Iteration 168 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:58,026 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:58,026 INFO L82 PathProgramCache]: Analyzing trace with hash -74904199, now seen corresponding path program 154 times [2018-10-04 09:51:58,026 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:58,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:58,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:58,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:58,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:58,173 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:58,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:58,174 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:58,183 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:51:58,223 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:51:58,223 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:58,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:58,434 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:58,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:58,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:58,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:58,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:58,455 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:58,455 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 10 states. [2018-10-04 09:51:58,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:58,775 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 09:51:58,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:58,776 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:58,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:58,776 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:51:58,776 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 09:51:58,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 8 [2018-10-04 09:51:58,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 09:51:58,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 09:51:58,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:51:58,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:51:58,904 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:51:58,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:51:58,904 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:51:58,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:51:58,904 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:51:58,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:51:58,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:51:58,904 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:51:58,905 INFO L423 AbstractCegarLoop]: === Iteration 169 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:51:58,905 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:51:58,905 INFO L82 PathProgramCache]: Analyzing trace with hash -74902277, now seen corresponding path program 155 times [2018-10-04 09:51:58,905 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:51:58,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:51:58,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:58,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:51:58,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:51:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:51:59,266 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:59,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:51:59,266 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:51:59,279 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:51:59,374 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 09:51:59,374 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:51:59,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:51:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:51:59,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:51:59,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:51:59,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:51:59,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:51:59,655 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:51:59,656 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:51:59,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:51:59,918 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:51:59,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:51:59,919 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:51:59,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:51:59,919 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:51:59,919 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:51:59,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 8 [2018-10-04 09:51:59,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:52:00,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 09:52:00,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:52:00,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:52:00,036 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 09:52:00,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:00,036 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:52:00,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:00,036 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:52:00,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:00,036 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:00,037 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:00,037 INFO L423 AbstractCegarLoop]: === Iteration 170 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:00,037 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:00,037 INFO L82 PathProgramCache]: Analyzing trace with hash -73057157, now seen corresponding path program 156 times [2018-10-04 09:52:00,037 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:00,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:00,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:00,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:00,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:00,127 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:00,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:00,128 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:00,139 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:52:00,147 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 09:52:00,148 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:00,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:00,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:00,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:00,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:00,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:00,227 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:00,227 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 09:52:00,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:00,491 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 09:52:00,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:00,491 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:00,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:00,492 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:52:00,492 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 09:52:00,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:00,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 09:52:00,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 09:52:00,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:52:00,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:52:00,615 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:52:00,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:00,615 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:52:00,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:00,615 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:52:00,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:00,615 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:00,615 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:00,616 INFO L423 AbstractCegarLoop]: === Iteration 171 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:00,616 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:00,616 INFO L82 PathProgramCache]: Analyzing trace with hash -73055235, now seen corresponding path program 157 times [2018-10-04 09:52:00,616 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:00,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:00,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:00,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:00,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:00,691 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:00,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:00,692 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:00,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:52:00,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:00,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:00,735 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:00,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:00,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:00,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:00,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:00,757 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:00,757 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:52:01,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:01,018 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:52:01,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:01,019 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:01,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:01,019 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:52:01,019 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:52:01,019 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:01,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:52:01,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2018-10-04 09:52:01,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:52:01,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:52:01,131 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 09:52:01,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:01,131 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:52:01,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:01,131 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:52:01,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:01,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:01,132 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:01,132 INFO L423 AbstractCegarLoop]: === Iteration 172 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:01,132 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:01,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1700103163, now seen corresponding path program 158 times [2018-10-04 09:52:01,132 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:01,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:01,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:01,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:52:01,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:01,202 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:01,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:01,203 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:01,211 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:52:01,216 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:52:01,217 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:01,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:01,260 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:01,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:01,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:01,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:01,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:01,281 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:01,281 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 09:52:01,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:01,520 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 09:52:01,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:01,521 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:01,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:01,521 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:52:01,521 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:52:01,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:01,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:52:01,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2018-10-04 09:52:01,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:52:01,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:52:01,645 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:52:01,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:01,645 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:52:01,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:01,645 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:52:01,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:01,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:01,645 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:01,646 INFO L423 AbstractCegarLoop]: === Iteration 173 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:01,646 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:01,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1700105085, now seen corresponding path program 159 times [2018-10-04 09:52:01,646 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:01,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:01,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:01,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:01,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:01,717 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:01,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:01,718 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:01,725 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:52:01,733 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 09:52:01,734 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:01,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:01,792 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:01,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:01,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:01,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:01,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:01,814 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:01,814 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:52:02,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:02,068 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 09:52:02,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:02,068 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:02,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:02,069 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:52:02,069 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:52:02,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:02,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:52:02,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2018-10-04 09:52:02,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:52:02,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:52:02,198 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 09:52:02,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:02,198 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:52:02,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:02,198 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:52:02,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:02,198 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:02,198 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:02,198 INFO L423 AbstractCegarLoop]: === Iteration 174 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:02,199 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:02,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1701950205, now seen corresponding path program 160 times [2018-10-04 09:52:02,199 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:02,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:02,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:02,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:02,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:02,335 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:02,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:02,336 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:02,342 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:52:02,347 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:52:02,348 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:02,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:02,404 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:02,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:02,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:02,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:02,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:02,424 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:02,424 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 09:52:02,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:02,673 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 09:52:02,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:02,674 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:02,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:02,674 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:52:02,674 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:52:02,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:02,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:52:02,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 09:52:02,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:52:02,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:52:02,797 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:52:02,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:02,798 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:52:02,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:02,798 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:52:02,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:02,798 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:02,798 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:52:02,798 INFO L423 AbstractCegarLoop]: === Iteration 175 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:02,798 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:02,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1701952127, now seen corresponding path program 161 times [2018-10-04 09:52:02,798 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:02,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:02,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:02,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:02,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:02,866 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:02,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:02,867 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:02,883 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:52:02,909 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 09:52:02,909 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:02,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:02,939 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:02,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:02,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:02,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:02,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:02,961 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:02,961 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:52:03,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:03,312 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 09:52:03,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:03,312 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:03,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:03,313 INFO L225 Difference]: With dead ends: 43 [2018-10-04 09:52:03,313 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 09:52:03,313 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:03,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 09:52:03,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 22. [2018-10-04 09:52:03,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 09:52:03,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 09:52:03,471 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 17 [2018-10-04 09:52:03,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:03,471 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 09:52:03,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:03,472 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 09:52:03,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:03,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:03,472 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:52:03,472 INFO L423 AbstractCegarLoop]: === Iteration 176 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:03,472 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:03,473 INFO L82 PathProgramCache]: Analyzing trace with hash -53897991, now seen corresponding path program 162 times [2018-10-04 09:52:03,473 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:03,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:03,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:03,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:03,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:03,809 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:03,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:03,810 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:03,824 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:52:03,833 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 09:52:03,833 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:03,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:03,855 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:03,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:03,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:03,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:03,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:03,877 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:03,877 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 10 states. [2018-10-04 09:52:04,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:04,118 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 09:52:04,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:04,118 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:04,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:04,118 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:52:04,119 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:52:04,119 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 8 [2018-10-04 09:52:04,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:52:04,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 09:52:04,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:52:04,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:52:04,249 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:52:04,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:04,249 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:52:04,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:04,249 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:52:04,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:04,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:04,249 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:04,249 INFO L423 AbstractCegarLoop]: === Iteration 177 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:04,249 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:04,249 INFO L82 PathProgramCache]: Analyzing trace with hash -53896069, now seen corresponding path program 163 times [2018-10-04 09:52:04,250 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:04,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:04,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:04,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:04,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:04,317 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:04,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:04,318 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:04,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:52:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:04,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:04,425 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:04,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:04,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:04,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:04,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:04,456 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:04,456 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:52:04,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:04,873 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 09:52:04,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:04,873 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:04,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:04,874 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:52:04,874 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:52:04,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:04,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:52:05,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-04 09:52:05,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:52:05,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:52:05,006 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 09:52:05,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:05,006 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:52:05,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:05,006 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:52:05,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:05,006 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:05,007 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:05,007 INFO L423 AbstractCegarLoop]: === Iteration 178 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:05,007 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:05,007 INFO L82 PathProgramCache]: Analyzing trace with hash -52050949, now seen corresponding path program 164 times [2018-10-04 09:52:05,007 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:05,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:05,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:05,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:52:05,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:05,074 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:05,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:05,074 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:05,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:52:05,094 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:52:05,094 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:05,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:05,133 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:05,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:05,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:05,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:05,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:05,154 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:05,154 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 09:52:05,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:05,395 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 09:52:05,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:05,396 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:05,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:05,396 INFO L225 Difference]: With dead ends: 43 [2018-10-04 09:52:05,396 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 09:52:05,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:05,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 09:52:05,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2018-10-04 09:52:05,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:52:05,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:52:05,530 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:52:05,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:05,530 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:52:05,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:05,530 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:52:05,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:05,530 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:05,530 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:05,530 INFO L423 AbstractCegarLoop]: === Iteration 179 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:05,531 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:05,531 INFO L82 PathProgramCache]: Analyzing trace with hash -52049027, now seen corresponding path program 165 times [2018-10-04 09:52:05,531 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:05,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:05,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:05,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:05,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:05,594 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:05,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:05,595 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:05,603 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:52:05,609 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 09:52:05,610 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:05,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:05,641 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:05,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:05,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:05,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:05,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:05,661 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:05,661 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:52:05,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:05,885 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 09:52:05,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:05,886 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:05,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:05,886 INFO L225 Difference]: With dead ends: 41 [2018-10-04 09:52:05,886 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:52:05,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:05,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:52:06,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-10-04 09:52:06,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:52:06,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:52:06,002 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 09:52:06,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:06,002 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:52:06,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:06,002 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:52:06,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:06,003 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:06,003 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:06,003 INFO L423 AbstractCegarLoop]: === Iteration 180 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:06,003 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:06,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1721109371, now seen corresponding path program 166 times [2018-10-04 09:52:06,003 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:06,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:06,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:06,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:06,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:06,073 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:06,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:06,074 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:06,081 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:52:06,087 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:52:06,087 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:06,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:06,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:06,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:06,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:06,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:06,137 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:06,137 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 09:52:06,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:06,386 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 09:52:06,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:06,387 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:06,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:06,387 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:52:06,387 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:52:06,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:06,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:52:06,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 09:52:06,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:52:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:52:06,521 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:52:06,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:06,521 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:52:06,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:06,521 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:52:06,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:06,521 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:06,521 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:06,521 INFO L423 AbstractCegarLoop]: === Iteration 181 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:06,521 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:06,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1721111293, now seen corresponding path program 167 times [2018-10-04 09:52:06,522 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:06,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:06,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:06,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:06,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:06,591 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:06,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:06,591 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:06,599 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:52:06,607 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 09:52:06,607 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:06,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:06,652 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:06,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:06,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:06,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:06,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:06,671 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:06,671 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:52:06,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:06,924 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 09:52:06,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:06,924 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:06,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:06,925 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:52:06,925 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:52:06,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:06,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:52:07,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-04 09:52:07,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:52:07,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:52:07,070 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 09:52:07,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:07,070 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:52:07,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:07,070 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:52:07,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:07,070 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:07,071 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:07,071 INFO L423 AbstractCegarLoop]: === Iteration 182 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:07,071 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:07,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1722956413, now seen corresponding path program 168 times [2018-10-04 09:52:07,071 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:07,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:07,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:07,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:07,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:07,143 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:07,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:07,143 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:07,151 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:52:07,157 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 09:52:07,157 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:07,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:07,187 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:07,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:07,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:07,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:07,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:07,210 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:07,210 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 09:52:07,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:07,434 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 09:52:07,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:07,434 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:07,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:07,434 INFO L225 Difference]: With dead ends: 43 [2018-10-04 09:52:07,435 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 09:52:07,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:07,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 09:52:07,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2018-10-04 09:52:07,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:52:07,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:52:07,567 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:52:07,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:07,567 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:52:07,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:07,567 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:52:07,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:07,567 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:07,567 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:52:07,568 INFO L423 AbstractCegarLoop]: === Iteration 183 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:07,568 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:07,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1722958335, now seen corresponding path program 169 times [2018-10-04 09:52:07,568 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:07,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:07,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:07,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:07,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:07,654 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:07,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:07,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 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:07,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:52:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:07,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:07,688 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:07,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:07,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:07,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:07,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:07,710 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:07,710 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:52:07,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:07,931 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 09:52:07,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:07,932 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:07,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:07,932 INFO L225 Difference]: With dead ends: 41 [2018-10-04 09:52:07,932 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:52:07,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:07,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:52:08,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2018-10-04 09:52:08,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:52:08,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 09:52:08,038 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 17 [2018-10-04 09:52:08,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:08,038 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 09:52:08,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:08,038 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 09:52:08,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:08,038 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:08,038 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:08,039 INFO L423 AbstractCegarLoop]: === Iteration 184 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:08,039 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:08,039 INFO L82 PathProgramCache]: Analyzing trace with hash 626160379, now seen corresponding path program 170 times [2018-10-04 09:52:08,039 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:08,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:08,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:08,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:52:08,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:08,097 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:08,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:08,098 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:08,105 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:52:08,110 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:52:08,111 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:08,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:08,143 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:08,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:08,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:08,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:08,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:08,165 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:08,165 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 10 states. [2018-10-04 09:52:08,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:08,386 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 09:52:08,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:08,387 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:08,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:08,387 INFO L225 Difference]: With dead ends: 41 [2018-10-04 09:52:08,387 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:52:08,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:08,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:52:08,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2018-10-04 09:52:08,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:52:08,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:52:08,532 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:52:08,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:08,532 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:52:08,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:08,532 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:52:08,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:08,532 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:08,532 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:08,533 INFO L423 AbstractCegarLoop]: === Iteration 185 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:08,533 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:08,533 INFO L82 PathProgramCache]: Analyzing trace with hash 626162301, now seen corresponding path program 171 times [2018-10-04 09:52:08,533 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:08,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:08,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:08,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:08,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:08,635 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:08,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:08,636 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:08,645 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:52:08,654 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 09:52:08,654 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:08,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:08,678 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:08,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:08,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:08,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:08,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:08,700 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:08,700 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:52:08,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:08,912 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 09:52:08,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:08,912 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:08,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:08,912 INFO L225 Difference]: With dead ends: 39 [2018-10-04 09:52:08,913 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 09:52:08,913 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:08,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 09:52:09,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2018-10-04 09:52:09,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:52:09,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:52:09,042 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 09:52:09,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:09,042 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:52:09,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:09,043 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:52:09,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:09,043 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:09,043 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:09,043 INFO L423 AbstractCegarLoop]: === Iteration 186 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:09,043 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:09,043 INFO L82 PathProgramCache]: Analyzing trace with hash 628007421, now seen corresponding path program 172 times [2018-10-04 09:52:09,043 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:09,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:09,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:09,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:09,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:09,101 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:09,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:09,101 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:09,111 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:52:09,116 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:52:09,116 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:09,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:09,169 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:09,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:09,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:09,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:09,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:09,191 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:09,191 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 09:52:09,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:09,416 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 09:52:09,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:09,417 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:09,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:09,417 INFO L225 Difference]: With dead ends: 41 [2018-10-04 09:52:09,417 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:52:09,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:09,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:52:09,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2018-10-04 09:52:09,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:52:09,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:52:09,551 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:52:09,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:09,551 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:52:09,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:09,551 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:52:09,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:09,551 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:09,551 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:52:09,551 INFO L423 AbstractCegarLoop]: === Iteration 187 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:09,552 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:09,552 INFO L82 PathProgramCache]: Analyzing trace with hash 628009343, now seen corresponding path program 173 times [2018-10-04 09:52:09,552 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:09,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:09,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:09,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:09,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:09,624 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:09,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:09,624 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:09,632 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:52:09,640 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 09:52:09,640 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:09,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:09,673 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:09,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:09,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:09,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:09,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:09,693 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:09,693 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:52:09,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:09,901 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 09:52:09,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:09,902 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:09,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:09,902 INFO L225 Difference]: With dead ends: 39 [2018-10-04 09:52:09,902 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 09:52:09,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:09,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 09:52:10,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-10-04 09:52:10,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:52:10,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:52:10,021 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 09:52:10,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:10,021 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:52:10,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:10,021 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:52:10,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:10,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:10,021 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:10,021 INFO L423 AbstractCegarLoop]: === Iteration 188 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:10,022 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:10,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1893799555, now seen corresponding path program 174 times [2018-10-04 09:52:10,022 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:10,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:10,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:10,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:10,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:10,094 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:10,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:10,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 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:10,103 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:52:10,125 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 09:52:10,125 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:10,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:10,160 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:10,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:10,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:10,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:10,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:10,181 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:10,181 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 09:52:10,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:10,411 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 09:52:10,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:10,412 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:10,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:10,412 INFO L225 Difference]: With dead ends: 37 [2018-10-04 09:52:10,412 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 09:52:10,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:10,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 09:52:10,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2018-10-04 09:52:10,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:52:10,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:52:10,547 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:52:10,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:10,547 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:52:10,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:10,547 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:52:10,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:10,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:10,548 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:52:10,548 INFO L423 AbstractCegarLoop]: === Iteration 189 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:10,548 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:10,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1893797633, now seen corresponding path program 175 times [2018-10-04 09:52:10,548 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:10,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:10,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:10,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:10,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:10,605 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:10,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:10,605 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:10,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:52:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:10,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:10,655 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:10,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:10,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:10,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:10,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:10,677 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:10,678 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:52:10,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:10,890 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 09:52:10,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:10,891 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:10,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:10,891 INFO L225 Difference]: With dead ends: 37 [2018-10-04 09:52:10,891 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 09:52:10,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:10,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 09:52:11,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2018-10-04 09:52:11,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:52:11,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:52:11,023 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 09:52:11,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:11,023 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:52:11,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:11,023 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:52:11,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:11,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:11,024 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:52:11,024 INFO L423 AbstractCegarLoop]: === Iteration 190 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:11,024 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:11,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1891952513, now seen corresponding path program 176 times [2018-10-04 09:52:11,024 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:11,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:11,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:11,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:52:11,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:11,087 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:11,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:11,087 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:11,108 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:52:11,115 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:52:11,115 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:11,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:11,154 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:11,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:11,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:11,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:11,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:11,176 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:11,176 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 09:52:11,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:11,379 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 09:52:11,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:11,380 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:11,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:11,380 INFO L225 Difference]: With dead ends: 35 [2018-10-04 09:52:11,381 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 09:52:11,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:11,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 09:52:11,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-10-04 09:52:11,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:52:11,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:52:11,513 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:52:11,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:11,513 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:52:11,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:11,513 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:52:11,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:11,514 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:11,514 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 09:52:11,514 INFO L423 AbstractCegarLoop]: === Iteration 191 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:11,514 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:11,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1891950591, now seen corresponding path program 177 times [2018-10-04 09:52:11,514 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:11,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:11,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:11,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:11,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:11,623 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:11,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:11,624 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:11,633 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:52:11,642 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 09:52:11,642 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:11,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:11,678 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:11,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:11,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:11,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:11,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:11,700 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:11,700 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:52:11,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:11,880 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2018-10-04 09:52:11,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:11,886 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:11,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:11,886 INFO L225 Difference]: With dead ends: 34 [2018-10-04 09:52:11,886 INFO L226 Difference]: Without dead ends: 32 [2018-10-04 09:52:11,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:11,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-04 09:52:11,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2018-10-04 09:52:11,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 09:52:11,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 09:52:11,970 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 17 [2018-10-04 09:52:11,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:11,970 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 09:52:11,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:11,970 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 09:52:11,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:11,971 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:11,971 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 09:52:11,971 INFO L423 AbstractCegarLoop]: === Iteration 192 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:11,971 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:11,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1448020233, now seen corresponding path program 178 times [2018-10-04 09:52:11,971 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:11,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:11,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:11,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:11,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:12,556 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:12,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:12,557 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:12,573 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:52:12,579 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:52:12,579 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:12,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:12,633 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:12,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:12,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:12,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:12,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:12,652 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:12,653 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 10 states. [2018-10-04 09:52:13,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:13,024 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 09:52:13,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:13,025 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:13,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:13,025 INFO L225 Difference]: With dead ends: 59 [2018-10-04 09:52:13,025 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 09:52:13,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 8 [2018-10-04 09:52:13,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 09:52:13,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 32. [2018-10-04 09:52:13,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:13,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:13,189 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:13,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:13,190 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:13,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:13,190 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:13,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:13,190 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:13,190 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:52:13,191 INFO L423 AbstractCegarLoop]: === Iteration 193 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:13,191 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:13,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1448018311, now seen corresponding path program 179 times [2018-10-04 09:52:13,191 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:13,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:13,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:13,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:13,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:13,263 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:13,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:13,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 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:13,274 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:52:13,283 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 09:52:13,283 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:13,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:13,317 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:13,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:13,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:13,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:13,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:13,340 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:13,340 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:52:13,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:13,734 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 09:52:13,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:13,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:13,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:13,735 INFO L225 Difference]: With dead ends: 59 [2018-10-04 09:52:13,735 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 09:52:13,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:13,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 09:52:13,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 30. [2018-10-04 09:52:13,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:52:13,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:52:13,893 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:52:13,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:13,893 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:52:13,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:13,893 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:52:13,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:13,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:13,894 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:52:13,894 INFO L423 AbstractCegarLoop]: === Iteration 194 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:13,894 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:13,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1446173191, now seen corresponding path program 180 times [2018-10-04 09:52:13,894 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:13,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:13,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:13,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:13,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:13,953 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:13,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:13,953 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:13,961 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:52:13,970 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 09:52:13,970 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:13,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:14,019 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:14,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:14,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:14,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:14,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:14,041 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:14,041 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:52:14,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:14,409 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 09:52:14,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:14,409 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:14,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:14,410 INFO L225 Difference]: With dead ends: 57 [2018-10-04 09:52:14,410 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 09:52:14,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:14,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 09:52:14,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 32. [2018-10-04 09:52:14,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:14,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:14,607 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:14,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:14,608 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:14,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:14,608 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:14,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:14,608 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:14,608 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:14,608 INFO L423 AbstractCegarLoop]: === Iteration 195 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:14,608 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:14,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1446171269, now seen corresponding path program 181 times [2018-10-04 09:52:14,608 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:14,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:14,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:14,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:14,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:14,680 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:14,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:14,680 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:14,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:52:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:14,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:14,730 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:14,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:14,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:14,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:14,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:14,750 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:14,750 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:52:15,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:15,116 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 09:52:15,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:15,118 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:15,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:15,118 INFO L225 Difference]: With dead ends: 55 [2018-10-04 09:52:15,118 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 09:52:15,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:15,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 09:52:15,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 28. [2018-10-04 09:52:15,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:52:15,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:52:15,261 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 09:52:15,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:15,261 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:52:15,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:15,261 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:52:15,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:15,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:15,261 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:52:15,262 INFO L423 AbstractCegarLoop]: === Iteration 196 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:15,262 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:15,262 INFO L82 PathProgramCache]: Analyzing trace with hash 326987129, now seen corresponding path program 182 times [2018-10-04 09:52:15,262 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:15,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:15,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:15,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:52:15,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:15,322 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:15,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:15,323 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:15,331 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:52:15,337 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:52:15,338 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:15,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:15,373 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:15,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:15,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:15,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:15,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:15,395 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:15,395 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 09:52:15,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:15,790 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 09:52:15,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:15,790 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:15,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:15,791 INFO L225 Difference]: With dead ends: 59 [2018-10-04 09:52:15,791 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 09:52:15,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:15,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 09:52:15,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 32. [2018-10-04 09:52:15,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:15,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:15,952 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:15,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:15,952 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:15,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:15,952 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:15,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:15,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:15,952 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:15,952 INFO L423 AbstractCegarLoop]: === Iteration 197 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:15,952 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:15,953 INFO L82 PathProgramCache]: Analyzing trace with hash 326989051, now seen corresponding path program 183 times [2018-10-04 09:52:15,953 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:15,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:15,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:15,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:15,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:16,028 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:16,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:16,028 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:16,036 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:52:16,046 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 09:52:16,046 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:16,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:16,074 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:16,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:16,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:16,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:16,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:16,096 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:16,097 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:52:16,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:16,480 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 09:52:16,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:16,481 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:16,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:16,481 INFO L225 Difference]: With dead ends: 59 [2018-10-04 09:52:16,481 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 09:52:16,481 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:16,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 09:52:16,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 30. [2018-10-04 09:52:16,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:52:16,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:52:16,640 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:52:16,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:16,640 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:52:16,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:16,640 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:52:16,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:16,640 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:16,640 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:16,640 INFO L423 AbstractCegarLoop]: === Iteration 198 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:16,641 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:16,641 INFO L82 PathProgramCache]: Analyzing trace with hash 328834171, now seen corresponding path program 184 times [2018-10-04 09:52:16,641 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:16,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:16,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:16,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:16,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:16,708 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:16,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:16,708 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:16,716 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:52:16,723 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:52:16,723 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:16,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:16,767 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:16,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:16,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:16,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:16,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:16,787 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:16,787 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:52:17,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:17,152 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 09:52:17,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:17,152 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:17,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:17,153 INFO L225 Difference]: With dead ends: 57 [2018-10-04 09:52:17,153 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 09:52:17,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:17,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 09:52:17,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 32. [2018-10-04 09:52:17,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:17,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:17,314 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:17,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:17,314 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:17,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:17,315 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:17,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:17,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:17,315 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:17,315 INFO L423 AbstractCegarLoop]: === Iteration 199 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:17,315 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:17,315 INFO L82 PathProgramCache]: Analyzing trace with hash 328836093, now seen corresponding path program 185 times [2018-10-04 09:52:17,315 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:17,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:17,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:17,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:17,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:17,385 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:17,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:17,385 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:17,393 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:52:17,402 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 09:52:17,402 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:17,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:17,439 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:17,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:17,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:17,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:17,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:17,476 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:17,476 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:52:18,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:18,017 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 09:52:18,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:18,018 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:18,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:18,018 INFO L225 Difference]: With dead ends: 55 [2018-10-04 09:52:18,018 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 09:52:18,018 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:18,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 09:52:18,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 26. [2018-10-04 09:52:18,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:52:18,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:52:18,151 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 09:52:18,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:18,151 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:52:18,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:18,151 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:52:18,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:18,151 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:18,151 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:52:18,151 INFO L423 AbstractCegarLoop]: === Iteration 200 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:18,151 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:18,151 INFO L82 PathProgramCache]: Analyzing trace with hash -767961863, now seen corresponding path program 186 times [2018-10-04 09:52:18,152 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:18,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:18,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:18,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:18,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:18,736 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:18,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:18,737 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:18,744 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:52:18,753 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 09:52:18,753 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:18,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:18,776 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:18,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:18,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:18,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:18,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:18,798 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:18,798 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 09:52:19,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:19,158 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 09:52:19,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:19,159 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:19,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:19,159 INFO L225 Difference]: With dead ends: 55 [2018-10-04 09:52:19,159 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 09:52:19,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 8 [2018-10-04 09:52:19,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 09:52:19,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 09:52:19,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:19,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:19,322 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:19,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:19,322 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:19,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:19,322 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:19,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:19,322 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:19,322 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:19,322 INFO L423 AbstractCegarLoop]: === Iteration 201 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:19,322 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:19,323 INFO L82 PathProgramCache]: Analyzing trace with hash -767959941, now seen corresponding path program 187 times [2018-10-04 09:52:19,323 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:19,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:19,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:19,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:19,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:19,392 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:19,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:19,393 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:19,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:52:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:19,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:19,451 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:19,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:19,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:19,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:19,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:19,471 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:19,471 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:52:19,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:19,813 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 09:52:19,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:19,813 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:19,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:19,814 INFO L225 Difference]: With dead ends: 53 [2018-10-04 09:52:19,814 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 09:52:19,814 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:19,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 09:52:19,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2018-10-04 09:52:19,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:52:19,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:52:19,981 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:52:19,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:19,981 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:52:19,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:19,981 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:52:19,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:19,982 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:19,982 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:19,982 INFO L423 AbstractCegarLoop]: === Iteration 202 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:19,982 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:19,982 INFO L82 PathProgramCache]: Analyzing trace with hash -766114821, now seen corresponding path program 188 times [2018-10-04 09:52:19,982 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:19,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:19,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:19,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:52:19,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:20,049 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:20,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:20,049 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:20,056 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:52:20,063 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:52:20,064 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:20,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:20,096 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:20,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:20,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:20,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:20,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:20,117 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:20,117 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:52:20,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:20,480 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 09:52:20,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:20,481 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:20,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:20,481 INFO L225 Difference]: With dead ends: 55 [2018-10-04 09:52:20,481 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 09:52:20,481 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:20,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 09:52:20,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 09:52:20,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:20,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:20,653 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:20,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:20,653 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:20,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:20,654 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:20,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:20,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:20,654 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:20,654 INFO L423 AbstractCegarLoop]: === Iteration 203 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:20,654 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:20,654 INFO L82 PathProgramCache]: Analyzing trace with hash -766112899, now seen corresponding path program 189 times [2018-10-04 09:52:20,654 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:20,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:20,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:20,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:20,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:20,721 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:20,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:20,721 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:20,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:52:20,737 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 09:52:20,737 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:20,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:20,769 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:20,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:20,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:20,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:20,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:20,795 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:20,796 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:52:21,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:21,289 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 09:52:21,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:21,290 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:21,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:21,290 INFO L225 Difference]: With dead ends: 53 [2018-10-04 09:52:21,290 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 09:52:21,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:21,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 09:52:21,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 28. [2018-10-04 09:52:21,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:52:21,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:52:21,444 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 09:52:21,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:21,444 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:52:21,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:21,444 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:52:21,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:21,444 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:21,444 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:21,445 INFO L423 AbstractCegarLoop]: === Iteration 204 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:21,445 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:21,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1007045499, now seen corresponding path program 190 times [2018-10-04 09:52:21,445 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:21,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:21,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:21,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:21,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:21,517 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:21,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:21,517 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:21,524 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:52:21,530 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:52:21,530 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:21,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:21,554 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:21,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:21,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:21,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:21,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:21,575 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:21,575 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 09:52:21,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:21,911 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 09:52:21,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:21,912 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:21,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:21,912 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:52:21,912 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 09:52:21,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:21,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 09:52:22,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-10-04 09:52:22,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:22,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:22,083 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:22,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:22,084 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:22,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:22,084 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:22,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:22,084 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:22,084 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:22,084 INFO L423 AbstractCegarLoop]: === Iteration 205 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:22,084 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:22,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1007047421, now seen corresponding path program 191 times [2018-10-04 09:52:22,084 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:22,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:22,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:22,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:22,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:22,221 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:22,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:22,222 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:22,233 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:52:22,241 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 09:52:22,241 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:22,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:22,264 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:22,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:22,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:22,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:22,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:22,286 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:22,286 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:52:22,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:22,617 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 09:52:22,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:22,617 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:22,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:22,618 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:52:22,618 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 09:52:22,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:22,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 09:52:22,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 09:52:22,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:52:22,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:52:22,787 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:52:22,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:22,787 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:52:22,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:22,787 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:52:22,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:22,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:22,788 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:22,788 INFO L423 AbstractCegarLoop]: === Iteration 206 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:22,788 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:22,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1008892541, now seen corresponding path program 192 times [2018-10-04 09:52:22,788 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:22,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:22,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:22,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:22,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:22,895 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:22,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:22,895 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:22,903 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:52:22,919 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 09:52:22,919 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:22,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:22,969 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:22,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:22,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:22,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:22,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:22,989 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:22,989 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:52:23,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:23,322 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:52:23,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:23,323 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:23,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:23,323 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:52:23,323 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:52:23,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:23,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:52:23,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-04 09:52:23,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:23,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:23,504 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:23,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:23,505 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:23,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:23,505 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:23,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:23,505 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:23,505 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:52:23,505 INFO L423 AbstractCegarLoop]: === Iteration 207 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:23,505 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:23,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1008894463, now seen corresponding path program 193 times [2018-10-04 09:52:23,505 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:23,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:23,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:23,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:23,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:23,569 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:23,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:23,570 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:23,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:52:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:23,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:23,610 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:23,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:23,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:23,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:23,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:23,632 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:23,632 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:52:23,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:23,940 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 09:52:23,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:23,941 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:23,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:23,941 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:52:23,941 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:52:23,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:23,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:52:24,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 24. [2018-10-04 09:52:24,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:52:24,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 09:52:24,064 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 17 [2018-10-04 09:52:24,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:24,064 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 09:52:24,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:24,064 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 09:52:24,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:24,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:24,065 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:52:24,065 INFO L423 AbstractCegarLoop]: === Iteration 208 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:24,065 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:24,065 INFO L82 PathProgramCache]: Analyzing trace with hash -746955655, now seen corresponding path program 194 times [2018-10-04 09:52:24,065 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:24,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:24,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:24,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:52:24,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:24,133 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:24,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:24,133 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:24,141 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:52:24,147 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:52:24,147 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:24,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:24,178 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:24,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:24,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:24,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:24,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:24,200 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:24,200 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 10 states. [2018-10-04 09:52:24,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:24,614 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 09:52:24,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:24,615 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:24,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:24,615 INFO L225 Difference]: With dead ends: 59 [2018-10-04 09:52:24,615 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 09:52:24,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:24,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 09:52:24,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 32. [2018-10-04 09:52:24,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:24,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:24,796 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:24,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:24,796 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:24,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:24,796 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:24,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:24,796 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:24,796 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:24,796 INFO L423 AbstractCegarLoop]: === Iteration 209 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:24,796 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:24,796 INFO L82 PathProgramCache]: Analyzing trace with hash -746953733, now seen corresponding path program 195 times [2018-10-04 09:52:24,797 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:24,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:24,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:24,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:24,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:24,864 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:24,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:24,864 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:24,872 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:52:24,880 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 09:52:24,880 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:24,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:24,908 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:24,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:24,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:24,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:24,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:24,929 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:24,929 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:52:25,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:25,351 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 09:52:25,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:25,352 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:25,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:25,352 INFO L225 Difference]: With dead ends: 59 [2018-10-04 09:52:25,352 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 09:52:25,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:25,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 09:52:25,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 30. [2018-10-04 09:52:25,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:52:25,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:52:25,524 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:52:25,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:25,524 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:52:25,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:25,524 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:52:25,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:25,524 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:25,524 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:25,524 INFO L423 AbstractCegarLoop]: === Iteration 210 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:25,525 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:25,525 INFO L82 PathProgramCache]: Analyzing trace with hash -745108613, now seen corresponding path program 196 times [2018-10-04 09:52:25,525 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:25,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:25,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:25,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:25,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:25,592 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:25,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:25,593 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:25,599 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:52:25,604 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:52:25,605 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:25,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:25,635 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:25,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:25,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:25,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:25,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:25,657 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:25,657 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:52:26,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:26,055 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 09:52:26,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:26,056 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:26,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:26,056 INFO L225 Difference]: With dead ends: 57 [2018-10-04 09:52:26,056 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 09:52:26,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:26,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 09:52:26,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 32. [2018-10-04 09:52:26,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:26,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:26,238 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:26,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:26,238 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:26,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:26,238 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:26,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:26,239 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:26,239 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:26,239 INFO L423 AbstractCegarLoop]: === Iteration 211 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:26,239 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:26,239 INFO L82 PathProgramCache]: Analyzing trace with hash -745106691, now seen corresponding path program 197 times [2018-10-04 09:52:26,239 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:26,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:26,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:26,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:26,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:26,302 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:26,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:26,302 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:26,310 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:52:26,318 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 09:52:26,318 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:26,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:26,363 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:26,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:26,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:26,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:26,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:26,384 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:26,384 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:52:26,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:26,757 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 09:52:26,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:26,757 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:26,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:26,758 INFO L225 Difference]: With dead ends: 55 [2018-10-04 09:52:26,758 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 09:52:26,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:26,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 09:52:26,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 28. [2018-10-04 09:52:26,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:52:26,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:52:26,923 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 09:52:26,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:26,923 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:52:26,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:26,923 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:52:26,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:26,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:26,923 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:26,924 INFO L423 AbstractCegarLoop]: === Iteration 212 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:26,924 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:26,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1028051707, now seen corresponding path program 198 times [2018-10-04 09:52:26,924 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:26,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:26,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:26,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:26,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:26,993 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:26,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:26,994 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:27,001 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:52:27,010 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 09:52:27,010 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:27,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:27,054 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:27,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:27,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:27,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:27,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:27,074 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:27,074 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 09:52:27,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:27,504 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 09:52:27,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:27,505 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:27,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:27,505 INFO L225 Difference]: With dead ends: 59 [2018-10-04 09:52:27,505 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 09:52:27,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:27,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 09:52:27,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 32. [2018-10-04 09:52:27,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:27,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:27,684 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:27,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:27,684 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:27,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:27,684 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:27,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:27,685 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:27,685 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:27,685 INFO L423 AbstractCegarLoop]: === Iteration 213 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:27,685 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:27,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1028053629, now seen corresponding path program 199 times [2018-10-04 09:52:27,685 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:27,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:27,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:27,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:27,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:27,767 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:27,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:27,767 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:27,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:52:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:27,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:27,836 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:27,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:27,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:27,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:27,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:27,857 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:27,857 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:52:28,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:28,290 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 09:52:28,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:28,291 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:28,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:28,291 INFO L225 Difference]: With dead ends: 59 [2018-10-04 09:52:28,291 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 09:52:28,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:28,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 09:52:28,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 30. [2018-10-04 09:52:28,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:52:28,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:52:28,469 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:52:28,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:28,469 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:52:28,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:28,469 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:52:28,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:28,470 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:28,470 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:28,470 INFO L423 AbstractCegarLoop]: === Iteration 214 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:28,470 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:28,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1029898749, now seen corresponding path program 200 times [2018-10-04 09:52:28,470 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:28,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:28,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:28,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:52:28,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:28,553 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:28,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:28,554 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:28,561 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:52:28,570 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:52:28,570 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:28,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:28,605 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:28,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:28,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:28,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:28,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:28,627 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:28,627 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:52:29,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:29,021 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 09:52:29,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:29,022 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:29,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:29,022 INFO L225 Difference]: With dead ends: 57 [2018-10-04 09:52:29,022 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 09:52:29,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:29,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 09:52:29,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 32. [2018-10-04 09:52:29,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:29,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:29,207 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:29,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:29,207 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:29,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:29,207 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:29,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:29,207 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:29,207 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:52:29,207 INFO L423 AbstractCegarLoop]: === Iteration 215 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:29,207 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:29,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1029900671, now seen corresponding path program 201 times [2018-10-04 09:52:29,208 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:29,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:29,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:29,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:29,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:29,278 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:29,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:29,278 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:29,287 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:52:29,296 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 09:52:29,296 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:29,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:29,342 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:29,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:29,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:29,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:29,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:29,363 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:29,363 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:52:29,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:29,782 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 09:52:29,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:29,783 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:29,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:29,783 INFO L225 Difference]: With dead ends: 55 [2018-10-04 09:52:29,783 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 09:52:29,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:29,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 09:52:29,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 26. [2018-10-04 09:52:29,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:52:29,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:52:29,935 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 09:52:29,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:29,935 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:52:29,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:29,935 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:52:29,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:29,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:29,935 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:29,935 INFO L423 AbstractCegarLoop]: === Iteration 216 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:29,935 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:29,935 INFO L82 PathProgramCache]: Analyzing trace with hash -66897285, now seen corresponding path program 202 times [2018-10-04 09:52:29,935 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:29,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:29,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:29,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:29,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:30,004 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:30,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:30,005 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:30,015 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:52:30,020 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:52:30,020 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:30,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:30,060 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:30,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:30,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:30,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:30,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:30,082 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:30,082 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 09:52:30,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:30,488 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 09:52:30,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:30,489 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:30,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:30,489 INFO L225 Difference]: With dead ends: 55 [2018-10-04 09:52:30,489 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 09:52:30,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:30,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 09:52:30,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 09:52:30,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:30,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:30,671 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:30,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:30,671 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:30,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:30,671 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:30,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:30,671 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:30,671 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:30,672 INFO L423 AbstractCegarLoop]: === Iteration 217 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:30,672 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:30,672 INFO L82 PathProgramCache]: Analyzing trace with hash -66895363, now seen corresponding path program 203 times [2018-10-04 09:52:30,672 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:30,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:30,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:30,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:30,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:30,744 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:30,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:30,745 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:30,754 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:52:30,763 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 09:52:30,763 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:30,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:30,804 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:30,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:30,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:30,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:30,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:30,825 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:30,826 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:52:31,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:31,198 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 09:52:31,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:31,199 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:31,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:31,199 INFO L225 Difference]: With dead ends: 53 [2018-10-04 09:52:31,199 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 09:52:31,199 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:31,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 09:52:31,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2018-10-04 09:52:31,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:52:31,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:52:31,379 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:52:31,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:31,379 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:52:31,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:31,380 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:52:31,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:31,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:31,380 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:31,380 INFO L423 AbstractCegarLoop]: === Iteration 218 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:31,380 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:31,380 INFO L82 PathProgramCache]: Analyzing trace with hash -65050243, now seen corresponding path program 204 times [2018-10-04 09:52:31,381 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:31,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:31,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:31,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:31,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:31,646 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:31,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:31,647 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:31,655 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:52:31,664 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 09:52:31,665 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:31,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:31,687 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:31,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:31,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:31,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:31,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:31,708 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:31,708 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:52:32,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:32,102 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 09:52:32,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:32,103 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:32,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:32,103 INFO L225 Difference]: With dead ends: 55 [2018-10-04 09:52:32,103 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 09:52:32,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 8 [2018-10-04 09:52:32,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 09:52:32,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 09:52:32,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:32,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:32,287 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:32,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:32,287 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:32,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:32,287 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:32,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:32,287 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:32,288 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:52:32,288 INFO L423 AbstractCegarLoop]: === Iteration 219 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:32,288 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:32,288 INFO L82 PathProgramCache]: Analyzing trace with hash -65048321, now seen corresponding path program 205 times [2018-10-04 09:52:32,288 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:32,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:32,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:32,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:32,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:32,356 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:32,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:32,356 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:32,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:52:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:32,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:32,406 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:32,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:32,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:32,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:32,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:32,428 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:32,428 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:52:32,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:32,798 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 09:52:32,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:32,799 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:32,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:32,799 INFO L225 Difference]: With dead ends: 53 [2018-10-04 09:52:32,799 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 09:52:32,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:32,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 09:52:32,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 28. [2018-10-04 09:52:32,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:52:32,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:52:32,977 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 09:52:32,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:32,978 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:52:32,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:32,978 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:52:32,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:32,978 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:32,978 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:32,978 INFO L423 AbstractCegarLoop]: === Iteration 220 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:32,978 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:32,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1708110077, now seen corresponding path program 206 times [2018-10-04 09:52:32,979 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:32,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:32,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:32,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:52:32,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:32,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:33,100 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:33,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:33,101 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:33,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:52:33,120 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:52:33,120 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:33,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:33,166 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:33,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:33,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:33,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:33,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:33,185 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:33,185 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 09:52:33,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:33,533 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 09:52:33,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:33,533 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:33,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:33,534 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:52:33,534 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 09:52:33,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:33,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 09:52:33,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-10-04 09:52:33,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:33,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:33,716 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:33,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:33,716 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:33,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:33,717 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:33,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:33,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:33,717 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:52:33,717 INFO L423 AbstractCegarLoop]: === Iteration 221 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:33,717 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:33,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1708111999, now seen corresponding path program 207 times [2018-10-04 09:52:33,717 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:33,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:33,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:33,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:33,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:33,808 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:33,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:33,808 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:33,816 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:52:33,825 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 09:52:33,825 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:33,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:33,852 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:33,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:33,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:33,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:33,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:33,873 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:33,873 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:52:34,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:34,226 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 09:52:34,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:34,227 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:34,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:34,227 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:52:34,227 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 09:52:34,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:34,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 09:52:34,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 09:52:34,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:52:34,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:52:34,406 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:52:34,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:34,406 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:52:34,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:34,406 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:52:34,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:34,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:34,406 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:52:34,406 INFO L423 AbstractCegarLoop]: === Iteration 222 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:34,407 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:34,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1709957119, now seen corresponding path program 208 times [2018-10-04 09:52:34,407 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:34,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:34,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:34,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:34,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:34,472 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:34,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:34,472 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:34,480 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:52:34,486 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:52:34,486 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:34,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:34,555 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:34,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:34,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:34,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:34,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:34,577 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:34,577 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:52:34,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:34,921 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:52:34,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:34,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:34,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:34,922 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:52:34,922 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:52:34,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:34,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:52:35,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-04 09:52:35,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:35,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:35,113 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:35,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:35,113 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:35,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:35,113 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:35,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:35,114 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:35,114 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 09:52:35,114 INFO L423 AbstractCegarLoop]: === Iteration 223 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:35,114 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:35,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1709959041, now seen corresponding path program 209 times [2018-10-04 09:52:35,114 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:35,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:35,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:35,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:35,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:35,183 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:35,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:35,183 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:35,190 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:52:35,199 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 09:52:35,199 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:35,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:35,226 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:35,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:35,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:35,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:35,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:35,248 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:35,248 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:52:35,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:35,574 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 09:52:35,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:35,575 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:35,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:35,575 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:52:35,575 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:52:35,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:35,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:52:35,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 22. [2018-10-04 09:52:35,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 09:52:35,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 09:52:35,699 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 17 [2018-10-04 09:52:35,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:35,699 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 09:52:35,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:35,699 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 09:52:35,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:35,699 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:35,699 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:52:35,699 INFO L423 AbstractCegarLoop]: === Iteration 224 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:35,699 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:35,699 INFO L82 PathProgramCache]: Analyzing trace with hash -2034826247, now seen corresponding path program 210 times [2018-10-04 09:52:35,700 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:35,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:35,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:35,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:35,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:35,762 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:35,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:35,763 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 224 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 224 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:35,770 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:52:35,779 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 09:52:35,779 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:35,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:35,824 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:35,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:35,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:35,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:35,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:35,844 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:35,844 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 10 states. [2018-10-04 09:52:36,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:36,308 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 09:52:36,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:36,309 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:36,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:36,309 INFO L225 Difference]: With dead ends: 53 [2018-10-04 09:52:36,309 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 09:52:36,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:36,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 09:52:36,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 09:52:36,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:36,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:36,516 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:36,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:36,516 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:36,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:36,516 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:36,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:36,516 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:36,516 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:36,517 INFO L423 AbstractCegarLoop]: === Iteration 225 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:36,517 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:36,517 INFO L82 PathProgramCache]: Analyzing trace with hash -2034824325, now seen corresponding path program 211 times [2018-10-04 09:52:36,517 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:36,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:36,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:36,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:36,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:36,580 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:36,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:36,580 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 225 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 225 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:36,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:52:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:36,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:36,631 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:36,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:36,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:36,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:36,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:36,653 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:36,654 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:52:37,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:37,034 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 09:52:37,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:37,035 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:37,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:37,035 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:52:37,035 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 09:52:37,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:37,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 09:52:37,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 09:52:37,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:52:37,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:52:37,231 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:52:37,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:37,231 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:52:37,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:37,231 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:52:37,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:37,232 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:37,232 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:37,232 INFO L423 AbstractCegarLoop]: === Iteration 226 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:37,232 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:37,232 INFO L82 PathProgramCache]: Analyzing trace with hash -2032979205, now seen corresponding path program 212 times [2018-10-04 09:52:37,232 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:37,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:37,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:37,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:52:37,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:37,299 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:37,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:37,299 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 226 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 226 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:37,307 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:52:37,311 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:52:37,312 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:37,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:37,355 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:37,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:37,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:37,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:37,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:37,375 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:37,375 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:52:37,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:37,765 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 09:52:37,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:37,766 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:37,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:37,766 INFO L225 Difference]: With dead ends: 53 [2018-10-04 09:52:37,766 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 09:52:37,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:37,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 09:52:37,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 09:52:37,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:37,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:37,975 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:37,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:37,975 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:37,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:37,975 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:37,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:37,975 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:37,975 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:37,975 INFO L423 AbstractCegarLoop]: === Iteration 227 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:37,976 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:37,976 INFO L82 PathProgramCache]: Analyzing trace with hash -2032977283, now seen corresponding path program 213 times [2018-10-04 09:52:37,976 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:37,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:37,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:37,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:37,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:37,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:38,148 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:38,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:38,149 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 227 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 227 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:38,157 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:52:38,170 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 09:52:38,170 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:38,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:38,221 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:38,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:38,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:38,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:38,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:38,241 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:38,241 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:52:38,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:38,616 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 09:52:38,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:38,616 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:38,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:38,617 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:52:38,617 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 09:52:38,617 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 8 [2018-10-04 09:52:38,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 09:52:38,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 28. [2018-10-04 09:52:38,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:52:38,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:52:38,801 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 09:52:38,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:38,801 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:52:38,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:38,801 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:52:38,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:38,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:38,802 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:38,802 INFO L423 AbstractCegarLoop]: === Iteration 228 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:38,802 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:38,802 INFO L82 PathProgramCache]: Analyzing trace with hash -259818885, now seen corresponding path program 214 times [2018-10-04 09:52:38,802 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:38,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:38,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:38,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:38,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:38,859 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:38,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:38,859 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 228 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 228 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:38,870 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:52:38,876 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:52:38,876 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:38,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:39,059 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:39,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:39,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:39,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:39,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:39,080 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:39,081 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 09:52:39,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:39,486 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:52:39,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:39,486 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:39,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:39,487 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:52:39,487 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:52:39,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 8 [2018-10-04 09:52:39,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:52:39,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-04 09:52:39,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:39,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:39,698 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:39,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:39,698 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:39,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:39,698 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:39,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:39,699 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:39,699 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:39,699 INFO L423 AbstractCegarLoop]: === Iteration 229 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:39,699 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:39,699 INFO L82 PathProgramCache]: Analyzing trace with hash -259816963, now seen corresponding path program 215 times [2018-10-04 09:52:39,699 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:39,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:39,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:39,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:39,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:39,770 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:39,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:39,771 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 229 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 229 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:39,779 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:52:39,789 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 09:52:39,789 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:39,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:39,823 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:39,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:39,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:39,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:39,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:39,845 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:39,845 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:52:40,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:40,235 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:52:40,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:40,236 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:40,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:40,236 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:52:40,236 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:52:40,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:40,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:52:40,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2018-10-04 09:52:40,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:52:40,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:52:40,443 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:52:40,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:40,443 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:52:40,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:40,443 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:52:40,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:40,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:40,443 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:40,443 INFO L423 AbstractCegarLoop]: === Iteration 230 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:40,443 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:40,444 INFO L82 PathProgramCache]: Analyzing trace with hash -257971843, now seen corresponding path program 216 times [2018-10-04 09:52:40,444 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:40,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:40,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:40,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:40,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:40,502 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:40,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:40,503 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 230 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 230 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:40,511 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:52:40,521 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 09:52:40,521 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:40,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:40,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:40,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:40,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:40,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:40,587 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:40,587 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:52:40,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:40,961 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 09:52:40,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:40,962 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:40,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:40,962 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:52:40,962 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:52:40,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:40,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:52:41,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2018-10-04 09:52:41,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:41,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:41,185 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:41,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:41,185 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:41,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:41,185 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:41,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:41,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:41,185 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:52:41,186 INFO L423 AbstractCegarLoop]: === Iteration 231 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:41,186 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:41,186 INFO L82 PathProgramCache]: Analyzing trace with hash -257969921, now seen corresponding path program 217 times [2018-10-04 09:52:41,186 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:41,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:41,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:41,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:41,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:41,256 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:41,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:41,256 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 231 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 231 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:41,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:52:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:41,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:41,307 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:41,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:41,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:41,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:41,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:41,329 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:41,329 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:52:41,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:41,696 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 09:52:41,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:41,697 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:41,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:41,697 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:52:41,697 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:52:41,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:41,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:52:41,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 26. [2018-10-04 09:52:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:52:41,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:52:41,874 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 09:52:41,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:41,874 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:52:41,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:41,874 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:52:41,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:41,875 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:41,875 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:41,875 INFO L423 AbstractCegarLoop]: === Iteration 232 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:41,875 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:41,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1354767877, now seen corresponding path program 218 times [2018-10-04 09:52:41,875 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:41,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:41,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:41,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:52:41,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:41,950 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:41,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:41,950 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 232 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 232 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:41,959 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:52:41,965 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:52:41,965 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:41,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:42,002 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:42,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:42,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:42,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:42,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:42,023 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:42,023 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 09:52:42,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:42,496 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 09:52:42,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:42,496 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:42,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:42,497 INFO L225 Difference]: With dead ends: 53 [2018-10-04 09:52:42,497 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 09:52:42,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:42,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 09:52:42,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 09:52:42,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:42,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:42,728 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:42,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:42,729 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:42,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:42,729 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:42,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:42,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:42,729 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:42,729 INFO L423 AbstractCegarLoop]: === Iteration 233 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:42,729 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:42,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1354765955, now seen corresponding path program 219 times [2018-10-04 09:52:42,730 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:42,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:42,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:42,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:42,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:42,797 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:42,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:42,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 233 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 233 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:42,806 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:52:42,813 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 09:52:42,813 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:42,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:43,324 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:43,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:43,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:43,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:43,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:43,362 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:43,362 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:52:44,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:44,123 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 09:52:44,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:44,123 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:44,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:44,124 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:52:44,124 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 09:52:44,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.0s impTime 8 [2018-10-04 09:52:44,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 09:52:44,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 09:52:44,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:52:44,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:52:44,338 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:52:44,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:44,339 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:52:44,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:44,339 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:52:44,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:44,339 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:44,339 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:44,339 INFO L423 AbstractCegarLoop]: === Iteration 234 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:44,339 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:44,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1352920835, now seen corresponding path program 220 times [2018-10-04 09:52:44,340 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:44,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:44,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:44,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:44,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:44,412 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:44,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:44,412 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 234 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 234 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:44,421 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:52:44,428 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:52:44,428 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:44,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:44,460 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:44,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:44,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:44,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:44,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:44,482 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:44,482 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:52:44,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:44,906 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 09:52:44,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:44,907 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:44,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:44,907 INFO L225 Difference]: With dead ends: 53 [2018-10-04 09:52:44,907 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 09:52:44,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:44,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 09:52:45,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 09:52:45,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:45,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:45,115 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:45,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:45,116 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:45,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:45,116 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:45,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:45,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:45,116 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:52:45,116 INFO L423 AbstractCegarLoop]: === Iteration 235 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:45,116 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:45,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1352918913, now seen corresponding path program 221 times [2018-10-04 09:52:45,117 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:45,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:45,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:45,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:45,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:45,189 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:45,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:45,189 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 235 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 235 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:45,201 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:52:45,210 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 09:52:45,210 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:45,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:45,237 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:45,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:45,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:45,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:45,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:45,259 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:45,259 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:52:45,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:45,670 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 09:52:45,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:45,671 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:45,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:45,671 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:52:45,671 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 09:52:45,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:45,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 09:52:45,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 28. [2018-10-04 09:52:45,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:52:45,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:52:45,862 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 09:52:45,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:45,862 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:52:45,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:45,862 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:52:45,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:45,862 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:45,862 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:45,862 INFO L423 AbstractCegarLoop]: === Iteration 236 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:45,862 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:45,863 INFO L82 PathProgramCache]: Analyzing trace with hash 420239485, now seen corresponding path program 222 times [2018-10-04 09:52:45,863 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:45,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:45,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:45,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:45,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:45,948 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:45,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:45,948 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 236 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 236 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:45,956 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:52:45,965 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 09:52:45,965 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:45,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:45,989 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:46,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:46,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:46,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:46,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:46,012 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:46,012 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 09:52:46,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:46,405 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:52:46,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:46,406 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:46,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:46,406 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:52:46,406 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:52:46,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:46,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:52:46,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-04 09:52:46,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:46,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:46,616 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:46,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:46,616 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:46,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:46,616 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:46,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:46,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:46,616 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:52:46,617 INFO L423 AbstractCegarLoop]: === Iteration 237 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:46,617 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:46,617 INFO L82 PathProgramCache]: Analyzing trace with hash 420241407, now seen corresponding path program 223 times [2018-10-04 09:52:46,617 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:46,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:46,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:46,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:46,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:47,120 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:47,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:47,120 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 237 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 237 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:47,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:52:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:47,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:47,155 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:47,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:47,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:47,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:47,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:47,177 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:47,177 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:52:47,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:47,552 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:52:47,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:47,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:47,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:47,553 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:52:47,553 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:52:47,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 8 [2018-10-04 09:52:47,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:52:47,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2018-10-04 09:52:47,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:52:47,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:52:47,757 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:52:47,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:47,757 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:52:47,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:47,758 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:52:47,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:47,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:47,758 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:52:47,758 INFO L423 AbstractCegarLoop]: === Iteration 238 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:47,758 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:47,758 INFO L82 PathProgramCache]: Analyzing trace with hash 422086527, now seen corresponding path program 224 times [2018-10-04 09:52:47,758 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:47,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:47,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:47,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:52:47,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:47,828 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:47,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:47,829 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 238 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 238 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:47,836 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:52:47,842 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:52:47,842 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:47,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:47,887 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:47,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:47,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:47,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:47,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:47,909 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:47,910 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:52:48,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:48,277 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 09:52:48,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:48,277 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:48,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:48,278 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:52:48,278 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:52:48,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:48,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:52:48,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2018-10-04 09:52:48,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:48,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:48,496 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:48,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:48,497 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:48,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:48,497 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:48,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:48,497 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:48,497 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 09:52:48,497 INFO L423 AbstractCegarLoop]: === Iteration 239 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:48,497 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:48,497 INFO L82 PathProgramCache]: Analyzing trace with hash 422088449, now seen corresponding path program 225 times [2018-10-04 09:52:48,497 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:48,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:48,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:48,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:48,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:48,579 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:48,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:48,579 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 239 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 239 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:48,586 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:52:48,597 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 09:52:48,597 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:48,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:48,635 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:48,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:48,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:48,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:48,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:48,657 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:48,657 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:52:49,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:49,001 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 09:52:49,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:49,002 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:49,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:49,002 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:52:49,002 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:52:49,002 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:49,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:52:49,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 24. [2018-10-04 09:52:49,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:52:49,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 09:52:49,153 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 17 [2018-10-04 09:52:49,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:49,153 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 09:52:49,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:49,154 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 09:52:49,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:49,154 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:49,154 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:49,154 INFO L423 AbstractCegarLoop]: === Iteration 240 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:49,154 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:49,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1333761669, now seen corresponding path program 226 times [2018-10-04 09:52:49,154 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:49,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:49,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:49,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:49,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:49,228 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:49,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:49,229 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 240 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 240 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:49,239 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:52:49,245 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:52:49,245 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:49,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:49,274 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:49,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:49,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:49,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:49,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:49,296 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:49,296 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 10 states. [2018-10-04 09:52:49,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:49,661 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 09:52:49,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:49,662 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:49,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:49,662 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:52:49,662 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:52:49,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:49,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:52:49,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2018-10-04 09:52:49,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:49,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:49,891 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:49,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:49,892 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:49,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:49,892 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:49,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:49,892 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:49,892 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:49,892 INFO L423 AbstractCegarLoop]: === Iteration 241 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:49,892 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:49,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1333759747, now seen corresponding path program 227 times [2018-10-04 09:52:49,892 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:49,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:49,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:49,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:49,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:49,957 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:49,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:49,958 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 241 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 241 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:49,965 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:52:49,975 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 09:52:49,975 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:49,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:50,005 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:50,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:50,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:50,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:50,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:50,027 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:50,027 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:52:50,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:50,401 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 09:52:50,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:50,401 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:50,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:50,402 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:52:50,402 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:52:50,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:50,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:52:50,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2018-10-04 09:52:50,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:52:50,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:52:50,611 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:52:50,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:50,611 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:52:50,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:50,611 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:52:50,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:50,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:50,611 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:50,612 INFO L423 AbstractCegarLoop]: === Iteration 242 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:50,612 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:50,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1331914627, now seen corresponding path program 228 times [2018-10-04 09:52:50,612 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:50,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:50,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:50,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:50,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:50,670 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:50,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:50,671 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 242 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 242 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:50,679 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:52:50,689 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 09:52:50,689 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:50,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:50,737 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:50,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:50,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:50,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:50,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:50,757 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:50,757 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:52:51,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:51,112 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 09:52:51,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:51,113 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:51,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:51,113 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:52:51,113 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:52:51,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:51,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:52:51,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2018-10-04 09:52:51,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:51,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:51,330 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:51,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:51,330 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:51,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:51,330 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:51,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:51,330 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:51,330 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:52:51,331 INFO L423 AbstractCegarLoop]: === Iteration 243 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:51,331 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:51,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1331912705, now seen corresponding path program 229 times [2018-10-04 09:52:51,331 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:51,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:51,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:51,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:51,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:51,404 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:51,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:51,405 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 243 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 243 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:51,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:52:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:51,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:51,441 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:51,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:51,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:51,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:51,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:51,464 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:51,464 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:52:51,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:51,870 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 09:52:51,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:51,871 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:51,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:51,871 INFO L225 Difference]: With dead ends: 43 [2018-10-04 09:52:51,871 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 09:52:51,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:51,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 09:52:52,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2018-10-04 09:52:52,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:52:52,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:52:52,079 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 09:52:52,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:52,079 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:52:52,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:52,079 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:52:52,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:52,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:52,080 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:52,080 INFO L423 AbstractCegarLoop]: === Iteration 244 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:52,080 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:52,080 INFO L82 PathProgramCache]: Analyzing trace with hash 441245693, now seen corresponding path program 230 times [2018-10-04 09:52:52,080 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:52,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:52,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:52,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:52:52,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:52,145 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:52,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:52,146 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 244 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 244 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:52,153 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:52:52,161 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:52:52,162 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:52,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:52,191 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:52,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:52,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:52,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:52,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:52,213 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:52,213 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 09:52:52,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:52,587 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 09:52:52,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:52,587 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:52,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:52,588 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:52:52,588 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:52:52,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:52,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:52:52,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2018-10-04 09:52:52,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:52,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:52,807 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:52,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:52,807 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:52,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:52,807 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:52,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:52,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:52,807 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:52:52,807 INFO L423 AbstractCegarLoop]: === Iteration 245 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:52,808 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:52,808 INFO L82 PathProgramCache]: Analyzing trace with hash 441247615, now seen corresponding path program 231 times [2018-10-04 09:52:52,808 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:52,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:52,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:52,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:52,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:52,879 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:52,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:52,879 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 245 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 245 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:52,890 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:52:52,898 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 09:52:52,898 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:52,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:53,111 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:53,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:53,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:53,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:53,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:53,131 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:53,131 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:52:53,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:53,499 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 09:52:53,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:53,500 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:53,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:53,500 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:52:53,500 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:52:53,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 8 [2018-10-04 09:52:53,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:52:53,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2018-10-04 09:52:53,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:52:53,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:52:53,713 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:52:53,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:53,714 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:52:53,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:53,714 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:52:53,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:53,714 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:53,714 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:52:53,714 INFO L423 AbstractCegarLoop]: === Iteration 246 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:53,714 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:53,714 INFO L82 PathProgramCache]: Analyzing trace with hash 443092735, now seen corresponding path program 232 times [2018-10-04 09:52:53,714 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:53,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:53,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:53,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:53,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:53,792 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:53,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:53,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 246 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 246 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:53,804 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:52:53,810 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:52:53,810 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:53,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:53,843 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:53,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:53,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:53,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:53,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:53,865 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:53,865 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:52:54,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:54,227 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 09:52:54,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:54,228 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:54,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:54,228 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:52:54,228 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:52:54,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:54,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:52:54,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2018-10-04 09:52:54,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:54,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:54,448 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:54,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:54,449 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:54,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:54,449 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:54,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:54,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:54,449 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 09:52:54,449 INFO L423 AbstractCegarLoop]: === Iteration 247 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:54,449 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:54,449 INFO L82 PathProgramCache]: Analyzing trace with hash 443094657, now seen corresponding path program 233 times [2018-10-04 09:52:54,449 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:54,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:54,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:54,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:54,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:54,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:54,513 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:54,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:54,513 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 247 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 247 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:54,521 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:52:54,531 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 09:52:54,531 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:54,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:54,562 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:54,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:54,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:54,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:54,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:54,585 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:54,585 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:52:54,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:54,919 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 09:52:54,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:54,920 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:54,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:54,920 INFO L225 Difference]: With dead ends: 43 [2018-10-04 09:52:54,920 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 09:52:54,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:54,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 09:52:55,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2018-10-04 09:52:55,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:52:55,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:52:55,101 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 09:52:55,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:55,101 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:52:55,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:55,101 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:52:55,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:55,102 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:55,102 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 09:52:55,102 INFO L423 AbstractCegarLoop]: === Iteration 248 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:55,102 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:55,102 INFO L82 PathProgramCache]: Analyzing trace with hash -653703299, now seen corresponding path program 234 times [2018-10-04 09:52:55,102 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:55,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:55,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:55,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:55,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:55,158 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:55,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:55,159 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 248 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 248 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:55,168 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:52:55,177 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 09:52:55,177 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:55,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:55,212 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:55,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:55,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:55,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:55,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:55,234 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:55,234 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 09:52:55,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:55,572 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 09:52:55,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:55,573 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:55,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:55,573 INFO L225 Difference]: With dead ends: 43 [2018-10-04 09:52:55,573 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 09:52:55,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:55,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 09:52:55,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2018-10-04 09:52:55,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:55,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:55,803 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:55,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:55,803 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:55,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:55,803 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:55,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:55,803 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:55,803 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:52:55,803 INFO L423 AbstractCegarLoop]: === Iteration 249 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:55,804 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:55,804 INFO L82 PathProgramCache]: Analyzing trace with hash -653701377, now seen corresponding path program 235 times [2018-10-04 09:52:55,804 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:55,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:55,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:55,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:55,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:55,860 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:55,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:55,860 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 249 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 249 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:55,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:52:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:55,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:55,912 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:55,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:55,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:55,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:55,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:55,934 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:55,934 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:52:56,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:56,258 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 09:52:56,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:56,259 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:56,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:56,259 INFO L225 Difference]: With dead ends: 41 [2018-10-04 09:52:56,259 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:52:56,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:56,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:52:56,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2018-10-04 09:52:56,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:52:56,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:52:56,491 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:52:56,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:56,491 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:52:56,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:56,491 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:52:56,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:56,491 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:56,491 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:52:56,491 INFO L423 AbstractCegarLoop]: === Iteration 250 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:56,492 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:56,492 INFO L82 PathProgramCache]: Analyzing trace with hash -651856257, now seen corresponding path program 236 times [2018-10-04 09:52:56,492 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:56,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:56,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:56,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:52:56,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:56,571 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:56,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:56,572 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 250 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 250 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:56,580 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:52:56,585 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:52:56,585 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:56,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:56,628 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:56,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:56,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:56,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:56,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:56,649 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:56,649 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:52:56,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:56,992 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 09:52:56,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:56,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:56,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:56,993 INFO L225 Difference]: With dead ends: 43 [2018-10-04 09:52:56,993 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 09:52:56,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:56,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 09:52:57,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2018-10-04 09:52:57,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:57,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:57,220 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:57,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:57,220 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:57,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:57,220 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:57,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:57,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:57,220 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 09:52:57,221 INFO L423 AbstractCegarLoop]: === Iteration 251 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:57,221 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:57,221 INFO L82 PathProgramCache]: Analyzing trace with hash -651854335, now seen corresponding path program 237 times [2018-10-04 09:52:57,221 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:57,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:57,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:57,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:57,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:57,287 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:57,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:57,287 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 251 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 251 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:57,295 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:52:57,303 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 09:52:57,303 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:57,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:57,349 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:57,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:57,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:57,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:57,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:57,371 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:57,371 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:52:57,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:57,698 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 09:52:57,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:57,699 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:57,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:57,699 INFO L225 Difference]: With dead ends: 41 [2018-10-04 09:52:57,699 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:52:57,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:57,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:52:57,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2018-10-04 09:52:57,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:52:57,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:52:57,903 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 09:52:57,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:57,903 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:52:57,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:57,903 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:52:57,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:57,903 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:57,903 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 09:52:57,903 INFO L423 AbstractCegarLoop]: === Iteration 252 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:57,903 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:57,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1121304063, now seen corresponding path program 238 times [2018-10-04 09:52:57,904 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:57,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:57,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:57,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:57,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:57,958 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:57,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:57,959 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 252 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 252 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:57,966 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:52:57,974 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:52:57,974 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:57,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:58,003 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:58,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:58,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:58,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:58,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:58,025 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:58,025 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 09:52:58,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:58,328 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 09:52:58,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:58,329 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:58,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:58,329 INFO L225 Difference]: With dead ends: 39 [2018-10-04 09:52:58,329 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 09:52:58,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:58,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 09:52:58,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2018-10-04 09:52:58,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:58,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:58,568 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:58,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:58,568 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:58,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:58,568 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:58,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:58,569 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:58,569 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 09:52:58,569 INFO L423 AbstractCegarLoop]: === Iteration 253 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:58,569 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:58,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1121305985, now seen corresponding path program 239 times [2018-10-04 09:52:58,569 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:58,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:58,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:58,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:58,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:58,691 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:58,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:58,691 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 253 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 253 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:58,698 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:52:58,708 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 09:52:58,708 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:58,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:58,762 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:58,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:58,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:58,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:58,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:58,782 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:58,782 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:52:59,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:59,091 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 09:52:59,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:59,092 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:59,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:59,092 INFO L225 Difference]: With dead ends: 39 [2018-10-04 09:52:59,092 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 09:52:59,092 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 09:52:59,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 09:52:59,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2018-10-04 09:52:59,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:52:59,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:52:59,316 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 09:52:59,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:59,317 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:52:59,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:59,317 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:52:59,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:59,317 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:59,317 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 09:52:59,317 INFO L423 AbstractCegarLoop]: === Iteration 254 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:59,317 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:59,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1123151105, now seen corresponding path program 240 times [2018-10-04 09:52:59,317 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:59,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:59,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:59,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:59,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:52:59,377 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:59,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:52:59,378 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 254 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 254 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:52:59,386 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:52:59,396 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 09:52:59,396 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:52:59,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:52:59,427 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:52:59,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:52:59,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:52:59,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:52:59,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:52:59,448 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:52:59,449 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 09:52:59,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:52:59,743 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 09:52:59,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:52:59,743 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:52:59,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:52:59,744 INFO L225 Difference]: With dead ends: 37 [2018-10-04 09:52:59,744 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 09:52:59,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 8 [2018-10-04 09:52:59,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 09:52:59,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-10-04 09:52:59,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:52:59,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:52:59,973 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 09:52:59,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:52:59,973 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:52:59,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:52:59,973 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:52:59,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:52:59,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:52:59,973 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1] [2018-10-04 09:52:59,974 INFO L423 AbstractCegarLoop]: === Iteration 255 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:52:59,974 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:52:59,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1123153027, now seen corresponding path program 7 times [2018-10-04 09:52:59,974 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:52:59,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:52:59,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:59,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:52:59,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:52:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:00,619 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:00,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:00,620 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 255 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 255 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:00,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:00,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:00,655 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:00,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:00,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:53:00,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:53:00,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:53:00,675 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:00,675 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 09:53:00,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:00,962 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2018-10-04 09:53:00,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:53:00,963 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 09:53:00,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:00,963 INFO L225 Difference]: With dead ends: 36 [2018-10-04 09:53:00,963 INFO L226 Difference]: Without dead ends: 34 [2018-10-04 09:53:00,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 8 [2018-10-04 09:53:00,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-04 09:53:01,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-10-04 09:53:01,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 09:53:01,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 09:53:01,107 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 17 [2018-10-04 09:53:01,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:01,107 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 09:53:01,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:53:01,107 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 09:53:01,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:01,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:01,107 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1] [2018-10-04 09:53:01,108 INFO L423 AbstractCegarLoop]: === Iteration 256 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:01,108 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:01,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1610002744, now seen corresponding path program 8 times [2018-10-04 09:53:01,108 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:01,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:01,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:01,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:01,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:01,177 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:01,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:01,178 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 256 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 256 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:01,189 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:53:01,195 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:53:01,195 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:01,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:01,235 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:01,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:01,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:01,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:01,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:01,257 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:01,257 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 11 states. [2018-10-04 09:53:01,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:01,830 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 09:53:01,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:01,831 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:01,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:01,832 INFO L225 Difference]: With dead ends: 61 [2018-10-04 09:53:01,832 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 09:53:01,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:01,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 09:53:02,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 09:53:02,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:53:02,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:53:02,110 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:53:02,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:02,110 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:53:02,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:02,110 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:53:02,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:02,111 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:02,111 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2018-10-04 09:53:02,111 INFO L423 AbstractCegarLoop]: === Iteration 257 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:02,111 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:02,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1610004666, now seen corresponding path program 241 times [2018-10-04 09:53:02,111 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:02,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:02,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:02,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:02,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:02,199 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:02,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:02,200 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 257 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 257 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:02,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:02,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:02,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:02,260 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:02,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:02,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:02,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:02,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:02,283 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:02,283 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:53:02,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:02,868 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 09:53:02,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:02,869 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:02,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:02,869 INFO L225 Difference]: With dead ends: 61 [2018-10-04 09:53:02,869 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 09:53:02,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:02,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 09:53:03,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 09:53:03,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:53:03,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:53:03,133 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 09:53:03,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:03,133 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:53:03,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:03,133 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:53:03,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:03,133 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:03,133 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2018-10-04 09:53:03,134 INFO L423 AbstractCegarLoop]: === Iteration 258 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:03,134 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:03,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1611849786, now seen corresponding path program 242 times [2018-10-04 09:53:03,134 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:03,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:03,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:03,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:03,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:03,208 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:03,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:03,208 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 258 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 258 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:03,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:53:03,224 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:53:03,224 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:03,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:03,271 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:03,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:03,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:03,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:03,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:03,293 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:03,293 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 09:53:03,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:03,843 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 09:53:03,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:03,844 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:03,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:03,844 INFO L225 Difference]: With dead ends: 59 [2018-10-04 09:53:03,844 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 09:53:03,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:03,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 09:53:04,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 09:53:04,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:53:04,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:53:04,115 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:53:04,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:04,115 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:53:04,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:04,115 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:53:04,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:04,115 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:04,116 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 09:53:04,116 INFO L423 AbstractCegarLoop]: === Iteration 259 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:04,116 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:04,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1611851708, now seen corresponding path program 243 times [2018-10-04 09:53:04,116 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:04,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:04,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:04,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:04,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:04,184 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:04,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:04,184 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 259 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 259 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:04,193 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:53:04,204 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 09:53:04,204 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:04,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:04,248 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:04,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:04,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:04,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:04,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:04,269 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:04,269 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:53:04,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:04,808 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 09:53:04,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:04,809 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:04,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:04,809 INFO L225 Difference]: With dead ends: 57 [2018-10-04 09:53:04,809 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 09:53:04,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:04,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 09:53:05,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2018-10-04 09:53:05,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:53:05,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:53:05,064 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 09:53:05,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:05,065 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:53:05,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:05,065 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:53:05,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:05,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:05,065 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2018-10-04 09:53:05,065 INFO L423 AbstractCegarLoop]: === Iteration 260 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:05,065 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:05,065 INFO L82 PathProgramCache]: Analyzing trace with hash -909957190, now seen corresponding path program 244 times [2018-10-04 09:53:05,065 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:05,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:05,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:05,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:05,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:05,142 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:05,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:05,143 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 260 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 260 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:05,150 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:53:05,157 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:53:05,157 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:05,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:05,190 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:05,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:05,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:05,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:05,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:05,211 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:05,211 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 09:53:05,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:05,795 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 09:53:05,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:05,796 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:05,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:05,796 INFO L225 Difference]: With dead ends: 61 [2018-10-04 09:53:05,796 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 09:53:05,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:05,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 09:53:06,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 09:53:06,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:53:06,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:53:06,073 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:53:06,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:06,074 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:53:06,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:06,074 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:53:06,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:06,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:06,074 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 09:53:06,074 INFO L423 AbstractCegarLoop]: === Iteration 261 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:06,074 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:06,074 INFO L82 PathProgramCache]: Analyzing trace with hash -909955268, now seen corresponding path program 245 times [2018-10-04 09:53:06,074 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:06,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:06,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:06,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:06,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:06,144 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:06,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:06,145 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 261 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 261 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:06,156 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:53:06,166 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 09:53:06,166 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:06,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:06,214 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:06,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:06,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:06,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:06,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:06,236 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:06,236 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:53:06,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:06,818 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 09:53:06,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:06,818 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:06,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:06,819 INFO L225 Difference]: With dead ends: 61 [2018-10-04 09:53:06,819 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 09:53:06,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:06,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 09:53:07,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 09:53:07,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:53:07,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:53:07,088 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 09:53:07,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:07,088 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:53:07,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:07,088 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:53:07,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:07,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:07,089 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 09:53:07,089 INFO L423 AbstractCegarLoop]: === Iteration 262 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:07,089 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:07,089 INFO L82 PathProgramCache]: Analyzing trace with hash -908110148, now seen corresponding path program 246 times [2018-10-04 09:53:07,089 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:07,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:07,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:07,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:07,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:07,186 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:07,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:07,186 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 262 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 262 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:07,194 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:53:07,202 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 09:53:07,202 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:07,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:07,231 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:07,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:07,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:07,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:07,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:07,252 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:07,252 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 09:53:07,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:07,809 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 09:53:07,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:07,810 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:07,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:07,810 INFO L225 Difference]: With dead ends: 59 [2018-10-04 09:53:07,810 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 09:53:07,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:07,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 09:53:08,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 09:53:08,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:53:08,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:53:08,086 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:53:08,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:08,086 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:53:08,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:08,086 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:53:08,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:08,086 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:08,086 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:53:08,087 INFO L423 AbstractCegarLoop]: === Iteration 263 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:08,087 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:08,087 INFO L82 PathProgramCache]: Analyzing trace with hash -908108226, now seen corresponding path program 247 times [2018-10-04 09:53:08,087 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:08,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:08,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:08,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:08,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:08,159 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:08,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:08,160 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 263 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 263 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:08,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:08,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:08,224 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:08,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:08,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:08,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:08,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:08,246 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:08,247 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:53:08,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:08,785 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 09:53:08,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:08,785 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:08,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:08,786 INFO L225 Difference]: With dead ends: 57 [2018-10-04 09:53:08,786 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 09:53:08,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:08,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 09:53:09,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2018-10-04 09:53:09,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:53:09,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:53:09,021 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 19 [2018-10-04 09:53:09,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:09,021 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:53:09,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:09,022 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:53:09,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:09,022 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:09,022 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2018-10-04 09:53:09,022 INFO L423 AbstractCegarLoop]: === Iteration 264 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:09,022 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:09,022 INFO L82 PathProgramCache]: Analyzing trace with hash -2004906182, now seen corresponding path program 248 times [2018-10-04 09:53:09,022 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:09,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:09,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:09,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:09,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:09,145 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:09,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:09,145 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 264 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 264 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:09,155 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:53:09,162 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:53:09,162 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:09,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:09,197 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:09,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:09,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:09,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:09,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:09,218 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:09,219 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 11 states. [2018-10-04 09:53:09,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:09,756 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 09:53:09,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:09,756 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:09,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:09,757 INFO L225 Difference]: With dead ends: 57 [2018-10-04 09:53:09,757 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 09:53:09,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:09,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 09:53:10,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 09:53:10,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:53:10,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:53:10,042 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:53:10,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:10,042 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:53:10,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:10,042 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:53:10,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:10,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:10,042 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 09:53:10,042 INFO L423 AbstractCegarLoop]: === Iteration 265 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:10,042 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:10,042 INFO L82 PathProgramCache]: Analyzing trace with hash -2004904260, now seen corresponding path program 249 times [2018-10-04 09:53:10,042 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:10,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:10,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:10,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:10,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:10,125 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:10,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:10,126 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 265 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 265 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:10,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:53:10,144 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 09:53:10,144 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:10,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:10,224 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:10,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:10,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:10,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:10,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:10,245 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:10,245 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:53:10,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:10,766 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 09:53:10,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:10,767 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:10,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:10,767 INFO L225 Difference]: With dead ends: 55 [2018-10-04 09:53:10,767 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 09:53:10,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:10,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 09:53:11,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 09:53:11,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:53:11,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:53:11,037 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 09:53:11,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:11,037 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:53:11,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:11,037 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:53:11,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:11,037 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:11,037 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 09:53:11,037 INFO L423 AbstractCegarLoop]: === Iteration 266 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:11,038 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:11,038 INFO L82 PathProgramCache]: Analyzing trace with hash -2003059140, now seen corresponding path program 250 times [2018-10-04 09:53:11,038 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:11,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:11,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:11,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:11,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:11,115 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:11,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:11,116 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 266 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 266 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:11,123 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:53:11,130 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:53:11,130 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:11,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:11,167 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:11,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:11,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:11,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:11,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:11,188 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:11,188 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 09:53:11,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:11,725 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 09:53:11,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:11,725 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:11,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:11,726 INFO L225 Difference]: With dead ends: 57 [2018-10-04 09:53:11,726 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 09:53:11,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:11,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 09:53:12,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 09:53:12,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:53:12,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:53:12,002 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:53:12,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:12,002 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:53:12,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:12,002 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:53:12,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:12,002 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:12,002 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:53:12,003 INFO L423 AbstractCegarLoop]: === Iteration 267 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:12,003 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:12,003 INFO L82 PathProgramCache]: Analyzing trace with hash -2003057218, now seen corresponding path program 251 times [2018-10-04 09:53:12,003 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:12,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:12,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:12,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:12,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:12,107 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:12,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:12,107 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 267 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 267 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:12,116 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:53:12,125 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 09:53:12,125 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:12,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:12,155 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:12,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:12,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:12,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:12,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:12,176 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:12,176 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:53:12,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:12,697 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 09:53:12,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:12,698 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:12,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:12,698 INFO L225 Difference]: With dead ends: 55 [2018-10-04 09:53:12,698 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 09:53:12,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:12,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 09:53:12,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 30. [2018-10-04 09:53:12,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:53:12,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:53:12,963 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 09:53:12,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:12,964 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:53:12,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:12,964 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:53:12,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:12,964 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:12,964 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 09:53:12,964 INFO L423 AbstractCegarLoop]: === Iteration 268 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:12,964 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:12,964 INFO L82 PathProgramCache]: Analyzing trace with hash -229898820, now seen corresponding path program 252 times [2018-10-04 09:53:12,964 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:12,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:12,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:12,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:12,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:13,032 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:13,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:13,032 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 268 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 268 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:13,040 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:53:13,054 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 09:53:13,054 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:13,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:13,100 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:13,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:13,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:13,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:13,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:13,123 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:13,123 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 09:53:13,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:13,625 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 09:53:13,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:13,625 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:13,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:13,626 INFO L225 Difference]: With dead ends: 53 [2018-10-04 09:53:13,626 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 09:53:13,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:13,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 09:53:13,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2018-10-04 09:53:13,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:53:13,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:53:13,918 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:53:13,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:13,918 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:53:13,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:13,919 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:53:13,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:13,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:13,919 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:53:13,919 INFO L423 AbstractCegarLoop]: === Iteration 269 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:13,919 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:13,919 INFO L82 PathProgramCache]: Analyzing trace with hash -229896898, now seen corresponding path program 253 times [2018-10-04 09:53:13,919 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:13,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:13,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:13,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:13,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:14,046 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:14,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:14,047 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 269 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 269 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:14,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:14,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:14,114 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:14,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:14,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:14,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:14,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:14,134 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:14,134 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:53:14,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:14,615 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 09:53:14,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:14,615 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:14,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:14,616 INFO L225 Difference]: With dead ends: 53 [2018-10-04 09:53:14,616 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 09:53:14,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:14,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 09:53:14,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 09:53:14,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:53:14,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:53:14,889 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 09:53:14,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:14,889 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:53:14,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:14,889 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:53:14,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:14,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:14,889 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:53:14,889 INFO L423 AbstractCegarLoop]: === Iteration 270 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:14,890 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:14,890 INFO L82 PathProgramCache]: Analyzing trace with hash -228051778, now seen corresponding path program 254 times [2018-10-04 09:53:14,890 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:14,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:14,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:14,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:14,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:14,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:14,963 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 270 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 270 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:14,971 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:53:14,976 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:53:14,977 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:14,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:15,020 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:15,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:15,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:15,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:15,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:15,042 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:15,042 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 09:53:15,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:15,522 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 09:53:15,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:15,522 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:15,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:15,523 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:53:15,523 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 09:53:15,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:15,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 09:53:15,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 09:53:15,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:53:15,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:53:15,805 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:53:15,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:15,806 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:53:15,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:15,806 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:53:15,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:15,806 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:15,806 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:53:15,806 INFO L423 AbstractCegarLoop]: === Iteration 271 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:15,806 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:15,806 INFO L82 PathProgramCache]: Analyzing trace with hash -228049856, now seen corresponding path program 255 times [2018-10-04 09:53:15,806 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:15,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:15,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:15,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:15,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:16,302 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:16,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:16,303 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 271 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 271 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:16,309 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:53:16,319 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 09:53:16,320 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:16,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:16,352 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:16,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:16,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:16,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:16,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:16,374 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:16,374 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:53:16,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:16,844 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:53:16,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:16,844 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:16,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:16,845 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:53:16,845 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:53:16,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 9 [2018-10-04 09:53:16,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:53:17,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2018-10-04 09:53:17,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:53:17,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:53:17,171 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 19 [2018-10-04 09:53:17,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:17,171 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:53:17,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:17,171 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:53:17,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:17,171 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:17,171 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2018-10-04 09:53:17,171 INFO L423 AbstractCegarLoop]: === Iteration 272 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:17,171 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:17,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1983899974, now seen corresponding path program 256 times [2018-10-04 09:53:17,171 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:17,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:17,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:17,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:17,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:17,271 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:17,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:17,272 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 272 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 272 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:17,279 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:53:17,286 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:53:17,287 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:17,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:17,310 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:17,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:17,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:17,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:17,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:17,332 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:17,332 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 11 states. [2018-10-04 09:53:17,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:17,933 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 09:53:17,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:17,933 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:17,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:17,934 INFO L225 Difference]: With dead ends: 61 [2018-10-04 09:53:17,934 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 09:53:17,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:17,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 09:53:18,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 09:53:18,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:53:18,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:53:18,218 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:53:18,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:18,218 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:53:18,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:18,218 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:53:18,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:18,218 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:18,218 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 09:53:18,218 INFO L423 AbstractCegarLoop]: === Iteration 273 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:18,218 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:18,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1983898052, now seen corresponding path program 257 times [2018-10-04 09:53:18,219 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:18,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:18,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:18,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:18,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:18,281 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:18,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:18,282 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 273 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 273 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:18,289 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:53:18,299 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 09:53:18,299 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:18,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:18,335 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:18,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:18,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:18,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:18,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:18,356 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:18,356 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:53:18,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:18,958 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 09:53:18,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:18,958 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:18,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:18,959 INFO L225 Difference]: With dead ends: 61 [2018-10-04 09:53:18,959 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 09:53:18,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:53:18,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 09:53:19,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 09:53:19,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:53:19,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:53:19,234 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 09:53:19,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:19,234 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:53:19,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:19,234 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:53:19,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:19,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:19,235 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 09:53:19,235 INFO L423 AbstractCegarLoop]: === Iteration 274 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:19,235 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:19,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1982052932, now seen corresponding path program 258 times [2018-10-04 09:53:19,235 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:19,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:19,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:19,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:19,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:19,314 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:19,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:19,314 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 274 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 274 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:19,322 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:53:19,332 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 09:53:19,333 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:19,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:19,364 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:19,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:19,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:19,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:19,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:19,386 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:19,386 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 09:53:19,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:19,961 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 09:53:19,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:19,961 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:19,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:19,962 INFO L225 Difference]: With dead ends: 59 [2018-10-04 09:53:19,962 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 09:53:19,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:19,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 09:53:20,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 09:53:20,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:53:20,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:53:20,246 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:53:20,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:20,246 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:53:20,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:20,247 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:53:20,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:20,247 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:20,247 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:53:20,247 INFO L423 AbstractCegarLoop]: === Iteration 275 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:20,247 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:20,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1982051010, now seen corresponding path program 259 times [2018-10-04 09:53:20,247 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:20,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:20,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:20,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:20,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:20,322 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:20,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:20,323 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 275 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 275 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:20,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:20,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:20,383 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:20,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:20,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:20,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:20,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:20,405 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:20,405 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:53:20,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:20,960 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 09:53:20,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:20,961 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:20,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:20,961 INFO L225 Difference]: With dead ends: 57 [2018-10-04 09:53:20,961 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 09:53:20,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:20,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 09:53:21,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2018-10-04 09:53:21,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:53:21,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:53:21,226 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 09:53:21,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:21,227 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:53:21,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:21,227 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:53:21,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:21,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:21,227 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 09:53:21,227 INFO L423 AbstractCegarLoop]: === Iteration 276 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:21,227 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:21,227 INFO L82 PathProgramCache]: Analyzing trace with hash -208892612, now seen corresponding path program 260 times [2018-10-04 09:53:21,227 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:21,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:21,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:21,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:21,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:21,306 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:21,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:21,307 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 276 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 276 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:21,314 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:53:21,322 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:53:21,322 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:21,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:21,355 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:21,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:21,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:21,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:21,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:21,377 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:21,377 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 09:53:21,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:21,973 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 09:53:21,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:21,974 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:21,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:21,974 INFO L225 Difference]: With dead ends: 61 [2018-10-04 09:53:21,974 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 09:53:21,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:21,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 09:53:22,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 09:53:22,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:53:22,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:53:22,257 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:53:22,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:22,257 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:53:22,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:22,257 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:53:22,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:22,257 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:22,257 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:53:22,257 INFO L423 AbstractCegarLoop]: === Iteration 277 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:22,258 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:22,258 INFO L82 PathProgramCache]: Analyzing trace with hash -208890690, now seen corresponding path program 261 times [2018-10-04 09:53:22,258 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:22,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:22,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:22,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:22,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:22,327 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:22,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:22,327 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 277 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 277 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:22,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:53:22,347 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 09:53:22,347 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:22,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:22,379 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:22,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:22,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:22,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:22,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:22,401 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:22,401 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:53:23,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:23,024 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 09:53:23,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:23,024 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:23,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:23,025 INFO L225 Difference]: With dead ends: 61 [2018-10-04 09:53:23,025 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 09:53:23,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:53:23,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 09:53:23,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 09:53:23,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:53:23,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:53:23,301 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 09:53:23,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:23,301 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:53:23,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:23,301 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:53:23,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:23,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:23,301 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:53:23,301 INFO L423 AbstractCegarLoop]: === Iteration 278 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:23,301 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:23,301 INFO L82 PathProgramCache]: Analyzing trace with hash -207045570, now seen corresponding path program 262 times [2018-10-04 09:53:23,302 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:23,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:23,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:23,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:23,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:23,368 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:23,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:23,369 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 278 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 278 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:23,377 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:53:23,382 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:53:23,382 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:23,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:23,431 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:23,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:23,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:23,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:23,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:23,452 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:23,452 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 09:53:24,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:24,039 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 09:53:24,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:24,039 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:24,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:24,040 INFO L225 Difference]: With dead ends: 59 [2018-10-04 09:53:24,040 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 09:53:24,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:24,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 09:53:24,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 09:53:24,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:53:24,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:53:24,323 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:53:24,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:24,323 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:53:24,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:24,323 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:53:24,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:24,323 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:24,323 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:53:24,324 INFO L423 AbstractCegarLoop]: === Iteration 279 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:24,324 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:24,324 INFO L82 PathProgramCache]: Analyzing trace with hash -207043648, now seen corresponding path program 263 times [2018-10-04 09:53:24,324 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:24,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:24,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:24,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:24,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:24,430 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:24,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:24,431 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 279 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 279 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:24,437 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:53:24,447 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 09:53:24,447 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:24,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:24,490 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:24,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:24,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:24,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:24,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:24,511 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:24,511 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:53:25,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:25,078 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 09:53:25,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:25,079 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:25,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:25,079 INFO L225 Difference]: With dead ends: 57 [2018-10-04 09:53:25,079 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 09:53:25,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:25,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 09:53:25,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2018-10-04 09:53:25,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:53:25,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:53:25,334 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 19 [2018-10-04 09:53:25,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:25,334 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:53:25,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:25,334 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:53:25,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:25,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:25,334 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 09:53:25,335 INFO L423 AbstractCegarLoop]: === Iteration 280 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:25,335 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:25,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1303841604, now seen corresponding path program 264 times [2018-10-04 09:53:25,335 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:25,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:25,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:25,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:25,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:25,396 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:25,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:25,396 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 280 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 280 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:25,404 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:53:25,414 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 09:53:25,415 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:25,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:25,463 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:25,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:25,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:25,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:25,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:25,485 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:25,485 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 11 states. [2018-10-04 09:53:26,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:26,031 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 09:53:26,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:26,032 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:26,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:26,032 INFO L225 Difference]: With dead ends: 57 [2018-10-04 09:53:26,032 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 09:53:26,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:26,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 09:53:26,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 09:53:26,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:53:26,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:53:26,319 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:53:26,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:26,319 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:53:26,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:26,319 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:53:26,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:26,319 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:26,319 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:53:26,319 INFO L423 AbstractCegarLoop]: === Iteration 281 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:26,320 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:26,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1303839682, now seen corresponding path program 265 times [2018-10-04 09:53:26,320 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:26,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:26,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:26,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:26,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:26,652 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:26,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:26,653 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 281 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 281 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:26,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:26,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:26,702 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:26,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:26,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:26,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:26,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:26,722 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:26,722 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:53:27,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:27,264 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 09:53:27,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:27,264 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:27,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:27,265 INFO L225 Difference]: With dead ends: 55 [2018-10-04 09:53:27,265 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 09:53:27,265 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 9 [2018-10-04 09:53:27,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 09:53:27,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 09:53:27,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:53:27,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:53:27,546 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 09:53:27,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:27,546 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:53:27,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:27,546 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:53:27,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:27,547 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:27,547 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:53:27,547 INFO L423 AbstractCegarLoop]: === Iteration 282 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:27,547 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:27,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1301994562, now seen corresponding path program 266 times [2018-10-04 09:53:27,547 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:27,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:27,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:27,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:27,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:27,614 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:27,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:27,615 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 282 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 282 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:27,623 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:53:27,629 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:53:27,629 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:27,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:27,663 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:27,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:27,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:27,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:27,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:27,685 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:27,685 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 09:53:28,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:28,245 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 09:53:28,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:28,245 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:28,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:28,246 INFO L225 Difference]: With dead ends: 57 [2018-10-04 09:53:28,246 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 09:53:28,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:53:28,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 09:53:28,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 09:53:28,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:53:28,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:53:28,534 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:53:28,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:28,534 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:53:28,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:28,534 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:53:28,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:28,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:28,534 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:53:28,534 INFO L423 AbstractCegarLoop]: === Iteration 283 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:28,534 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:28,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1301992640, now seen corresponding path program 267 times [2018-10-04 09:53:28,535 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:28,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:28,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:28,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:28,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:28,594 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:28,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:28,595 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 283 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 283 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:28,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:53:28,613 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 09:53:28,614 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:28,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:28,883 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:28,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:28,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:28,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:28,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:28,904 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:28,904 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:53:29,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:29,443 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 09:53:29,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:29,443 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:29,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:29,444 INFO L225 Difference]: With dead ends: 55 [2018-10-04 09:53:29,444 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 09:53:29,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.0s impTime 9 [2018-10-04 09:53:29,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 09:53:29,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 30. [2018-10-04 09:53:29,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:53:29,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:53:29,716 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 09:53:29,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:29,716 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:53:29,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:29,716 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:53:29,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:29,716 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:29,717 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:53:29,717 INFO L423 AbstractCegarLoop]: === Iteration 284 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:29,717 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:29,717 INFO L82 PathProgramCache]: Analyzing trace with hash 471165758, now seen corresponding path program 268 times [2018-10-04 09:53:29,717 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:29,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:29,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:29,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:29,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:29,794 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:29,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:29,795 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 284 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 284 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:29,802 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:53:29,807 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:53:29,808 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:29,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:29,853 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:29,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:29,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:29,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:29,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:29,873 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:29,873 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 09:53:30,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:30,375 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 09:53:30,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:30,375 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:30,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:30,376 INFO L225 Difference]: With dead ends: 53 [2018-10-04 09:53:30,376 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 09:53:30,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:30,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 09:53:30,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2018-10-04 09:53:30,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:53:30,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:53:30,670 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:53:30,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:30,671 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:53:30,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:30,671 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:53:30,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:30,671 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:30,671 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:53:30,671 INFO L423 AbstractCegarLoop]: === Iteration 285 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:30,671 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:30,671 INFO L82 PathProgramCache]: Analyzing trace with hash 471167680, now seen corresponding path program 269 times [2018-10-04 09:53:30,671 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:30,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:30,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:30,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:30,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:30,746 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:30,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:30,746 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 285 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 285 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:30,756 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:53:30,766 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 09:53:30,766 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:30,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:30,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:30,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:30,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:30,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:30,830 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:30,830 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:53:31,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:31,351 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 09:53:31,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:31,352 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:31,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:31,352 INFO L225 Difference]: With dead ends: 53 [2018-10-04 09:53:31,352 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 09:53:31,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:31,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 09:53:31,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 09:53:31,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:53:31,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:53:31,635 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 09:53:31,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:31,635 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:53:31,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:31,636 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:53:31,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:31,636 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:31,636 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:53:31,636 INFO L423 AbstractCegarLoop]: === Iteration 286 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:31,636 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:31,636 INFO L82 PathProgramCache]: Analyzing trace with hash 473012800, now seen corresponding path program 270 times [2018-10-04 09:53:31,636 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:31,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:31,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:31,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:31,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:31,706 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:31,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:31,706 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 286 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 286 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:31,713 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:53:31,724 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 09:53:31,725 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:31,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:31,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:31,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:31,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:31,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:31,783 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:31,783 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 09:53:32,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:32,281 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 09:53:32,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:32,281 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:32,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:32,282 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:53:32,282 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 09:53:32,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:32,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 09:53:32,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 09:53:32,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:53:32,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:53:32,572 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:53:32,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:32,572 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:53:32,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:32,573 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:53:32,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:32,573 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:32,573 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:53:32,573 INFO L423 AbstractCegarLoop]: === Iteration 287 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:32,573 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:32,573 INFO L82 PathProgramCache]: Analyzing trace with hash 473014722, now seen corresponding path program 271 times [2018-10-04 09:53:32,573 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:32,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:32,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:32,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:32,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:32,652 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:32,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:32,652 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 287 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 287 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:32,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:32,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:32,696 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:32,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:32,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:32,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:32,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:32,718 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:32,718 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:53:33,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:33,196 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:53:33,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:33,197 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:33,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:33,197 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:53:33,197 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:53:33,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:53:33,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:53:33,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 24. [2018-10-04 09:53:33,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:53:33,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 09:53:33,394 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 19 [2018-10-04 09:53:33,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:33,394 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 09:53:33,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:33,394 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 09:53:33,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:33,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:33,395 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2018-10-04 09:53:33,395 INFO L423 AbstractCegarLoop]: === Iteration 288 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:33,395 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:33,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1023196730, now seen corresponding path program 272 times [2018-10-04 09:53:33,395 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:33,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:33,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:33,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:33,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:33,463 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:33,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:33,463 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 288 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 288 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:33,470 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:53:33,475 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:53:33,475 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:33,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:33,510 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:33,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:33,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:33,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:33,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:33,532 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:33,532 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 11 states. [2018-10-04 09:53:34,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:34,104 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 09:53:34,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:34,104 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:34,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:34,105 INFO L225 Difference]: With dead ends: 55 [2018-10-04 09:53:34,105 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 09:53:34,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:53:34,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 09:53:34,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 09:53:34,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:53:34,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:53:34,421 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:53:34,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:34,421 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:53:34,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:34,422 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:53:34,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:34,422 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:34,422 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 09:53:34,422 INFO L423 AbstractCegarLoop]: === Iteration 289 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:34,422 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:34,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1023198652, now seen corresponding path program 273 times [2018-10-04 09:53:34,422 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:34,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:34,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:34,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:34,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:34,536 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:34,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:34,537 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 289 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 289 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:34,543 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:53:34,556 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 09:53:34,556 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:34,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:34,606 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:34,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:34,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:34,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:34,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:34,625 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:34,626 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:53:35,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:35,198 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 09:53:35,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:35,198 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:35,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:35,199 INFO L225 Difference]: With dead ends: 53 [2018-10-04 09:53:35,199 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 09:53:35,199 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:35,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 09:53:35,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 09:53:35,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:53:35,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:53:35,503 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 09:53:35,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:35,503 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:53:35,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:35,503 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:53:35,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:35,504 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:35,504 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 09:53:35,504 INFO L423 AbstractCegarLoop]: === Iteration 290 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:35,504 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:35,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1025043772, now seen corresponding path program 274 times [2018-10-04 09:53:35,504 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:35,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:35,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:35,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:35,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:35,582 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:35,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:35,582 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 290 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 290 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:35,590 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:53:35,597 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:53:35,597 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:35,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:35,771 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:35,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:35,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:35,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:35,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:35,792 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:35,792 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 09:53:36,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:36,358 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 09:53:36,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:36,358 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:36,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:36,359 INFO L225 Difference]: With dead ends: 55 [2018-10-04 09:53:36,359 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 09:53:36,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 9 [2018-10-04 09:53:36,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 09:53:36,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 09:53:36,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:53:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:53:36,669 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:53:36,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:36,669 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:53:36,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:36,669 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:53:36,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:36,669 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:36,670 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:53:36,670 INFO L423 AbstractCegarLoop]: === Iteration 291 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:36,670 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:36,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1025045694, now seen corresponding path program 275 times [2018-10-04 09:53:36,670 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:36,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:36,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:36,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:36,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:36,745 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:36,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:36,746 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 291 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 291 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:36,754 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:53:36,764 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 09:53:36,764 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:36,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:36,813 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:36,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:36,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:36,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:36,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:36,834 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:36,834 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:53:37,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:37,378 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 09:53:37,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:37,379 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:37,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:37,379 INFO L225 Difference]: With dead ends: 53 [2018-10-04 09:53:37,379 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 09:53:37,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:37,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 09:53:37,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2018-10-04 09:53:37,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:53:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:53:37,663 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 09:53:37,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:37,664 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:53:37,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:37,664 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:53:37,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:37,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:37,664 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 09:53:37,664 INFO L423 AbstractCegarLoop]: === Iteration 292 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:37,664 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:37,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1496763204, now seen corresponding path program 276 times [2018-10-04 09:53:37,664 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:37,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:37,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:37,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:37,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:37,740 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:37,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:37,740 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 292 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 292 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:37,748 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:53:37,758 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 09:53:37,758 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:37,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:37,809 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:37,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:37,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:37,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:37,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:37,830 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:37,831 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 09:53:38,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:38,350 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 09:53:38,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:38,351 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:38,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:38,351 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:53:38,351 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 09:53:38,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:38,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 09:53:38,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 09:53:38,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:53:38,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:53:38,663 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:53:38,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:38,663 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:53:38,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:53:38,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:38,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:38,663 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:53:38,663 INFO L423 AbstractCegarLoop]: === Iteration 293 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:38,664 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:38,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1496761282, now seen corresponding path program 277 times [2018-10-04 09:53:38,664 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:38,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:38,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:38,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:38,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:38,738 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:38,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:38,739 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 293 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 293 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:38,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:38,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:38,784 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:38,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:38,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:38,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:38,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:38,806 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:38,806 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:53:39,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:39,326 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 09:53:39,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:39,327 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:39,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:39,327 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:53:39,327 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 09:53:39,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:53:39,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 09:53:39,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-10-04 09:53:39,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:53:39,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:53:39,737 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 09:53:39,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:39,737 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:53:39,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:39,738 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:53:39,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:39,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:39,738 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:53:39,738 INFO L423 AbstractCegarLoop]: === Iteration 294 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:39,738 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:39,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1494916162, now seen corresponding path program 278 times [2018-10-04 09:53:39,738 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:39,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:39,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:39,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:39,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:39,823 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:39,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:39,823 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 294 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 294 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:39,832 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:53:39,838 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:53:39,839 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:39,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:39,869 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:39,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:39,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:39,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:39,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:39,889 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:39,889 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 09:53:40,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:40,390 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:53:40,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:40,390 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:40,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:40,391 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:53:40,391 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:53:40,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:40,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:53:40,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 09:53:40,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:53:40,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:53:40,712 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:53:40,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:40,712 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:53:40,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:40,712 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:53:40,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:40,712 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:40,712 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:53:40,712 INFO L423 AbstractCegarLoop]: === Iteration 295 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:40,713 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:40,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1494914240, now seen corresponding path program 279 times [2018-10-04 09:53:40,713 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:40,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:40,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:40,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:40,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:40,775 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:40,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:40,775 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 295 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 295 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:40,782 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:53:40,792 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 09:53:40,792 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:40,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:40,825 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:40,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:40,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:40,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:40,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:40,847 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:40,847 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:53:41,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:41,315 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 09:53:41,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:41,315 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:41,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:41,316 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:53:41,316 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:53:41,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:53:41,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:53:41,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2018-10-04 09:53:41,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:53:41,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:53:41,580 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 19 [2018-10-04 09:53:41,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:41,580 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:53:41,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:41,580 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:53:41,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:41,581 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:41,581 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 09:53:41,581 INFO L423 AbstractCegarLoop]: === Iteration 296 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:41,581 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:41,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1703255100, now seen corresponding path program 280 times [2018-10-04 09:53:41,581 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:41,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:41,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:41,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:41,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:41,655 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:41,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:41,656 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 296 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 296 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:41,665 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:53:41,670 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:53:41,670 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:41,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:41,702 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:41,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:41,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:41,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:41,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:41,724 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:41,724 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 11 states. [2018-10-04 09:53:42,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:42,312 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 09:53:42,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:42,313 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:42,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:42,313 INFO L225 Difference]: With dead ends: 55 [2018-10-04 09:53:42,313 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 09:53:42,313 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:53:42,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 09:53:42,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 09:53:42,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:53:42,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:53:42,631 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:53:42,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:42,631 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:53:42,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:42,631 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:53:42,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:42,631 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:42,631 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:53:42,631 INFO L423 AbstractCegarLoop]: === Iteration 297 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:42,631 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:42,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1703257022, now seen corresponding path program 281 times [2018-10-04 09:53:42,631 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:42,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:42,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:42,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:42,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:42,711 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:42,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:42,711 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 297 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 297 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:42,719 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:53:42,729 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 09:53:42,729 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:42,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:42,770 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:42,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:42,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:42,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:42,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:42,792 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:42,792 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:53:43,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:43,352 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 09:53:43,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:43,353 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:43,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:43,353 INFO L225 Difference]: With dead ends: 53 [2018-10-04 09:53:43,353 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 09:53:43,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:43,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 09:53:43,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 09:53:43,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:53:43,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:53:43,662 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 09:53:43,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:43,662 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:53:43,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:43,662 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:53:43,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:43,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:43,662 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:53:43,663 INFO L423 AbstractCegarLoop]: === Iteration 298 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:43,663 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:43,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1705102142, now seen corresponding path program 282 times [2018-10-04 09:53:43,663 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:43,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:43,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:43,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:43,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:43,730 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:43,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:43,730 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 298 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 298 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:43,739 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:53:43,749 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 09:53:43,750 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:43,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:43,959 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:43,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:43,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:43,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:43,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:43,998 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:43,999 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 09:53:44,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:44,971 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 09:53:44,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:44,972 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:44,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:44,972 INFO L225 Difference]: With dead ends: 55 [2018-10-04 09:53:44,972 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 09:53:44,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 9 [2018-10-04 09:53:44,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 09:53:45,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 09:53:45,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:53:45,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:53:45,286 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:53:45,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:45,286 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:53:45,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:45,287 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:53:45,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:45,287 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:45,287 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:53:45,287 INFO L423 AbstractCegarLoop]: === Iteration 299 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:45,287 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:45,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1705104064, now seen corresponding path program 283 times [2018-10-04 09:53:45,287 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:45,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:45,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:45,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:45,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:45,348 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:45,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:45,349 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 299 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 299 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:45,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:45,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:45,394 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:45,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:45,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:45,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:45,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:45,416 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:45,416 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:53:45,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:45,969 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 09:53:45,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:45,969 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:45,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:45,970 INFO L225 Difference]: With dead ends: 53 [2018-10-04 09:53:45,970 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 09:53:45,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:53:45,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 09:53:46,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2018-10-04 09:53:46,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:53:46,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:53:46,396 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 09:53:46,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:46,397 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:53:46,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:46,397 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:53:46,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:46,397 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:46,397 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:53:46,397 INFO L423 AbstractCegarLoop]: === Iteration 300 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:46,397 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:46,397 INFO L82 PathProgramCache]: Analyzing trace with hash -816704834, now seen corresponding path program 284 times [2018-10-04 09:53:46,398 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:46,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:46,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:46,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:46,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:46,479 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:46,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:46,479 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 300 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 300 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:46,486 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:53:46,491 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:53:46,492 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:46,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:46,523 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:46,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:46,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:46,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:46,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:46,544 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:46,544 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 09:53:47,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:47,059 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 09:53:47,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:47,059 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:47,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:47,060 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:53:47,060 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 09:53:47,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:47,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 09:53:47,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 09:53:47,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:53:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:53:47,386 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:53:47,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:47,387 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:53:47,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:47,387 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:53:47,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:47,387 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:47,387 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:53:47,387 INFO L423 AbstractCegarLoop]: === Iteration 301 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:47,387 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:47,387 INFO L82 PathProgramCache]: Analyzing trace with hash -816702912, now seen corresponding path program 285 times [2018-10-04 09:53:47,387 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:47,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:47,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:47,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:47,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:47,449 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:47,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:47,449 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 301 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 301 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:47,458 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:53:47,467 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 09:53:47,467 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:47,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:47,508 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:47,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:47,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:47,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:47,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:47,529 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:47,529 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:53:48,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:48,063 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 09:53:48,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:48,064 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:48,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:48,064 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:53:48,064 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 09:53:48,064 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:53:48,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 09:53:48,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-10-04 09:53:48,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:53:48,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:53:48,374 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 09:53:48,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:48,374 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:53:48,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:48,374 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:53:48,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:48,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:48,374 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:53:48,375 INFO L423 AbstractCegarLoop]: === Iteration 302 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:48,375 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:48,375 INFO L82 PathProgramCache]: Analyzing trace with hash -814857792, now seen corresponding path program 286 times [2018-10-04 09:53:48,375 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:48,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:48,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:48,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:48,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:48,452 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:48,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:48,453 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 302 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 302 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:48,460 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:53:48,466 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:53:48,467 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:48,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:48,512 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:48,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:48,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:48,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:48,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:48,534 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:48,534 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 09:53:49,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:49,048 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:53:49,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:49,049 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:49,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:49,049 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:53:49,049 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:53:49,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:49,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:53:49,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 09:53:49,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:53:49,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:53:49,364 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:53:49,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:49,364 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:53:49,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:49,364 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:53:49,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:49,364 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:49,365 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:53:49,365 INFO L423 AbstractCegarLoop]: === Iteration 303 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:49,365 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:49,365 INFO L82 PathProgramCache]: Analyzing trace with hash -814855870, now seen corresponding path program 287 times [2018-10-04 09:53:49,365 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:49,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:49,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:49,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:49,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:49,441 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:49,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:49,441 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 303 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 303 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:49,449 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:53:49,457 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 09:53:49,458 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:49,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:49,503 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:49,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:49,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:49,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:49,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:49,524 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:49,524 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:53:49,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:49,988 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 09:53:49,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:49,988 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:49,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:49,988 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:53:49,988 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:53:49,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:49,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:53:50,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 26. [2018-10-04 09:53:50,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:53:50,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:53:50,225 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 19 [2018-10-04 09:53:50,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:50,225 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:53:50,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:50,225 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:53:50,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:50,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:50,225 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 09:53:50,225 INFO L423 AbstractCegarLoop]: === Iteration 304 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:50,226 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:50,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1724261308, now seen corresponding path program 288 times [2018-10-04 09:53:50,226 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:50,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:50,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:50,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:50,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:50,294 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:50,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:50,294 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 304 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 304 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:50,303 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:53:50,313 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 09:53:50,313 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:50,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:50,349 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:50,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:50,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:50,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:50,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:50,370 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:50,370 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 11 states. [2018-10-04 09:53:50,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:50,881 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:53:50,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:50,882 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:50,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:50,882 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:53:50,882 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:53:50,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:53:50,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:53:51,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 09:53:51,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:53:51,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:53:51,212 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:53:51,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:51,212 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:53:51,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:51,212 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:53:51,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:51,212 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:51,212 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:53:51,212 INFO L423 AbstractCegarLoop]: === Iteration 305 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:51,213 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:51,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1724263230, now seen corresponding path program 289 times [2018-10-04 09:53:51,213 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:51,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:51,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:51,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:51,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:51,290 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:51,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:51,291 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 305 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 305 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:51,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:51,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:51,348 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:51,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:51,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:51,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:51,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:51,369 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:51,369 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:53:51,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:51,870 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:53:51,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:51,871 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:51,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:51,871 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:53:51,871 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:53:51,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:51,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:53:52,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-04 09:53:52,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:53:52,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:53:52,189 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 09:53:52,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:52,189 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:53:52,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:52,189 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:53:52,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:52,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:52,189 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:53:52,189 INFO L423 AbstractCegarLoop]: === Iteration 306 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:52,189 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:52,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1726108350, now seen corresponding path program 290 times [2018-10-04 09:53:52,189 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:52,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:52,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:52,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:52,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:52,264 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:52,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:52,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 306 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 306 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:52,272 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:53:52,280 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:53:52,280 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:52,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:52,313 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:52,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:52,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:52,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:52,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:52,334 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:52,334 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 09:53:52,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:52,817 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 09:53:52,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:52,817 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:52,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:52,818 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:53:52,818 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:53:52,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:52,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:53:53,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2018-10-04 09:53:53,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:53:53,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:53:53,143 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:53:53,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:53,143 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:53:53,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:53,143 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:53:53,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:53,144 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:53,144 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:53:53,144 INFO L423 AbstractCegarLoop]: === Iteration 307 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:53,144 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:53,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1726110272, now seen corresponding path program 291 times [2018-10-04 09:53:53,144 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:53,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:53,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:53,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:53,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:53,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:53,208 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:53,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:53,208 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 307 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 307 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:53,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:53:53,225 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 09:53:53,225 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:53,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:53,270 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:53,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:53,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:53,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:53,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:53,290 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:53,290 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:53:53,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:53,748 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 09:53:53,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:53,748 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:53,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:53,749 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:53:53,749 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:53:53,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:53,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:53:54,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 09:53:54,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:53:54,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:53:54,049 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 09:53:54,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:54,049 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:53:54,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:54,049 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:53:54,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:54,049 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:54,049 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:53:54,049 INFO L423 AbstractCegarLoop]: === Iteration 308 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:54,049 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:54,049 INFO L82 PathProgramCache]: Analyzing trace with hash -795698626, now seen corresponding path program 292 times [2018-10-04 09:53:54,050 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:54,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:54,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:54,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:54,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:54,124 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:54,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:54,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 308 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 308 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:54,133 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:53:54,138 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:53:54,138 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:54,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:54,183 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:54,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:54,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:54,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:54,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:54,204 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:54,204 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 09:53:54,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:54,721 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:53:54,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:54,722 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:54,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:54,722 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:53:54,722 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:53:54,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:54,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:53:55,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 09:53:55,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:53:55,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:53:55,049 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:53:55,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:55,050 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:53:55,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:55,050 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:53:55,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:55,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:55,050 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:53:55,050 INFO L423 AbstractCegarLoop]: === Iteration 309 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:55,050 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:55,050 INFO L82 PathProgramCache]: Analyzing trace with hash -795696704, now seen corresponding path program 293 times [2018-10-04 09:53:55,050 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:55,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:55,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:55,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:55,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:55,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:55,147 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 309 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 309 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:55,154 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:53:55,164 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 09:53:55,164 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:55,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:55,193 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:55,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:55,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:55,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:55,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:55,215 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:55,215 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:53:55,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:55,727 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:53:55,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:55,728 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:55,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:55,728 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:53:55,728 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:53:55,728 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:55,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:53:56,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-04 09:53:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:53:56,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:53:56,048 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 09:53:56,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:56,048 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:53:56,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:53:56,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:56,049 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:56,049 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:53:56,049 INFO L423 AbstractCegarLoop]: === Iteration 310 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:56,049 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:56,049 INFO L82 PathProgramCache]: Analyzing trace with hash -793851584, now seen corresponding path program 294 times [2018-10-04 09:53:56,049 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:56,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:56,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:56,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:56,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:56,114 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:56,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:56,114 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 310 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 310 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:56,122 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:53:56,135 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 09:53:56,135 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:56,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:56,204 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:56,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:56,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:56,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:56,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:56,226 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:56,226 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 09:53:56,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:56,708 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 09:53:56,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:56,709 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:56,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:56,709 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:53:56,709 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:53:56,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:56,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:53:57,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2018-10-04 09:53:57,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:53:57,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:53:57,037 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:53:57,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:57,037 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:53:57,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:57,038 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:53:57,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:57,038 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:57,038 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:53:57,038 INFO L423 AbstractCegarLoop]: === Iteration 311 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:57,038 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:57,038 INFO L82 PathProgramCache]: Analyzing trace with hash -793849662, now seen corresponding path program 295 times [2018-10-04 09:53:57,038 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:57,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:57,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:57,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:57,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:57,114 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:57,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:57,114 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 311 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 311 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:57,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:57,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:57,174 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:57,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:57,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:57,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:57,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:57,195 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:57,195 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:53:57,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:57,655 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 09:53:57,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:57,655 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:57,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:57,656 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:53:57,656 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:53:57,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:57,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:53:57,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-04 09:53:57,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:53:57,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:53:57,927 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 19 [2018-10-04 09:53:57,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:57,928 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:53:57,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:57,928 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:53:57,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:57,928 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:57,928 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:53:57,928 INFO L423 AbstractCegarLoop]: === Iteration 312 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:57,928 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:57,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1890647618, now seen corresponding path program 296 times [2018-10-04 09:53:57,928 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:57,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:57,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:57,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:53:57,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:58,005 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:58,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:58,005 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 312 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 312 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:58,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:53:58,019 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:53:58,019 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:58,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:58,054 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:58,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:58,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:58,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:58,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:58,074 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:58,074 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 11 states. [2018-10-04 09:53:58,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:58,526 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 09:53:58,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:58,526 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:58,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:58,526 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:53:58,527 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:53:58,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:53:58,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:53:58,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2018-10-04 09:53:58,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:53:58,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:53:58,862 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:53:58,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:58,862 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:53:58,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:58,862 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:53:58,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:58,863 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:58,863 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:53:58,863 INFO L423 AbstractCegarLoop]: === Iteration 313 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:58,863 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:58,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1890645696, now seen corresponding path program 297 times [2018-10-04 09:53:58,863 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:58,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:58,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:58,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:58,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:53:59,030 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:59,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:53:59,031 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 313 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 313 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:53:59,040 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:53:59,048 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 09:53:59,049 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:53:59,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:53:59,086 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:53:59,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:53:59,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:53:59,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:53:59,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:53:59,107 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:53:59,107 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:53:59,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:53:59,552 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 09:53:59,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:53:59,552 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:53:59,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:53:59,552 INFO L225 Difference]: With dead ends: 43 [2018-10-04 09:53:59,553 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 09:53:59,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 9 [2018-10-04 09:53:59,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 09:53:59,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2018-10-04 09:53:59,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:53:59,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:53:59,881 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 09:53:59,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:53:59,881 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:53:59,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:53:59,881 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:53:59,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:53:59,881 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:53:59,881 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:53:59,881 INFO L423 AbstractCegarLoop]: === Iteration 314 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:53:59,881 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:53:59,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1888800576, now seen corresponding path program 298 times [2018-10-04 09:53:59,882 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:53:59,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:53:59,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:59,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:53:59,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:53:59,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:00,031 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:00,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:00,032 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 314 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 314 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:00,039 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:54:00,046 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:54:00,046 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:00,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:00,105 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:00,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:00,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:00,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:00,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:00,134 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:00,134 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 09:54:00,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:00,645 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 09:54:00,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:00,646 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:00,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:00,646 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:54:00,646 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:54:00,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 9 [2018-10-04 09:54:00,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:54:00,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2018-10-04 09:54:00,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:54:00,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:54:00,975 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:54:00,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:00,975 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:54:00,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:00,976 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:54:00,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:00,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:00,976 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:54:00,976 INFO L423 AbstractCegarLoop]: === Iteration 315 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:00,976 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:00,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1888798654, now seen corresponding path program 299 times [2018-10-04 09:54:00,976 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:00,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:00,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:00,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:00,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:01,051 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:01,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:01,051 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 315 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 315 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:01,059 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:54:01,069 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 09:54:01,069 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:01,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:01,106 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:01,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:01,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:01,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:01,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:01,127 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:01,127 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:54:01,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:01,569 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 09:54:01,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:01,569 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:01,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:01,570 INFO L225 Difference]: With dead ends: 43 [2018-10-04 09:54:01,570 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 09:54:01,570 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:54:01,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 09:54:01,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2018-10-04 09:54:01,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:54:01,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:54:01,879 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 09:54:01,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:01,879 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:54:01,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:01,879 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:54:01,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:01,879 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:01,879 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:54:01,880 INFO L423 AbstractCegarLoop]: === Iteration 316 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:01,880 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:01,880 INFO L82 PathProgramCache]: Analyzing trace with hash -115640256, now seen corresponding path program 300 times [2018-10-04 09:54:01,880 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:01,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:01,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:01,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:01,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:01,952 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:01,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:01,953 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 316 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 316 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:01,960 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:54:01,969 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 09:54:01,970 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:01,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:02,021 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:02,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:02,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:02,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:02,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:02,042 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:02,042 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 09:54:02,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:02,447 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 09:54:02,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:02,447 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:02,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:02,448 INFO L225 Difference]: With dead ends: 41 [2018-10-04 09:54:02,448 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:54:02,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:54:02,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:54:02,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2018-10-04 09:54:02,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:54:02,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:54:02,778 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:54:02,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:02,778 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:54:02,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:02,779 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:54:02,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:02,779 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:02,779 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:54:02,779 INFO L423 AbstractCegarLoop]: === Iteration 317 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:02,779 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:02,779 INFO L82 PathProgramCache]: Analyzing trace with hash -115638334, now seen corresponding path program 301 times [2018-10-04 09:54:02,779 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:02,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:02,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:02,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:02,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:02,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:02,856 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 317 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 317 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:02,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:54:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:02,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:02,913 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:02,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:02,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:02,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:02,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:02,934 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:02,934 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:54:03,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:03,351 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 09:54:03,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:03,352 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:03,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:03,352 INFO L225 Difference]: With dead ends: 41 [2018-10-04 09:54:03,352 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:54:03,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:54:03,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:54:03,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2018-10-04 09:54:03,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:54:03,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:54:03,674 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 09:54:03,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:03,674 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:54:03,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:03,675 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:54:03,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:03,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:03,675 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:54:03,675 INFO L423 AbstractCegarLoop]: === Iteration 318 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:03,675 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:03,675 INFO L82 PathProgramCache]: Analyzing trace with hash -113793214, now seen corresponding path program 302 times [2018-10-04 09:54:03,675 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:03,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:03,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:03,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:54:03,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:03,739 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:03,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:03,739 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 318 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 318 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:03,747 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:54:03,753 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:54:03,753 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:03,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:03,784 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:03,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:03,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:03,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:03,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:03,806 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:03,806 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 09:54:04,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:04,237 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 09:54:04,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:04,237 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:04,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:04,237 INFO L225 Difference]: With dead ends: 39 [2018-10-04 09:54:04,237 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 09:54:04,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:54:04,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 09:54:04,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2018-10-04 09:54:04,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:54:04,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:54:04,572 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:54:04,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:04,572 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:54:04,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:04,572 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:54:04,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:04,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:04,572 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 09:54:04,573 INFO L423 AbstractCegarLoop]: === Iteration 319 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:04,573 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:04,573 INFO L82 PathProgramCache]: Analyzing trace with hash -113791292, now seen corresponding path program 303 times [2018-10-04 09:54:04,573 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:04,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:04,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:04,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:04,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:04,653 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:04,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:04,653 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 319 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 319 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:04,661 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:54:04,673 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 09:54:04,674 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:04,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:04,722 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:04,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:04,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:04,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:04,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:04,743 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:04,743 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:54:05,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:05,122 INFO L93 Difference]: Finished difference Result 38 states and 54 transitions. [2018-10-04 09:54:05,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:05,123 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:05,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:05,123 INFO L225 Difference]: With dead ends: 38 [2018-10-04 09:54:05,123 INFO L226 Difference]: Without dead ends: 36 [2018-10-04 09:54:05,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:54:05,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-04 09:54:05,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 22. [2018-10-04 09:54:05,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 09:54:05,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 09:54:05,330 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 19 [2018-10-04 09:54:05,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:05,330 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 09:54:05,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:05,330 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 09:54:05,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:05,330 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:05,330 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2018-10-04 09:54:05,330 INFO L423 AbstractCegarLoop]: === Iteration 320 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:05,330 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:05,331 INFO L82 PathProgramCache]: Analyzing trace with hash 330139066, now seen corresponding path program 304 times [2018-10-04 09:54:05,331 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:05,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:05,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:05,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:05,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:05,434 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:05,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:05,435 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 320 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 320 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:05,444 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:54:05,472 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:54:05,473 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:05,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:05,755 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:05,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:05,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:05,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:05,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:05,777 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:05,777 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 11 states. [2018-10-04 09:54:06,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:06,516 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 09:54:06,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:06,517 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:06,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:06,517 INFO L225 Difference]: With dead ends: 61 [2018-10-04 09:54:06,517 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 09:54:06,517 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.0s impTime 9 [2018-10-04 09:54:06,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 09:54:06,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 09:54:06,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:54:06,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:54:06,887 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:54:06,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:06,887 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:54:06,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:06,888 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:54:06,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:06,888 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:06,888 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 09:54:06,888 INFO L423 AbstractCegarLoop]: === Iteration 321 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:06,888 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:06,888 INFO L82 PathProgramCache]: Analyzing trace with hash 330140988, now seen corresponding path program 305 times [2018-10-04 09:54:06,888 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:06,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:06,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:06,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:06,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:06,956 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:06,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:06,956 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 321 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 321 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:06,965 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:54:06,975 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 09:54:06,975 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:06,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:07,023 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:07,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:07,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:07,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:07,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:07,043 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:07,043 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:54:07,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:07,793 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 09:54:07,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:07,794 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:07,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:07,794 INFO L225 Difference]: With dead ends: 61 [2018-10-04 09:54:07,794 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 09:54:07,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:54:07,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 09:54:08,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 09:54:08,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:54:08,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:54:08,154 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 09:54:08,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:08,154 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:54:08,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:08,154 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:54:08,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:08,155 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:08,155 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 09:54:08,155 INFO L423 AbstractCegarLoop]: === Iteration 322 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:08,155 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:08,155 INFO L82 PathProgramCache]: Analyzing trace with hash 331986108, now seen corresponding path program 306 times [2018-10-04 09:54:08,155 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:08,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:08,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:08,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:08,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:08,232 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:08,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:08,233 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 322 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 322 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:08,241 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:54:08,252 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 09:54:08,252 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:08,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:08,286 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:08,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:08,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:08,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:08,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:08,307 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:08,307 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 09:54:09,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:09,025 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 09:54:09,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:09,026 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:09,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:09,026 INFO L225 Difference]: With dead ends: 59 [2018-10-04 09:54:09,026 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 09:54:09,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:54:09,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 09:54:09,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 09:54:09,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:54:09,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:54:09,398 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:54:09,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:09,398 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:54:09,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:09,398 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:54:09,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:09,398 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:09,399 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:54:09,399 INFO L423 AbstractCegarLoop]: === Iteration 323 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:09,399 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:09,399 INFO L82 PathProgramCache]: Analyzing trace with hash 331988030, now seen corresponding path program 307 times [2018-10-04 09:54:09,399 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:09,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:09,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:09,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:09,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:09,474 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:09,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:09,474 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 323 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 323 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:09,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:54:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:09,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:09,520 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:09,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:09,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:09,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:09,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:09,541 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:09,541 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:54:10,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:10,244 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 09:54:10,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:10,245 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:10,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:10,245 INFO L225 Difference]: With dead ends: 57 [2018-10-04 09:54:10,245 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 09:54:10,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:54:10,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 09:54:10,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2018-10-04 09:54:10,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:54:10,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:54:10,588 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 09:54:10,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:10,588 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:54:10,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:10,588 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:54:10,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:10,589 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:10,589 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 09:54:10,589 INFO L423 AbstractCegarLoop]: === Iteration 324 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:10,589 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:10,589 INFO L82 PathProgramCache]: Analyzing trace with hash 2105146428, now seen corresponding path program 308 times [2018-10-04 09:54:10,589 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:10,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:10,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:10,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:54:10,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:10,672 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:10,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:10,672 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 324 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 324 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:10,680 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:54:10,686 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:54:10,686 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:10,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:10,715 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:10,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:10,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:10,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:10,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:10,736 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:10,736 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 09:54:11,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:11,481 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 09:54:11,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:11,482 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:11,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:11,482 INFO L225 Difference]: With dead ends: 61 [2018-10-04 09:54:11,482 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 09:54:11,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:54:11,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 09:54:12,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 09:54:12,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:54:12,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:54:12,007 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:54:12,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:12,007 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:54:12,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:12,007 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:54:12,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:12,007 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:12,008 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:54:12,008 INFO L423 AbstractCegarLoop]: === Iteration 325 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:12,008 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:12,008 INFO L82 PathProgramCache]: Analyzing trace with hash 2105148350, now seen corresponding path program 309 times [2018-10-04 09:54:12,008 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:12,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:12,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:12,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:12,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:12,079 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:12,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:12,079 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 325 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 325 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:12,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:54:12,097 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 09:54:12,097 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:12,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:12,137 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:12,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:12,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:12,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:12,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:12,158 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:12,159 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:54:12,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:12,910 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 09:54:12,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:12,910 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:12,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:12,911 INFO L225 Difference]: With dead ends: 61 [2018-10-04 09:54:12,911 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 09:54:12,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:54:12,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 09:54:13,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 09:54:13,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:54:13,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:54:13,273 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 09:54:13,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:13,274 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:54:13,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:13,274 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:54:13,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:13,274 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:13,274 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:54:13,274 INFO L423 AbstractCegarLoop]: === Iteration 326 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:13,274 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:13,274 INFO L82 PathProgramCache]: Analyzing trace with hash 2106993470, now seen corresponding path program 310 times [2018-10-04 09:54:13,274 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:13,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:13,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:13,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:13,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:13,340 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:13,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:13,340 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 326 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 326 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:13,348 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:54:13,354 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:54:13,354 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:13,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:13,410 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:13,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:13,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:13,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:13,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:13,431 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:13,431 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 09:54:14,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:14,148 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 09:54:14,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:14,149 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:14,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:14,149 INFO L225 Difference]: With dead ends: 59 [2018-10-04 09:54:14,149 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 09:54:14,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:54:14,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 09:54:14,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 09:54:14,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:54:14,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:54:14,522 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:54:14,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:14,522 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:54:14,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:14,522 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:54:14,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:14,522 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:14,522 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:54:14,523 INFO L423 AbstractCegarLoop]: === Iteration 327 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:14,523 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:14,523 INFO L82 PathProgramCache]: Analyzing trace with hash 2106995392, now seen corresponding path program 311 times [2018-10-04 09:54:14,523 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:14,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:14,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:14,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:14,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:14,598 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:14,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:14,598 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 327 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 327 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:14,606 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:54:14,616 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 09:54:14,616 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:14,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:14,893 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:14,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:14,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:14,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:14,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:14,913 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:14,913 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:54:15,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:15,617 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 09:54:15,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:15,618 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:15,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:15,618 INFO L225 Difference]: With dead ends: 57 [2018-10-04 09:54:15,618 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 09:54:15,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.0s impTime 9 [2018-10-04 09:54:15,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 09:54:15,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2018-10-04 09:54:15,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:54:15,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:54:15,933 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 19 [2018-10-04 09:54:15,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:15,933 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:54:15,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:15,933 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:54:15,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:15,933 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:15,933 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 09:54:15,934 INFO L423 AbstractCegarLoop]: === Iteration 328 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:15,934 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:15,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1010197436, now seen corresponding path program 312 times [2018-10-04 09:54:15,934 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:15,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:15,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:15,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:15,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:15,995 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:15,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:15,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 328 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 328 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:16,002 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:54:16,013 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 09:54:16,014 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:16,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:16,057 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:16,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:16,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:16,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:16,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:16,079 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:16,079 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 11 states. [2018-10-04 09:54:16,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:16,771 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 09:54:16,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:16,771 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:16,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:16,772 INFO L225 Difference]: With dead ends: 57 [2018-10-04 09:54:16,772 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 09:54:16,772 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:54:16,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 09:54:17,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 09:54:17,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:54:17,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:54:17,147 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:54:17,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:17,147 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:54:17,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:17,147 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:54:17,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:17,147 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:17,147 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:54:17,147 INFO L423 AbstractCegarLoop]: === Iteration 329 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:17,147 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:17,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1010199358, now seen corresponding path program 313 times [2018-10-04 09:54:17,148 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:17,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:17,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:17,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:17,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:17,214 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:17,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:17,215 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 329 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 329 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:17,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:54:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:17,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:17,269 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:17,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:17,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:17,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:17,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:17,290 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:17,291 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:54:17,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:17,956 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 09:54:17,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:17,957 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:17,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:17,957 INFO L225 Difference]: With dead ends: 55 [2018-10-04 09:54:17,957 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 09:54:17,957 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:54:17,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 09:54:18,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 09:54:18,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:54:18,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:54:18,327 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 09:54:18,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:18,327 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:54:18,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:18,328 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:54:18,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:18,328 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:18,328 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:54:18,328 INFO L423 AbstractCegarLoop]: === Iteration 330 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:18,328 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:18,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1012044478, now seen corresponding path program 314 times [2018-10-04 09:54:18,328 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:18,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:18,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:18,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:54:18,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:18,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:18,391 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 330 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 330 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:18,399 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:54:18,404 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:54:18,404 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:18,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:18,439 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:18,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:18,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:18,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:18,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:18,461 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:18,461 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 09:54:19,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:19,157 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 09:54:19,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:19,158 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:19,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:19,158 INFO L225 Difference]: With dead ends: 57 [2018-10-04 09:54:19,158 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 09:54:19,158 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:54:19,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 09:54:19,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 09:54:19,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:54:19,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:54:19,535 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:54:19,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:19,535 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:54:19,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:19,535 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:54:19,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:19,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:19,536 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:54:19,536 INFO L423 AbstractCegarLoop]: === Iteration 331 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:19,536 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:19,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1012046400, now seen corresponding path program 315 times [2018-10-04 09:54:19,536 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:19,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:19,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:19,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:19,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:19,602 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:19,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:19,602 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 331 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 331 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:19,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:54:19,623 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 09:54:19,623 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:19,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:19,658 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:19,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:19,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:19,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:19,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:19,679 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:19,679 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:54:20,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:20,346 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 09:54:20,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:20,347 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:20,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:20,347 INFO L225 Difference]: With dead ends: 55 [2018-10-04 09:54:20,347 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 09:54:20,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:54:20,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 09:54:20,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 30. [2018-10-04 09:54:20,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:54:20,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:54:20,695 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 09:54:20,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:20,695 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:54:20,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:20,695 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:54:20,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:20,695 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:20,695 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:54:20,695 INFO L423 AbstractCegarLoop]: === Iteration 332 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:20,696 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:20,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1509762498, now seen corresponding path program 316 times [2018-10-04 09:54:20,696 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:20,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:20,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:20,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:20,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:20,798 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:20,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:20,799 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 332 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 332 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:20,806 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:54:20,812 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:54:20,812 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:20,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:20,851 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:20,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:20,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:20,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:20,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:20,873 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:20,873 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 09:54:21,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:21,508 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 09:54:21,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:21,508 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:21,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:21,509 INFO L225 Difference]: With dead ends: 53 [2018-10-04 09:54:21,509 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 09:54:21,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:54:21,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 09:54:21,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2018-10-04 09:54:21,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:54:21,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:54:21,884 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:54:21,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:21,884 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:54:21,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:21,884 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:54:21,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:21,884 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:21,884 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:54:21,885 INFO L423 AbstractCegarLoop]: === Iteration 333 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:21,885 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:21,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1509760576, now seen corresponding path program 317 times [2018-10-04 09:54:21,885 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:21,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:21,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:21,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:21,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:21,961 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:21,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:21,962 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 333 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 333 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:21,970 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:54:21,979 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 09:54:21,980 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:21,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:22,027 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:22,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:22,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:22,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:22,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:22,051 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:22,051 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:54:22,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:22,687 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 09:54:22,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:22,688 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:22,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:22,688 INFO L225 Difference]: With dead ends: 53 [2018-10-04 09:54:22,688 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 09:54:22,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:54:22,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 09:54:23,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 09:54:23,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:54:23,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:54:23,057 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 09:54:23,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:23,057 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:54:23,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:23,057 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:54:23,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:23,058 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:23,058 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:54:23,058 INFO L423 AbstractCegarLoop]: === Iteration 334 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:23,058 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:23,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1507915456, now seen corresponding path program 318 times [2018-10-04 09:54:23,058 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:23,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:23,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:23,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:23,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:23,121 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:23,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:23,122 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 334 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 334 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:23,130 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:54:23,139 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 09:54:23,140 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:23,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:23,187 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:23,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:23,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:23,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:23,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:23,207 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:23,208 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 09:54:23,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:23,819 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 09:54:23,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:23,820 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:23,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:23,820 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:54:23,820 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 09:54:23,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:54:23,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 09:54:24,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 09:54:24,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:54:24,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:54:24,199 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:54:24,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:24,199 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:54:24,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:24,199 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:54:24,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:24,199 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:24,199 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:54:24,199 INFO L423 AbstractCegarLoop]: === Iteration 335 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:24,199 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:24,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1507913534, now seen corresponding path program 319 times [2018-10-04 09:54:24,200 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:24,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:24,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:24,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:24,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:24,277 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:24,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:24,277 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 335 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 335 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:24,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:54:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:24,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:24,332 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:24,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:24,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:24,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:24,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:24,353 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:24,353 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:54:24,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:24,940 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:54:24,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:24,941 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:24,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:24,941 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:54:24,941 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:54:24,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:54:24,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:54:25,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2018-10-04 09:54:25,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:54:25,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:54:25,228 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 19 [2018-10-04 09:54:25,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:25,229 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:54:25,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:25,229 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:54:25,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:25,229 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:25,229 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 09:54:25,229 INFO L423 AbstractCegarLoop]: === Iteration 336 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:25,229 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:25,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1031203644, now seen corresponding path program 320 times [2018-10-04 09:54:25,229 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:25,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:25,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:25,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:54:25,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:25,307 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:25,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:25,307 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 336 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 336 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:25,316 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:54:25,331 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:54:25,332 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:25,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:25,377 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:25,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:25,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:25,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:25,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:25,397 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:25,397 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 11 states. [2018-10-04 09:54:26,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:26,171 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 09:54:26,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:26,172 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:26,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:26,172 INFO L225 Difference]: With dead ends: 61 [2018-10-04 09:54:26,172 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 09:54:26,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:54:26,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 09:54:26,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 09:54:26,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:54:26,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:54:26,569 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:54:26,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:26,569 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:54:26,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:26,569 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:54:26,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:26,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:26,570 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:54:26,570 INFO L423 AbstractCegarLoop]: === Iteration 337 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:26,570 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:26,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1031205566, now seen corresponding path program 321 times [2018-10-04 09:54:26,570 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:26,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:26,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:26,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:26,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:26,654 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:26,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:26,655 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 337 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 337 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:26,662 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:54:26,670 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 09:54:26,671 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:26,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:26,716 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:26,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:26,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:26,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:26,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:26,737 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:26,737 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:54:27,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:27,523 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 09:54:27,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:27,523 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:27,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:27,524 INFO L225 Difference]: With dead ends: 61 [2018-10-04 09:54:27,524 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 09:54:27,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:54:27,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 09:54:27,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 09:54:27,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:54:27,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:54:27,905 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 09:54:27,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:27,905 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:54:27,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:27,905 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:54:27,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:27,905 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:27,906 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:54:27,906 INFO L423 AbstractCegarLoop]: === Iteration 338 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:27,906 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:27,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1033050686, now seen corresponding path program 322 times [2018-10-04 09:54:27,906 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:27,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:27,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:27,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:27,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:27,967 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:27,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:27,967 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 338 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 338 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:27,975 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:54:27,982 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:54:27,982 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:27,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:28,019 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:28,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:28,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:28,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:28,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:28,040 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:28,040 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 09:54:28,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:28,796 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 09:54:28,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:28,796 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:28,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:28,797 INFO L225 Difference]: With dead ends: 59 [2018-10-04 09:54:28,797 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 09:54:28,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:54:28,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 09:54:29,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 09:54:29,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:54:29,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:54:29,186 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:54:29,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:29,186 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:54:29,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:29,186 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:54:29,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:29,186 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:29,186 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:54:29,186 INFO L423 AbstractCegarLoop]: === Iteration 339 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:29,186 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:29,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1033052608, now seen corresponding path program 323 times [2018-10-04 09:54:29,187 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:29,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:29,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:29,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:29,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:29,260 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:29,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:29,261 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 339 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 339 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:29,269 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:54:29,278 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 09:54:29,278 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:29,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:29,326 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:29,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:29,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:29,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:29,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:29,346 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:29,346 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:54:30,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:30,073 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 09:54:30,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:30,074 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:30,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:30,074 INFO L225 Difference]: With dead ends: 57 [2018-10-04 09:54:30,074 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 09:54:30,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:54:30,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 09:54:30,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2018-10-04 09:54:30,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:54:30,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:54:30,435 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 09:54:30,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:30,435 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:54:30,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:30,435 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:54:30,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:30,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:30,435 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:54:30,435 INFO L423 AbstractCegarLoop]: === Iteration 340 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:30,435 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:30,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1488756290, now seen corresponding path program 324 times [2018-10-04 09:54:30,436 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:30,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:30,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:30,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:30,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:30,499 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:30,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:30,499 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 340 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 340 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:30,507 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:54:30,534 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 09:54:30,534 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:30,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:30,705 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:30,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:30,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:30,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:30,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:30,727 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:30,727 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 09:54:31,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:31,511 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 09:54:31,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:31,512 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:31,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:31,512 INFO L225 Difference]: With dead ends: 61 [2018-10-04 09:54:31,512 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 09:54:31,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 9 [2018-10-04 09:54:31,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 09:54:31,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 09:54:31,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:54:31,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:54:31,904 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:54:31,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:31,904 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:54:31,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:31,904 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:54:31,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:31,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:31,904 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:54:31,904 INFO L423 AbstractCegarLoop]: === Iteration 341 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:31,904 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:31,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1488754368, now seen corresponding path program 325 times [2018-10-04 09:54:31,905 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:31,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:31,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:31,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:31,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:31,983 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:31,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:31,983 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 341 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 341 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:31,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:54:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:32,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:32,045 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:32,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:32,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:32,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:32,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:32,067 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:32,067 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:54:32,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:32,860 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 09:54:32,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:32,861 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:32,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:32,861 INFO L225 Difference]: With dead ends: 61 [2018-10-04 09:54:32,861 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 09:54:32,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:54:32,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 09:54:33,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 09:54:33,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:54:33,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:54:33,241 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 09:54:33,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:33,241 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:54:33,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:33,241 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:54:33,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:33,242 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:33,242 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:54:33,242 INFO L423 AbstractCegarLoop]: === Iteration 342 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:33,242 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:33,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1486909248, now seen corresponding path program 326 times [2018-10-04 09:54:33,242 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:33,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:33,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:33,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:54:33,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:33,318 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:33,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:33,318 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 342 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 342 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:33,326 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:54:33,334 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:54:33,335 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:33,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:33,379 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:33,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:33,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:33,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:33,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:33,401 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:33,401 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 09:54:34,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:34,145 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 09:54:34,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:34,145 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:34,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:34,145 INFO L225 Difference]: With dead ends: 59 [2018-10-04 09:54:34,146 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 09:54:34,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:54:34,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 09:54:34,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 09:54:34,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:54:34,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:54:34,536 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:54:34,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:34,536 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:54:34,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:34,536 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:54:34,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:34,537 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:34,537 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:54:34,537 INFO L423 AbstractCegarLoop]: === Iteration 343 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:34,537 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:34,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1486907326, now seen corresponding path program 327 times [2018-10-04 09:54:34,537 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:34,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:34,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:34,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:34,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:34,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:34,606 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:34,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:34,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 343 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 343 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:34,614 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:54:34,623 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 09:54:34,624 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:34,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:34,685 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:34,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:34,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:34,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:34,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:34,706 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:34,706 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:54:35,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:35,428 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 09:54:35,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:35,429 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:35,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:35,429 INFO L225 Difference]: With dead ends: 57 [2018-10-04 09:54:35,429 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 09:54:35,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:54:35,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 09:54:35,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2018-10-04 09:54:35,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:54:35,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:54:35,766 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 19 [2018-10-04 09:54:35,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:35,766 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:54:35,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:35,766 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:54:35,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:35,767 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:35,767 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:54:35,767 INFO L423 AbstractCegarLoop]: === Iteration 344 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:35,767 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:35,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1711262014, now seen corresponding path program 328 times [2018-10-04 09:54:35,767 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:35,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:35,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:35,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:35,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:36,084 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:36,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:36,085 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 344 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 344 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:36,093 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:54:36,098 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:54:36,098 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:36,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:36,136 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:36,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:36,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:36,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:36,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:36,158 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:36,158 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 11 states. [2018-10-04 09:54:36,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:36,881 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 09:54:36,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:36,882 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:36,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:36,882 INFO L225 Difference]: With dead ends: 57 [2018-10-04 09:54:36,882 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 09:54:36,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 9 [2018-10-04 09:54:36,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 09:54:37,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 09:54:37,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:54:37,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:54:37,279 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:54:37,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:37,279 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:54:37,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:37,279 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:54:37,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:37,279 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:37,279 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:54:37,279 INFO L423 AbstractCegarLoop]: === Iteration 345 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:37,280 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:37,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1711263936, now seen corresponding path program 329 times [2018-10-04 09:54:37,280 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:37,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:37,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:37,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:37,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:37,352 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:37,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:37,352 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 345 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 345 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:37,360 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:54:37,368 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 09:54:37,368 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:37,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:37,410 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:37,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:37,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:37,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:37,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:37,431 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:37,431 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:54:38,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:38,127 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 09:54:38,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:38,127 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:38,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:38,128 INFO L225 Difference]: With dead ends: 55 [2018-10-04 09:54:38,128 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 09:54:38,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:54:38,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 09:54:38,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 09:54:38,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:54:38,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:54:38,513 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 09:54:38,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:38,513 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:54:38,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:38,513 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:54:38,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:38,513 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:38,513 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:54:38,514 INFO L423 AbstractCegarLoop]: === Iteration 346 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:38,514 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:38,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1713109056, now seen corresponding path program 330 times [2018-10-04 09:54:38,514 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:38,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:38,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:38,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:38,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:38,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:38,593 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 346 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 346 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:38,601 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:54:38,611 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 09:54:38,611 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:38,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:38,645 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:38,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:38,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:38,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:38,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:38,667 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:38,667 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 09:54:39,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:39,387 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 09:54:39,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:39,388 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:39,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:39,388 INFO L225 Difference]: With dead ends: 57 [2018-10-04 09:54:39,388 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 09:54:39,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:54:39,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 09:54:39,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 09:54:39,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:54:39,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:54:39,784 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:54:39,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:39,784 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:54:39,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:39,784 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:54:39,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:39,784 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:39,784 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:54:39,784 INFO L423 AbstractCegarLoop]: === Iteration 347 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:39,784 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:39,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1713110978, now seen corresponding path program 331 times [2018-10-04 09:54:39,785 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:39,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:39,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:39,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:39,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:39,970 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:39,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:39,970 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 347 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 347 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:39,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:54:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:39,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:40,007 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:40,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:40,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:40,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:40,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:40,029 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:40,029 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:54:40,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:40,717 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 09:54:40,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:40,717 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:40,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:40,718 INFO L225 Difference]: With dead ends: 55 [2018-10-04 09:54:40,718 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 09:54:40,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 9 [2018-10-04 09:54:40,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 09:54:41,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 30. [2018-10-04 09:54:41,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:54:41,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:54:41,088 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 09:54:41,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:41,088 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:54:41,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:41,088 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:54:41,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:41,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:41,088 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:54:41,088 INFO L423 AbstractCegarLoop]: === Iteration 348 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:41,088 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:41,089 INFO L82 PathProgramCache]: Analyzing trace with hash -808697920, now seen corresponding path program 332 times [2018-10-04 09:54:41,089 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:41,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:41,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:41,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:54:41,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:41,195 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:41,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:41,195 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 348 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 348 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:41,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:54:41,210 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:54:41,210 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:41,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:41,243 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:41,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:41,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:41,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:41,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:41,265 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:41,265 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 09:54:41,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:41,928 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 09:54:41,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:41,929 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:41,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:41,929 INFO L225 Difference]: With dead ends: 53 [2018-10-04 09:54:41,929 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 09:54:41,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:54:41,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 09:54:42,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2018-10-04 09:54:42,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:54:42,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:54:42,329 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:54:42,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:42,329 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:54:42,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:42,330 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:54:42,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:42,330 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:42,330 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:54:42,330 INFO L423 AbstractCegarLoop]: === Iteration 349 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:42,330 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:42,330 INFO L82 PathProgramCache]: Analyzing trace with hash -808695998, now seen corresponding path program 333 times [2018-10-04 09:54:42,330 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:42,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:42,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:42,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:42,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:42,392 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:42,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:42,392 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 349 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 349 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:42,400 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:54:42,409 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 09:54:42,410 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:42,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:42,450 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:42,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:42,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:42,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:42,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:42,473 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:42,473 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:54:43,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:43,146 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 09:54:43,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:43,146 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:43,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:43,147 INFO L225 Difference]: With dead ends: 53 [2018-10-04 09:54:43,147 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 09:54:43,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:54:43,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 09:54:43,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 09:54:43,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:54:43,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:54:43,533 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 09:54:43,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:43,533 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:54:43,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:43,533 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:54:43,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:43,533 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:43,533 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:54:43,533 INFO L423 AbstractCegarLoop]: === Iteration 350 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:43,533 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:43,533 INFO L82 PathProgramCache]: Analyzing trace with hash -806850878, now seen corresponding path program 334 times [2018-10-04 09:54:43,533 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:43,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:43,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:43,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:43,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:43,609 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:43,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:43,610 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 350 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 350 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:43,616 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:54:43,622 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:54:43,623 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:43,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:43,668 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:43,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:43,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:43,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:43,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:43,689 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:43,690 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 09:54:44,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:44,331 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 09:54:44,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:44,332 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:44,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:44,332 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:54:44,332 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 09:54:44,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:54:44,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 09:54:44,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 09:54:44,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:54:44,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:54:44,730 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:54:44,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:44,730 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:54:44,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:44,730 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:54:44,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:44,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:44,731 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 09:54:44,731 INFO L423 AbstractCegarLoop]: === Iteration 351 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:44,731 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:44,731 INFO L82 PathProgramCache]: Analyzing trace with hash -806848956, now seen corresponding path program 335 times [2018-10-04 09:54:44,731 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:44,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:44,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:44,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:44,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:44,919 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:44,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:44,919 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 351 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 351 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:44,926 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:54:44,935 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 09:54:44,936 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:44,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:44,958 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:44,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:44,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:44,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:44,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:44,980 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:44,980 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:54:45,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:45,598 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:54:45,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:45,599 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:45,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:45,599 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:54:45,599 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:54:45,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 9 [2018-10-04 09:54:45,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:54:45,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 24. [2018-10-04 09:54:45,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:54:45,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 09:54:45,867 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 19 [2018-10-04 09:54:45,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:45,867 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 09:54:45,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:45,868 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 09:54:45,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:45,868 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:45,868 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 09:54:45,868 INFO L423 AbstractCegarLoop]: === Iteration 352 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:45,868 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:45,868 INFO L82 PathProgramCache]: Analyzing trace with hash -256666948, now seen corresponding path program 336 times [2018-10-04 09:54:45,868 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:45,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:45,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:45,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:45,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:45,978 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:45,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:45,979 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 352 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 352 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:45,985 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:54:45,996 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 09:54:45,996 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:45,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:46,027 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:46,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:46,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:46,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:46,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:46,049 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:46,049 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 11 states. [2018-10-04 09:54:46,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:46,758 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 09:54:46,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:46,759 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:46,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:46,759 INFO L225 Difference]: With dead ends: 55 [2018-10-04 09:54:46,759 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 09:54:46,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:54:46,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 09:54:47,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 09:54:47,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:54:47,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:54:47,174 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:54:47,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:47,174 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:54:47,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:47,175 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:54:47,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:47,175 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:47,175 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:54:47,175 INFO L423 AbstractCegarLoop]: === Iteration 353 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:47,175 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:47,175 INFO L82 PathProgramCache]: Analyzing trace with hash -256665026, now seen corresponding path program 337 times [2018-10-04 09:54:47,175 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:47,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:47,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:47,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:47,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:47,251 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:47,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:47,251 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 353 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 353 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:47,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:54:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:47,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:47,296 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:47,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:47,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:47,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:47,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:47,317 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:47,317 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:54:47,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:47,997 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 09:54:47,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:47,997 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:47,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:47,998 INFO L225 Difference]: With dead ends: 53 [2018-10-04 09:54:47,998 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 09:54:47,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:54:47,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 09:54:48,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 09:54:48,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:54:48,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:54:48,401 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 09:54:48,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:48,401 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:54:48,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:48,401 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:54:48,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:48,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:48,401 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:54:48,401 INFO L423 AbstractCegarLoop]: === Iteration 354 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:48,401 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:48,401 INFO L82 PathProgramCache]: Analyzing trace with hash -254819906, now seen corresponding path program 338 times [2018-10-04 09:54:48,401 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:48,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:48,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:48,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:54:48,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:48,464 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:48,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:48,465 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 354 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 354 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:48,477 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:54:48,498 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:54:48,498 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:48,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:48,562 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:48,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:48,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:48,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:48,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:48,586 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:48,587 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 09:54:49,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:49,290 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 09:54:49,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:49,291 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:49,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:49,291 INFO L225 Difference]: With dead ends: 55 [2018-10-04 09:54:49,291 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 09:54:49,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:54:49,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 09:54:49,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 09:54:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:54:49,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:54:49,707 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:54:49,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:49,707 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:54:49,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:49,707 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:54:49,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:49,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:49,707 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:54:49,707 INFO L423 AbstractCegarLoop]: === Iteration 355 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:49,707 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:49,707 INFO L82 PathProgramCache]: Analyzing trace with hash -254817984, now seen corresponding path program 339 times [2018-10-04 09:54:49,707 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:49,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:49,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:49,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:49,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:49,782 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:49,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:49,783 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 355 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 355 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:49,791 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:54:49,799 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 09:54:49,800 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:49,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:49,848 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:49,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:49,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:49,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:49,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:49,869 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:49,869 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:54:50,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:50,540 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 09:54:50,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:50,541 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:50,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:50,541 INFO L225 Difference]: With dead ends: 53 [2018-10-04 09:54:50,541 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 09:54:50,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:54:50,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 09:54:50,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2018-10-04 09:54:50,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:54:50,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:54:50,926 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 09:54:50,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:50,926 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:54:50,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:50,927 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:54:50,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:50,927 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:50,927 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:54:50,927 INFO L423 AbstractCegarLoop]: === Iteration 356 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:50,927 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:50,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1518340414, now seen corresponding path program 340 times [2018-10-04 09:54:50,927 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:50,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:50,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:50,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:50,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:51,001 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:51,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:51,002 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 356 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 356 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:51,019 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:54:51,053 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:54:51,053 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:51,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:51,124 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:51,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:51,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:51,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:51,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:51,145 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:51,145 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 09:54:51,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:51,806 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 09:54:51,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:51,807 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:51,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:51,807 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:54:51,807 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 09:54:51,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:54:51,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 09:54:52,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 09:54:52,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:54:52,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:54:52,228 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:54:52,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:52,229 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:54:52,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:52,229 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:54:52,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:52,229 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:52,229 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:54:52,229 INFO L423 AbstractCegarLoop]: === Iteration 357 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:52,229 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:52,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1518342336, now seen corresponding path program 341 times [2018-10-04 09:54:52,229 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:52,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:52,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:52,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:52,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:52,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:52,302 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 357 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 357 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:52,310 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:54:52,320 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 09:54:52,320 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:52,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:52,350 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:52,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:52,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:52,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:52,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:52,372 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:52,372 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:54:53,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:53,014 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 09:54:53,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:53,015 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:53,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:53,015 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:54:53,015 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 09:54:53,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:54:53,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 09:54:53,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-10-04 09:54:53,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:54:53,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:54:53,420 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 09:54:53,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:53,420 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:54:53,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:53,420 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:54:53,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:53,420 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:53,420 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:54:53,420 INFO L423 AbstractCegarLoop]: === Iteration 358 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:53,420 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:53,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1520187456, now seen corresponding path program 342 times [2018-10-04 09:54:53,420 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:53,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:53,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:53,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:53,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:53,498 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:53,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:53,499 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 358 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 358 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:53,507 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:54:53,515 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 09:54:53,515 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:53,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:53,545 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:53,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:53,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:53,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:53,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:53,567 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:53,567 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 09:54:54,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:54,197 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:54:54,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:54,198 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:54,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:54,198 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:54:54,198 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:54:54,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:54:54,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:54:54,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 09:54:54,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:54:54,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:54:54,615 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:54:54,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:54,615 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:54:54,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:54,616 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:54:54,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:54,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:54,616 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:54:54,616 INFO L423 AbstractCegarLoop]: === Iteration 359 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:54,616 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:54,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1520189378, now seen corresponding path program 343 times [2018-10-04 09:54:54,616 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:54,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:54,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:54,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:54,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:54,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:54,693 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 359 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 359 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:54,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:54:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:54,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:54,736 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:54,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:54,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:54,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:54,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:54,757 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:54,757 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:54:55,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:55,362 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 09:54:55,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:55,363 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:55,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:55,363 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:54:55,363 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:54:55,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:54:55,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:54:55,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2018-10-04 09:54:55,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:54:55,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 09:54:55,719 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 19 [2018-10-04 09:54:55,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:55,719 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 09:54:55,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:55,719 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 09:54:55,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:55,719 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:55,719 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:54:55,720 INFO L423 AbstractCegarLoop]: === Iteration 360 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:55,720 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:55,720 INFO L82 PathProgramCache]: Analyzing trace with hash 423391422, now seen corresponding path program 344 times [2018-10-04 09:54:55,720 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:55,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:55,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:55,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:54:55,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:55,780 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:55,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:55,781 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 360 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 360 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:55,790 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:54:55,796 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:54:55,796 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:55,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:55,829 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:55,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:55,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:55,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:55,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:55,850 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:55,850 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 11 states. [2018-10-04 09:54:56,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:56,559 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 09:54:56,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:56,559 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:56,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:56,559 INFO L225 Difference]: With dead ends: 55 [2018-10-04 09:54:56,560 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 09:54:56,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:54:56,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 09:54:56,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 09:54:56,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:54:56,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:54:56,981 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:54:56,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:56,981 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:54:56,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:56,981 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:54:56,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:56,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:56,981 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:54:56,981 INFO L423 AbstractCegarLoop]: === Iteration 361 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:56,981 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:56,982 INFO L82 PathProgramCache]: Analyzing trace with hash 423393344, now seen corresponding path program 345 times [2018-10-04 09:54:56,982 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:56,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:56,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:56,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:56,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:57,038 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:57,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:57,038 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 361 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 361 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:57,046 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:54:57,054 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 09:54:57,055 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:57,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:57,114 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:57,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:57,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:57,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:57,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:57,135 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:57,136 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:54:57,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:57,846 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 09:54:57,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:57,847 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:57,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:57,847 INFO L225 Difference]: With dead ends: 53 [2018-10-04 09:54:57,847 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 09:54:57,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:54:57,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 09:54:58,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 09:54:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:54:58,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:54:58,259 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 09:54:58,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:58,259 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:54:58,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:58,259 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:54:58,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:58,260 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:58,260 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:54:58,260 INFO L423 AbstractCegarLoop]: === Iteration 362 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:58,260 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:58,260 INFO L82 PathProgramCache]: Analyzing trace with hash 425238464, now seen corresponding path program 346 times [2018-10-04 09:54:58,260 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:58,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:58,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:58,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:58,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:58,399 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:58,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:58,400 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 362 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 362 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:58,407 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:54:58,413 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:54:58,413 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:58,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:58,502 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:58,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:58,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:58,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:58,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:58,523 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:58,523 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 09:54:59,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:54:59,247 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 09:54:59,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:54:59,247 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:54:59,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:54:59,248 INFO L225 Difference]: With dead ends: 55 [2018-10-04 09:54:59,248 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 09:54:59,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 9 [2018-10-04 09:54:59,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 09:54:59,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 09:54:59,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:54:59,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:54:59,667 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:54:59,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:54:59,667 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:54:59,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:54:59,668 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:54:59,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:54:59,668 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:54:59,668 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:54:59,668 INFO L423 AbstractCegarLoop]: === Iteration 363 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:54:59,668 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:54:59,668 INFO L82 PathProgramCache]: Analyzing trace with hash 425240386, now seen corresponding path program 347 times [2018-10-04 09:54:59,668 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:54:59,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:54:59,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:59,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:54:59,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:54:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:54:59,730 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:59,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:54:59,731 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 363 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 363 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:54:59,738 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:54:59,748 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 09:54:59,748 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:54:59,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:54:59,790 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:54:59,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:54:59,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:54:59,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:54:59,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:54:59,811 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:54:59,812 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:55:00,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:55:00,512 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 09:55:00,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:55:00,512 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:55:00,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:55:00,513 INFO L225 Difference]: With dead ends: 53 [2018-10-04 09:55:00,513 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 09:55:00,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:55:00,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 09:55:00,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2018-10-04 09:55:00,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:55:00,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:55:00,901 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 09:55:00,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:55:00,901 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:55:00,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:55:00,901 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:55:00,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:55:00,901 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:55:00,901 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:55:00,902 INFO L423 AbstractCegarLoop]: === Iteration 364 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:55:00,902 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:55:00,902 INFO L82 PathProgramCache]: Analyzing trace with hash -2096568512, now seen corresponding path program 348 times [2018-10-04 09:55:00,902 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:55:00,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:55:00,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:00,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:55:00,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:55:00,957 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:55:00,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:55:00,958 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 364 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 364 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:55:00,966 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:55:00,977 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 09:55:00,977 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:55:00,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:55:01,026 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:55:01,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:55:01,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:55:01,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:55:01,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:55:01,046 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:55:01,046 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 09:55:01,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:55:01,711 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 09:55:01,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:55:01,712 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:55:01,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:55:01,712 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:55:01,712 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 09:55:01,712 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:55:01,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 09:55:02,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 09:55:02,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:55:02,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:55:02,141 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:55:02,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:55:02,141 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:55:02,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:55:02,141 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:55:02,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:55:02,141 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:55:02,141 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:55:02,142 INFO L423 AbstractCegarLoop]: === Iteration 365 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:55:02,142 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:55:02,142 INFO L82 PathProgramCache]: Analyzing trace with hash -2096566590, now seen corresponding path program 349 times [2018-10-04 09:55:02,142 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:55:02,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:55:02,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:02,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:55:02,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:55:02,200 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:55:02,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:55:02,201 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 365 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 365 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:55:02,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:55:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:55:02,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:55:02,247 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:55:02,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:55:02,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:55:02,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:55:02,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:55:02,269 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:55:02,269 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:55:02,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:55:02,924 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 09:55:02,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:55:02,924 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:55:02,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:55:02,925 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:55:02,925 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 09:55:02,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:55:02,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 09:55:03,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-10-04 09:55:03,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:55:03,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:55:03,341 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 09:55:03,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:55:03,341 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:55:03,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:55:03,341 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:55:03,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:55:03,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:55:03,342 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:55:03,342 INFO L423 AbstractCegarLoop]: === Iteration 366 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:55:03,342 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:55:03,342 INFO L82 PathProgramCache]: Analyzing trace with hash -2094721470, now seen corresponding path program 350 times [2018-10-04 09:55:03,342 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:55:03,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:55:03,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:03,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:55:03,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:55:03,396 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:55:03,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:55:03,396 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 366 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 366 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:55:03,404 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:55:03,410 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:55:03,411 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:55:03,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:55:03,444 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:55:03,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:55:03,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:55:03,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:55:03,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:55:03,466 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:55:03,466 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 09:55:04,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:55:04,097 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:55:04,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:55:04,097 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:55:04,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:55:04,098 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:55:04,098 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:55:04,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:55:04,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:55:04,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 09:55:04,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:55:04,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:55:04,525 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:55:04,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:55:04,525 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:55:04,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:55:04,525 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:55:04,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:55:04,525 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:55:04,525 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 09:55:04,526 INFO L423 AbstractCegarLoop]: === Iteration 367 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:55:04,526 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:55:04,526 INFO L82 PathProgramCache]: Analyzing trace with hash -2094719548, now seen corresponding path program 351 times [2018-10-04 09:55:04,526 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:55:04,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:55:04,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:04,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:55:04,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:55:04,826 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:55:04,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:55:04,826 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 367 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 367 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:55:04,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:55:04,843 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 09:55:04,843 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:55:04,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:55:04,878 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:55:04,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:55:04,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:55:04,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:55:04,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:55:04,899 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:55:04,899 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:55:05,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:55:05,504 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 09:55:05,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:55:05,504 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:55:05,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:55:05,505 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:55:05,505 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:55:05,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 9 [2018-10-04 09:55:05,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:55:05,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 26. [2018-10-04 09:55:05,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:55:05,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 09:55:05,824 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 19 [2018-10-04 09:55:05,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:55:05,824 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 09:55:05,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:55:05,824 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 09:55:05,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:55:05,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:55:05,825 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:55:05,825 INFO L423 AbstractCegarLoop]: === Iteration 368 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:55:05,825 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:55:05,825 INFO L82 PathProgramCache]: Analyzing trace with hash 444397630, now seen corresponding path program 352 times [2018-10-04 09:55:05,825 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:55:05,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:55:05,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:05,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:55:05,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:55:05,881 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:55:05,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:55:05,881 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 368 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 368 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:55:05,888 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:55:05,894 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:55:05,895 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:55:05,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:55:05,927 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:55:05,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:55:05,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:55:05,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:55:05,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:55:05,948 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:55:05,948 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 11 states. [2018-10-04 09:55:06,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:55:06,577 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:55:06,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:55:06,578 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:55:06,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:55:06,578 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:55:06,578 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:55:06,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:55:06,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:55:07,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 09:55:07,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:55:07,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:55:07,010 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:55:07,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:55:07,010 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:55:07,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:55:07,010 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:55:07,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:55:07,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:55:07,010 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:55:07,010 INFO L423 AbstractCegarLoop]: === Iteration 369 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:55:07,010 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:55:07,010 INFO L82 PathProgramCache]: Analyzing trace with hash 444399552, now seen corresponding path program 353 times [2018-10-04 09:55:07,010 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:55:07,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:55:07,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:07,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:55:07,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:55:07,075 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:55:07,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:55:07,075 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 369 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 369 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:55:07,084 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:55:07,094 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 09:55:07,094 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:55:07,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:55:07,148 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:55:07,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:55:07,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:55:07,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:55:07,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:55:07,168 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:55:07,168 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:55:07,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:55:07,812 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:55:07,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:55:07,812 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:55:07,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:55:07,813 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:55:07,813 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:55:07,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 09:55:07,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:55:08,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-04 09:55:08,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:55:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:55:08,231 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 09:55:08,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:55:08,231 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:55:08,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:55:08,232 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:55:08,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:55:08,232 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:55:08,232 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:55:08,232 INFO L423 AbstractCegarLoop]: === Iteration 370 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:55:08,232 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:55:08,232 INFO L82 PathProgramCache]: Analyzing trace with hash 446244672, now seen corresponding path program 354 times [2018-10-04 09:55:08,232 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:55:08,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:55:08,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:08,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:55:08,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:55:08,295 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:55:08,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:55:08,296 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 370 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 370 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:55:08,305 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:55:08,315 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 09:55:08,316 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:55:08,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:55:08,355 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:55:08,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:55:08,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:55:08,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:55:08,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:55:08,376 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:55:08,376 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 09:55:08,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:55:08,982 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 09:55:08,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:55:08,983 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:55:08,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:55:08,983 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:55:08,983 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:55:08,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:55:08,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:55:09,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2018-10-04 09:55:09,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:55:09,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:55:09,415 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:55:09,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:55:09,415 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:55:09,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:55:09,415 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:55:09,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:55:09,416 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:55:09,416 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:55:09,416 INFO L423 AbstractCegarLoop]: === Iteration 371 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:55:09,416 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:55:09,416 INFO L82 PathProgramCache]: Analyzing trace with hash 446246594, now seen corresponding path program 355 times [2018-10-04 09:55:09,416 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:55:09,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:55:09,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:09,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:55:09,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:55:09,480 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:55:09,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:55:09,481 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 371 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 371 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:55:09,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:55:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:55:09,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:55:09,529 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:55:09,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:55:09,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:55:09,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:55:09,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:55:09,550 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:55:09,550 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:55:10,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:55:10,130 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 09:55:10,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:55:10,131 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:55:10,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:55:10,131 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:55:10,131 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:55:10,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:55:10,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:55:10,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 09:55:10,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:55:10,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 09:55:10,531 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 09:55:10,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:55:10,531 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 09:55:10,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:55:10,531 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 09:55:10,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:55:10,531 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:55:10,531 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 09:55:10,531 INFO L423 AbstractCegarLoop]: === Iteration 372 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:55:10,531 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:55:10,532 INFO L82 PathProgramCache]: Analyzing trace with hash -2075562304, now seen corresponding path program 356 times [2018-10-04 09:55:10,532 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:55:10,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:55:10,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:10,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:55:10,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:55:10,588 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:55:10,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:55:10,589 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 372 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 372 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:55:10,597 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:55:10,603 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:55:10,603 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:55:10,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:55:10,634 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:55:10,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:55:10,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:55:10,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:55:10,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:55:10,655 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:55:10,655 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 09:55:11,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:55:11,285 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:55:11,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:55:11,286 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:55:11,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:55:11,286 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:55:11,286 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:55:11,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:55:11,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:55:11,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 09:55:11,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:55:11,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:55:11,724 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:55:11,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:55:11,724 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:55:11,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:55:11,724 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:55:11,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:55:11,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:55:11,724 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:55:11,725 INFO L423 AbstractCegarLoop]: === Iteration 373 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:55:11,725 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:55:11,725 INFO L82 PathProgramCache]: Analyzing trace with hash -2075560382, now seen corresponding path program 357 times [2018-10-04 09:55:11,725 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:55:11,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:55:11,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:11,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:55:11,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:55:11,805 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:55:11,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:55:11,805 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 373 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 373 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:55:11,816 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:55:11,824 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 09:55:11,824 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:55:11,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:55:11,848 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:55:11,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:55:11,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:55:11,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:55:11,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:55:11,870 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:55:11,870 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:55:12,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:55:12,503 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 09:55:12,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:55:12,504 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:55:12,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:55:12,504 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:55:12,504 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:55:12,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:55:12,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:55:12,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-04 09:55:12,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:55:12,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 09:55:12,929 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 09:55:12,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:55:12,929 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 09:55:12,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:55:12,929 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 09:55:12,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:55:12,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:55:12,930 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 09:55:12,930 INFO L423 AbstractCegarLoop]: === Iteration 374 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:55:12,930 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:55:12,930 INFO L82 PathProgramCache]: Analyzing trace with hash -2073715262, now seen corresponding path program 358 times [2018-10-04 09:55:12,930 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:55:12,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:55:12,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:12,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:55:12,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:55:12,988 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:55:12,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:55:12,988 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 374 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 374 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:55:12,995 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:55:13,000 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:55:13,000 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:55:13,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:55:13,036 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:55:13,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:55:13,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:55:13,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:55:13,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:55:13,057 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:55:13,057 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 09:55:13,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:55:13,671 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 09:55:13,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:55:13,671 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:55:13,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:55:13,671 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:55:13,672 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:55:13,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:55:13,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:55:14,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2018-10-04 09:55:14,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:55:14,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 09:55:14,106 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 09:55:14,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:55:14,106 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 09:55:14,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 09:55:14,106 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 09:55:14,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 09:55:14,106 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:55:14,106 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 09:55:14,106 INFO L423 AbstractCegarLoop]: === Iteration 375 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:55:14,106 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:55:14,106 INFO L82 PathProgramCache]: Analyzing trace with hash -2073713340, now seen corresponding path program 359 times [2018-10-04 09:55:14,107 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:55:14,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:55:14,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:14,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:55:14,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:55:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:55:14,162 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:55:14,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:55:14,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 375 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 375 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:55:14,171 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:55:14,179 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 09:55:14,179 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:55:14,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:55:14,228 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:55:14,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:55:14,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 09:55:14,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 09:55:14,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 09:55:14,248 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:55:14,248 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 09:55:14,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:55:14,822 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 09:55:14,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:55:14,822 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 09:55:14,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:55:14,823 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:55:14,823 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:55:14,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 9 [2018-10-04 09:55:14,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. Received shutdown request... [2018-10-04 09:55:15,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-04 09:55:15,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 09:55:15,195 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 09:55:15,200 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 09:55:15,200 INFO L202 PluginConnector]: Adding new model Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:55:15 BoogieIcfgContainer [2018-10-04 09:55:15,200 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:55:15,201 INFO L168 Benchmark]: Toolchain (without parser) took 258880.66 ms. Allocated memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: -438.8 MB). Free memory was 1.4 GB in the beginning and 918.0 MB in the end (delta: 529.3 MB). Peak memory consumption was 134.2 MB. Max. memory is 7.1 GB. [2018-10-04 09:55:15,204 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:55:15,204 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:55:15,204 INFO L168 Benchmark]: Boogie Preprocessor took 20.90 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:55:15,205 INFO L168 Benchmark]: RCFGBuilder took 243.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 09:55:15,205 INFO L168 Benchmark]: TraceAbstraction took 258565.67 ms. Allocated memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: -438.8 MB). Free memory was 1.4 GB in the beginning and 918.0 MB in the end (delta: 508.2 MB). Peak memory consumption was 113.0 MB. Max. memory is 7.1 GB. [2018-10-04 09:55:15,207 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.90 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 243.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 258565.67 ms. Allocated memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: -438.8 MB). Free memory was 1.4 GB in the beginning and 918.0 MB in the end (delta: 508.2 MB). Peak memory consumption was 113.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 29). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 258.4s OverallTime, 375 OverallIterations, 8 TraceHistogramMax, 123.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1502 SDtfs, 2875 SDslu, 5066 SDs, 0 SdLazy, 8617 SolverSat, 4920 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8992 GetRequests, 6119 SyntacticMatches, 0 SemanticMatches, 2873 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 52.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=256, 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: 63.7s AutomataMinimizationTime, 375 MinimizatonAttempts, 5590 StatesRemovedByMinimization, 374 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 54.7s InterpolantComputationTime, 12239 NumberOfCodeBlocks, 12239 NumberOfCodeBlocksAsserted, 2119 NumberOfCheckSat, 11490 ConstructedInterpolants, 0 QuantifiedInterpolants, 523560 SizeOfPredicates, 374 NumberOfNonLiveVariables, 15856 ConjunctsInSsa, 3246 ConjunctsInUnsatCore, 749 InterpolantComputations, 1 PerfectInterpolantSequences, 0/34804 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/Luxembourg-sophisticated.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-55-15-215.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Luxembourg-sophisticated.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-55-15-215.csv Completed graceful shutdown